{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"CodegenCx::build_intrinsics_map (cyclomatic 124): CodegenCx::build_intrinsics_map has cyclomatic complexity 124 (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":"crates/rustc_codegen_nvvm/src/ctx_intrinsics.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe638141fa7502404df00af5def1e7e50607531c39c3ce5ed3b9713273419e1"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cyclomatic 89): Builder::codegen_intrinsic_call has cyclomatic complexity 89 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"089be6bd05a29bdfa32a4eb654296f2c4212d8977b604d2bbc5715c784ff10c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next_token (cyclomatic 51): Lexer::next_token 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":"crates/ptx/src/lexer.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c46a233aadf0df4779d583c2674772fa4922deaf26a8d6352a8ccd13acccafa"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_inline_asm (cyclomatic 33): Builder::codegen_inline_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":"crates/rustc_codegen_nvvm/src/asm.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd8cbfe5acb13e15c5265009409b2773703ece292057de03cd3ef280bf32421"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceViewFormat::from_array_format (cyclomatic 29): ResourceViewFormat::from_array_format 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":"crates/cust/src/texture.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7f0aaa1d7ca646b27666073cd508baebb3e08c5ab6940f48f4c5c13d67af8f"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::number (cyclomatic 23): Lexer::number has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ptx/src/lexer.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc690cc1213207826b9a4f69cd74541c38bb92740d97206de5dce77f928b345"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_nvvm::debug_info::metadata::type_di_node (cyclomatic 21): rustc_codegen_nvvm::debug_info::metadata::type_di_node 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":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc7176dfbc2106710d2d205f0362e8dedc0d67e85a4a5572b84d3b60045ffb7"}},{"ruleId":"D1","level":"warning","message":{"text":"NvvmOption::from_str (cyclomatic 20): NvvmOption::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: NvvmArch::from_str (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/nvvm/src/lib.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c43f151238586a4c4f7955f8cccfe51e7d8cfe8c674b23ec0033f60e6984f5"}},{"ruleId":"D1","level":"warning","message":{"text":"cuda_builder::invoke_rustc (cyclomatic 19): cuda_builder::invoke_rustc has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cuda_builder/src/lib.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcd86dd5aa3deec0d4fb4f7f75b03b718dd3f3feedc7856a8f2c2771f4a685b"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::load_operand (cyclomatic 19): Builder::load_operand has cyclomatic complexity 19 (threshold 15). Of this number, 11 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. This is NOT this file\u0027s highest cyclomatic complexity: Builder::checked_binop (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaef58f55a14cd15dca1fc1b04f90bd9b1f9a9e36241eb8a3a72418b2ddd0ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::dot (cyclomatic 17): Lexer::dot has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ptx/src/lexer.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0de11f8f239fa220421301eb64a08cf7253074ba6c524e58595245a5b53f0d1"}},{"ruleId":"D1","level":"warning","message":{"text":"PtxContent::extract_function_name (cyclomatic 17): PtxContent::extract_function_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":"crates/rustc_codegen_nvvm/src/ptx_filter.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c894f6c44b95db652808325f5ef3d43c17c2b134c64d5b01b6ffbc7b99d03c9"}},{"ruleId":"D1","level":"warning","message":{"text":"CodegenArgs::parse (cyclomatic 16): CodegenArgs::parse has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"440486e0b555e316ee14ec1c88b554ffd78784802c1c6f3c3bca997a7f2f213f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::build_intrinsics_map (cognitive 125): CodegenCx::build_intrinsics_map has cognitive complexity 125 (threshold 15). Drivers by points: loops 122 (124 pts), if/else 1 (nesting depth added 2). 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":"crates/rustc_codegen_nvvm/src/ctx_intrinsics.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c4fab727178a028d19c7f583da1276d72944f77279f622b291e4d3fa26983"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cognitive 76): Builder::codegen_intrinsic_call has cognitive complexity 76 (threshold 15). Drivers by points: if/else 29 (50 pts), match/switch 11 (24 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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"66afa091f27d4cb610c8d83ef517840088ffa86203b68239aef92fa5cb7fd6e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_inline_asm (cognitive 59): Builder::codegen_inline_asm has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (37 pts), match/switch 6 (14 pts), loops 5 (8 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":"crates/rustc_codegen_nvvm/src/asm.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c210f2f23bc18782ee825bc2499eb29ad912401471d6ae65954ea044e793836a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::get_fn (cognitive 49): CodegenCx::get_fn has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (48 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3104d172f947ce8453e86150dedc6d3fdc3dffab4f326f40ef82f8476359b06"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::scalar_to_backend (cognitive 32): CodegenCx::scalar_to_backend has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/const_ty.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"758fa635069161b86e186b4704d664d60ceec8a4b02da6e4107f4c7c5be41d00"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::number (cognitive 31): Lexer::number has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (8 pts), match/switch 2 (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":"crates/ptx/src/lexer.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5e9f103b9add6c74954528e663865e73f3d1db7d65dad5d2417ac36dd24dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayObject::from_descriptor (cognitive 29): ArrayObject::from_descriptor has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (27 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":"crates/cust/src/memory/array.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9599e77fa69618a2638fce808b54a728a7cc0ec1a0563162d0da8467dc09bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"CudnnSdk::collect_windows_cudnn_include_paths (cognitive 28): CudnnSdk::collect_windows_cudnn_include_paths has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (24 pts), loops 2 (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":"crates/cudnn-sys/build/cudnn_sdk.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc48814b3e3817c0500813e99f8b2e2c0cd51976d65d5c1c6d47b4eb5c89f29"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::dot (cognitive 28): Lexer::dot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 4, 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":"crates/ptx/src/lexer.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c1d15594988b6427109bd55017a989b4300fe594bee125912b57234f43c00"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::load_operand (cognitive 27): Builder::load_operand has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 2, match/switch 1 (nesting depth added 7). Of this number, 17 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":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e297e7911f0a69e5aa536751cf64332e8bff245b761bc258e26a60643da98c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_token (cognitive 26): Lexer::next_token has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 5 (9 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":"crates/ptx/src/lexer.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9d238af916d011e99f29986cf9399ab3e234f85e13578f06364b434e15cb6d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenArgs::parse (cognitive 24): CodegenArgs::parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (10 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":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5fb31df51a762e1730516644a35c6337bff90c4d51ff7c78b2c2c6c17a3520"}},{"ruleId":"D2","level":"warning","message":{"text":"PtxContent::extract_function_name (cognitive 24): PtxContent::extract_function_name has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/ptx_filter.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6447ce80dd039735f67b74e56933484a2632028a6457a3ccd4329e24a3df0dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"NvvmOption::from_str (cognitive 23): NvvmOption::from_str has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), 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":"crates/nvvm/src/lib.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39504454c6fdc4215167793c5505668dd087fb026dd0f69132b756fb3e1f4a2"}},{"ruleId":"D2","level":"warning","message":{"text":"cuda_builder::invoke_rustc (cognitive 21): cuda_builder::invoke_rustc has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 1 (2 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":"crates/cuda_builder/src/lib.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a683b21d04c003e81d74b4423631851db40d461a7acd5caea5a824880c35d1"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::dbg_scope_fn (cognitive 21): CodegenCx::dbg_scope_fn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (get_containing_scope, get_template_parameters, get_function_signature). 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":"crates/rustc_codegen_nvvm/src/debug_info/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eadfef6a4004f6a0235fb8166525febc9339c7e4d012d535d65dbc4c74642a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_llvm_intrinsic_call (cognitive 19): Builder::codegen_llvm_intrinsic_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c34b5327d974bb8ddf613215afd79c1cf112f9269c09d8ea89d312252bcc6e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::static_addrspace (cognitive 19): CodegenCx::static_addrspace has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0c155b3fa897bace417a7c3be04f60f36c35708aa0e703aad47caeef817119"}},{"ruleId":"D2","level":"warning","message":{"text":"PtxContent::format (cognitive 18): PtxContent::format has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (5 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":"crates/rustc_codegen_nvvm/src/ptx_filter.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eff82de1b5fccbada5f02852397fa831c5d3c4eb3c58bd027489a098e17f191"}},{"ruleId":"D2","level":"warning","message":{"text":"optix_device::transform::interpolated_transformation (cognitive 16): optix_device::transform::interpolated_transformation 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":"crates/optix_device/src/transform.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df4d3ff66e1f19e85b294e557297f87b7d4cd10984da72af2388d02fb38a89d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_nvvm::link::codegen_into_ptx_file (cognitive 16): rustc_codegen_nvvm::link::codegen_into_ptx_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (4 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":"crates/rustc_codegen_nvvm/src/link.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a6ed7a49ab783cf95221c562ccdc9d7c9dc7b9c3d34305d99c7b9f6fbe0825"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_nvvm::allocator::codegen (cognitive 16): rustc_codegen_nvvm::allocator::codegen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (5 pts), loops 3 (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":"crates/rustc_codegen_nvvm/src/allocator.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"37df563ed02ba8b09d888a779d340e52f25804a9900fed2cabb0d7ce17252e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.codegen_intrinsic_call: MethodTooLong \u2014 codegen_intrinsic_call runs 420 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 320 over it, 4.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc288a10f2f30bbe57ef2d49b16e8e298aa3226afd30f6a580609d4c1d731ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/llvm.rs: FileTooLong \u2014 1868 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1368 over it, 3.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/llvm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ca21bae9da2678a9037f6c13444f552a688c0b88d32f5bb5258276092aae9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenCx.build_intrinsics_map: MethodTooLong \u2014 build_intrinsics_map 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":"crates/rustc_codegen_nvvm/src/ctx_intrinsics.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"75397c33daee31944af23dd781c262e0bd013fbee7289e261ce22612300242e9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Builder: ClassTooLong \u2014 1052 significant 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, 15 blocks, lines 44-1696. The bar is 400 significant lines; this is 652 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":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d700e818f700d0c28b3ba637b8973625cd9ad2269878dae72a363441aedf096a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: atomic/intrinsics.rs: FileTooLong \u2014 1142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 642 over it, 2.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":"crates/cuda_std/src/atomic/intrinsics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c1055dbaa51ebfc0be627fed677bd23417cb4361246e136fbfeae7646e6f0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builder.rs: FileTooLong \u2014 1115 significant 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: Builder (15 blocks, 44-1696). The bar is 500 significant lines; this is 615 over it, 2.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":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b9933d5c5d15fba6b77b649ae0e390b973853adeec29804c9f987ed335a1ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/acceleration.rs: FileTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 528 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":"crates/optix/src/acceleration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eb6396d3dfd8ff7df3410be21662c0cb90311c00eb5b2033d0419ce41b355a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debug_info/metadata.rs: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1735f0f5525d68baa1673b4a49a3e5f12fa27cf6ff772643ad424e36c91a7068"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 47 methods, declared across 2 files: builder/emulate_i128.rs (34), src/builder.rs (13). The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c33f38e9a5321f28009304dc0537b9f3ea688043662db0be41037652b044d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodegenCx: TooManyMethods \u2014 46 methods, declared across 5 files: src/ty.rs (21), src/context.rs (16), src/consts.rs (6), src/ctx_intrinsics.rs (2), \u002B1 more file(s). The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c665342fd7a3e96103d8048add7b11eb61531e1e8feb60ed2f602a49e147b369"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CudnnContext: TooManyMethods \u2014 42 methods, declared across 10 files: convolution/mod.rs (10), dropout/mod.rs (5), op/mod.rs (5), rnn/mod.rs (5), \u002B6 more file(s). 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":"crates/cudnn/src/context.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"941f7c79c03a43b4635b0009a91f52c766a221b272f16c23ac82792b27dd02a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.codegen_inline_asm: MethodTooLong \u2014 codegen_inline_asm 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":"crates/rustc_codegen_nvvm/src/asm.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f375f05b816dff34452e658ff9d87a9217c78fc5213a64a4e2da0b2233652617"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intrinsic.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), about 75% of them inside a single declaration: Builder (236-935). The bar is 500 significant lines; this is 179 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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0f366b1aae9832c1e364789fbfe3f9acbe9fd9838fd8b2f87128a3e297b9cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CublasContext: TooManyMethods \u2014 39 methods, declared across 3 files: src/level1.rs (27), src/context.rs (11), src/level3.rs (1). 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":"crates/blastoff/src/context.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576ab8934d2b2f72bca6031173339ac660f1c165c98fd4a14f93e452bc851fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenCx.dbg_scope_fn: MethodTooLong \u2014 dbg_scope_fn runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/debug_info/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"92721120dea4f0be287ba6722e10fded87b7cfd8e683bf6b9b761b89f82850e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.next_token: MethodTooLong \u2014 next_token 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":"crates/ptx/src/lexer.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08bd6dffeced1c066dc6893ecebb2801ad2235cca059eaf473d546143eed12d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: raw/level1.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":"crates/blastoff/src/raw/level1.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e835f90a6289f935a1636867f860ea876b2e15c676dca6c4e4f0bce19477d377"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Denoiser.invoke: MethodTooLong \u2014 invoke runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/denoiser.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"98549b9267c3fbd1160486cdb8a7d4e89bcb26323651678e674f9e84caa04d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayObject.from_descriptor: MethodTooLong \u2014 from_descriptor runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/array.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bbb55093e68552b58109c60d9e374ed52cef44bd33fff2e56df16595b345dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.number: MethodTooLong \u2014 number runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ptx/src/lexer.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe730682255a9aa8777f48a2448a01f4aa03ebc1859eb2861d0ef3af7351941"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metadata/enums.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":"crates/rustc_codegen_nvvm/src/debug_info/metadata/enums.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bda1b9bdf81e71a7a145db21a3de4e1e282f4c0a8c6dd9c5bb8d64e53b0ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.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), about 80% of them inside a single declaration: CodegenCx (12 blocks, 48-815). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d499915a38d07b161d04163163c7fc31fd41a0a24d564d4ed290d09960629f21"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodegenCx: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 12 blocks, lines 48-815. The bar is 400 significant lines; this is 4 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":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d702f1f1667d893b008a7b496551f6e6735a2b7167021508c601ffd9269740"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/abi.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3 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":"crates/rustc_codegen_nvvm/src/abi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a278838ef59c12664f86b5c0c1e9e048051d1454498a55958d570b510ac78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): crates/optix/src/acceleration.rs:157-180 | crates/optix/src/acceleration.rs:285-308 | crates/optix/src/acceleration.rs:366-389 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/acceleration.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"75815ddf9b3c99e35969f2de57d798ed0e33cd9b2769cb3300d19d570fb25dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/optix/src/acceleration.rs:1316-1337 | crates/optix/src/acceleration.rs:1404-1425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/acceleration.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14148e9f3256a24144198ddeab9b2678b6bba751530002f8ae76ef9f40639ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/cust/src/memory/unified.rs:644-664 | crates/cust/src/memory/unified.rs:693-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/unified.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c3ddf297ca60a739b983768061278b4e976ac647ae42148f695d9b2119cdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/cudnn/src/convolution/convolution_algo.rs:116-131 | crates/cudnn/src/convolution/convolution_algo.rs:196-211 | crates/cudnn/src/convolution/convolution_algo.rs:293-308 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cudnn/src/convolution/convolution_algo.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a43b4cbefc0ff46e4a039d6f48a7e538f3a22c187c47700983e5b29540d8e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/nvvm/src/lib.rs:18-32 | crates/nvvm/src/lib.rs:36-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":"crates/nvvm/src/lib.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a85d2d580ccacc7302d616e795b042cb6c913a0e39b08445db8fd0c1b67ca36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/cust/src/memory/unified.rs:742-755 | crates/cust/src/memory/unified.rs:787-800 | crates/cust/src/memory/unified.rs:814-827 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/unified.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6d175c6e26003f0e773cae098367869d7a147d5f1f674c1f628e10c4ffcd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rustc_codegen_nvvm/src/debug_info/metadata.rs:1059-1072 | crates/rustc_codegen_nvvm/src/debug_info/metadata/enums.rs:171-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1f83b8c3dcce0be92a1e17a6f5952861fd6cb52046664539c052c16df1bec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/rustc_codegen_nvvm/src/debug_info/metadata.rs:1057-1068 | crates/rustc_codegen_nvvm/src/debug_info/metadata.rs:1095-1105 | crates/rustc_codegen_nvvm/src/debug_info/metadata/enums.rs:169-180 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c25b5274f6ae1e64eeda53dd5eb496259cc515f8303aca1beefe1a642a07beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/optix/src/acceleration.rs:1836-1847 | crates/optix/src/acceleration.rs:1985-1996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/acceleration.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"94070bc86d34e87ef0898f422aa911d583b883c48dd91b4583d90a0ce345e9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/optix/src/pipeline.rs:51-62 | crates/optix/src/pipeline.rs:588-599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/pipeline.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2d34bfd739b05aa162bdd86733139505999569525e3dc62fd937d1b1a9a18f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ptx/src/lexer.rs:293-302 | crates/ptx/src/lexer.rs:315-325 | crates/ptx/src/lexer.rs:338-348 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ptx/src/lexer.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"baffd723a12b7ab9c0d1163fd54d7a19bae6d51c0aff5999e361377dcfdcf4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/optix/src/acceleration.rs:1578-1588 | crates/optix/src/acceleration.rs:1596-1606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/acceleration.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ad0c882abb9663ab29f2d02c3ec003595f1291247105ac8556b3a2d392a3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/optix/src/acceleration.rs:1659-1669 | crates/optix/src/acceleration.rs:1692-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/acceleration.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b753c191a57d7594ee32a6e991e6300e722353c480d972f91975ce9d9c55d86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/optix/src/acceleration.rs:1302-1311 | crates/optix/src/acceleration.rs:1390-1399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/acceleration.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"485dc7d022770db62e69178101a9c921c3743b753b1e4ecdfa86e6a187a282ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/blastoff/src/level1.rs:317-325 | crates/blastoff/src/level1.rs:393-401 | crates/blastoff/src/level1.rs:441-449 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/blastoff/src/level1.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"41923a219e07636a494a822c1340cee9727a42eeaa076d50c7f3fc8d1f1e22a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cust/src/memory/array.rs:759-766 | crates/cust/src/memory/array.rs:804-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/array.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9da4fa20d7449aef939ff9568fd52dd5425e8c2dcb8bc889799c34549e25be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cudnn/src/activation/mod.rs:152-158 | crates/cudnn/src/pooling/mod.rs:118-124 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cudnn/src/activation/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e553bcd35c4074b6b71a279c3d2bc8a612126117b984a7e401101bac732fd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cudnn/src/backend/conv_bwd_data.rs:57-63 | crates/cudnn/src/backend/conv_bwd_filter.rs:56-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cudnn/src/backend/conv_bwd_data.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faace43072ebca6971ecd81859792517030b6602422664f6d2302fa6f7f4df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/cudnn/src/activation/mod.rs:85-90 | crates/cudnn/src/pooling/mod.rs:51-56 | crates/cudnn/src/softmax/mod.rs:56-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cudnn/src/activation/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21425f0ca79a5f370abd77aca35510b562a3c336c3815a69dcdf79b9ee12896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cust/src/memory/array.rs:757-762 | crates/cust/src/memory/array.rs:845-850 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/array.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"62608c7fbb8db2911f51844b056640e0b45096ce0fe36b37b468946a30f06a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rustc_codegen_nvvm/src/builder.rs:512-517 | crates/rustc_codegen_nvvm/src/builder.rs:525-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65af58baed70aebe31281706dfb8f74747ee4436481534b5a7171c9ffab988a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rustc_codegen_nvvm/src/allocator.rs:60-65 | crates/rustc_codegen_nvvm/src/allocator.rs:68-73 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/allocator.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ca937d87f92dbb715be16532b27d677bf8373619d0ee98e1c8b4a52eb83238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/nvvm/src/lib.rs:679-683 | crates/nvvm/src/lib.rs:765-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/nvvm/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc74d760404dd94450e2cfa9f2ec481255be5cefd480488db31fe64bb2461ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/cust/src/context/legacy.rs:296-304 | crates/cust/src/context/legacy.rs:428-436 | crates/cust/src/context/mod.rs:251-259 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5119403cced4819ca9c5d817cfc83c5fd60a39303a28136978967b5d17dd50bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/context/legacy.rs:534-543 | crates/cust/src/context/mod.rs:350-359 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff035b9e386e3def8e1c684a130b0ecbd38524e2cbaf0971b857b4121052c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cust/src/context/legacy.rs:562-569 | crates/cust/src/context/mod.rs:378-385 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72cd9265f88083211d0a068136a24a8b88328d3d89b09a0aa65cac4e52cf369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cust/src/context/legacy.rs:588-594 | crates/cust/src/context/mod.rs:404-410 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de888eb26fdb80affb8e579ac837d15eba0195166c2fb283cd2badb08431054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cust/src/context/legacy.rs:613-623 | crates/cust/src/context/mod.rs:429-439 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"257602af221f849105b541e03930fa781b7d8c47224e1e6e9a625a17ba0cf49a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/context/legacy.rs:642-651 | crates/cust/src/context/mod.rs:458-467 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a32c36869c96ab69a7c7c57141a9348c78c6de5513bf9fec56f16bd770302c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cust/src/context/legacy.rs:674-687 | crates/cust/src/context/mod.rs:490-503 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d79774c9406869072941ff7b0b7efd71def8d2f041505808b15bb2b733727df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/context/legacy.rs:765-774 | crates/cust/src/context/mod.rs:582-591 \u2014 before extracting anything, compare \u0060crates/cust/src/context/legacy.rs\u0060 and \u0060crates/cust/src/context/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0e79a64714ab9a208a6987a756c0b8664b3663620bf972459be32fd165690c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/memory/device/device_box.rs:433-442 | crates/cust/src/module.rs:497-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":"crates/cust/src/memory/device/device_box.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61e703dda575d7c1070cd868b1f93e73454ecc14ce74caa47f6f94c22c7a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/memory/device/device_box.rs:444-453 | crates/cust/src/module.rs:508-517 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/device/device_box.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8e8987a70f0ec021d560817417b5a1477aaab7fffd4dbee653ec69a23b30a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/blastoff/src/error.rs:26-32 | crates/cudnn/src/error.rs:106-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/blastoff/src/error.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"74001739156cf165693261e693563dd98298fdb8ee1ff9b23d0388b42a50919f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/context/legacy.rs:374-383 | crates/cust/src/stream.rs:341-351 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/context/legacy.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"db805c0391996237d78ba6e16c49933d4b42918fbd5d116f2791ef5826e88f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/cust/src/context/legacy.rs:462-468 | crates/cust/src/context/legacy.rs:823-829 | crates/cust/src/legacy.rs:453-459 | crates/cust/src/legacy.rs:790-796 \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":"crates/cust/src/context/legacy.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f72c00d9fe2a8a7992fb9e75da845f256ba0241c8d081e9eaf4204975e1fb00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/memory/device/device_box.rs:126-135 | crates/cust/src/memory/device/device_buffer.rs:118-127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/device/device_box.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bbbf1a78ea14e9864d25df8bfc5dd3689c01239d705aaa837805361e25ab53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cust/src/memory/device/device_box.rs:244-253 | crates/cust/src/memory/unified.rs:85-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/device/device_box.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"659121747f4d4b8f799437303a6963b065add345062ab0283a9764ef5d1b245f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cust/src/memory/device/device_box.rs:352-356 | crates/cust/src/memory/unified.rs:170-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":"crates/cust/src/memory/device/device_box.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe38614afa3c5f953cc20aef671f85eaea68f41b5910f3075b6ce285d7946a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cust/src/memory/locked/locked_buffer.rs:39-47 | crates/cust/src/memory/unified.rs:361-369 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/locked/locked_buffer.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73e208ad3856045c521b3fb6becaaad5c55f15fbe14d8da8970fdee335089a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cust/src/memory/locked/locked_buffer.rs:65-73 | crates/cust/src/memory/unified.rs:387-395 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/locked/locked_buffer.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f386a43e2c1c4676094945ddd2456121d18468a399c834d9cc7f47f730df489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cust/src/surface.rs:23-35 | crates/cust/src/texture.rs:408-420 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/surface.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb2264cde3879ce94a917e420c161ca8d57dc59724486f3b16fc2db2bb86724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cust/src/surface.rs:66-72 | crates/cust/src/texture.rs:474-480 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/surface.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4cf1e3a5d6970573dd8df64f26b8fe9859d529e33e520cd163b9b5685d9653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rustc_codegen_nvvm/src/const_ty.rs:103-112 | crates/rustc_codegen_nvvm/src/ty.rs:76-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/const_ty.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4733314cec5a45dae0a90faf43d105d0b00508191cfdca998228724ef7794cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cuda_std/src/warp.rs:167-179 | crates/cuda_std/src/warp.rs:202-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cuda_std/src/warp.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68723a95a7c88ae4461d56a5a1e89e8a189dc4bea5829c52b3f49d8ae60452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rustc_codegen_nvvm/src/nvvm.rs:283-290 | crates/rustc_codegen_nvvm/src/nvvm.rs:307-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/nvvm.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"128bdb437ab049eff59bee7977a077de591c9d4dd7fd980ad61cfeca838c4e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/cudnn/src/backend/conv_bwd_data.rs:57-63 | crates/cudnn/src/backend/conv_bwd_filter.rs:56-62 | crates/cudnn/src/backend/conv_fwd.rs:57-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cudnn/src/backend/conv_bwd_data.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b100dbd8ab4a1a8a362d2e5c34600c1fdfca4d5d62ff5a1c0cdf087e07ed96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ptx/src/lexer.rs:364-369 | crates/ptx/src/lexer.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":"crates/ptx/src/lexer.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeacda3aed3d7d6187734c6a1342444ff11f42c14d2ff9f1c5e9b06c52a7e80"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cust_raw: cust_raw: 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":"327735bf99180eb7e701ea735344dcf8bec7e47d9b830a09e76e5029ae302bb6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: blastoff: blastoff: abstractness 0.83, instability 1.00, distance 0.83 \u2014 zone of uselessness \u2014 abstract and unstable, so it\u0027s likely unused."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"85d0f0e89326f9528f887396853514f14c9f66ffad13804d97341c01750bfb5f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CudaBuilder (LCOM4 15): CudaBuilder\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cuda_builder/src/lib.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63657441f0dca4e4e0d8ca620af4b5fcc9afc3d2f2792fa58974e75e58d757f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CodegenCx (LCOM4 14): CodegenCx\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":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"000bfef4d91f822eb9bc60838083c6306a3c19d2da5216c831c451de4d5b1781"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CudnnContext (LCOM4 4): CudnnContext\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cudnn/src/context.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63e8c799b78e408e35bb27afdfbcd6c5fb4ffa103c1d0686f0d9fc1e0717a0b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Builder (LCOM4 4): Builder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dee44b90948e226954eacec616f930893d9f7a01a78af53c18f193913d1de3d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: crates/cudnn/src/error.rs, crates/cudnn/src/backend/graph.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"820ec1126808e113158882a36b6bcc2597ab129305e112ef59a56d3f9ad0e8b5"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (6 single-owned of 147 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 147 of the 234 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(fee1-dead): didn\u0027t seem like there was a better way to disable f16/f128s, the \u0060target_config\u0060\u0060 did not work for some reason. \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":"crates/cuda_builder/src/lib.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cda3edf475a8583d1e115eed445a579bf8e405e8d8adb0e67cbc6b11d7a53c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): Investigate subpar codegen for this function. It seems nvcc implements this not using \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cuda_std/src/ptr.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4f805950b362251c88e8adc8f5679addf930daa29efba559f5726147a8af4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(RDambrosio016): For some very odd reason, this function causes an InvalidAddress error when called, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cuda_std/src/lib.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d07f19ef51fa09f2fb97499727e7dad46e3136ed9272255d92355009c79b8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): We should probably create a common 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":"crates/cuda_std/src/rt/sys.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b492d33aa02cb90517aaba280f21a6baaba8a5f9f9ac4443fbbcd2dd90625b2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate the soundness of linear and pitch2, they require some pointer to memory, 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":"crates/cust/src/texture.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9005eec4d306376233446637e836f2d0cfb021d9315cdcc7005d3dcd0a8f0fb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: evaluate if its possible to cause UB by making a raw descriptor with an invalid array 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":"crates/cust/src/texture.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a43058be15797d9893515071662b841982b40759b80df9b31546aa60b7b372a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // used into_array. TODO: figure out a good way to deal with array ownership 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":"crates/cust/src/texture.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c20bd11f8662a5a2271a5dffc7059883d57fd6f0c72720a53814017bd550871"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): Support PTX compiler options and decide whether we should expose \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/link.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce2bfda64717a01ff6fa51d33c01daf52538d0c5fcf50aa55c11fb5e567913d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): Figure out a way to safely wrap a rust closure to pass it to cuda for blockSizeToDynamicSMemSize. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/function.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f16081fb56703e46a1460e7f7b74c5863308154f124352abe486c568abc4e75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I\u0027m not sure that these events are/can be safe by Rust\u0027s model of safety; they inherently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/event.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b4bdc226da8142b8f9c55ec3cd2fd7783eaa2c6536e076bcaf20df56615928"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (AL): do we even want 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":"crates/cust/src/memory/pointer.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3efd9cfea8a8923224802c142d095973638134dbd1f286e0a35c24e5a365e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (AL): Do we /really/ want to allow creating an invalid buffer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/device/device_buffer.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"66178431c00702c59d9c2787d6852f872a3a81596ebc8f9888a268c8872e94d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: ///  FIXME (AL): make this sound by storing module 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":"crates/optix/src/pipeline.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea64692e09f5fef71dc0d476e234716d64089d0c1f0a6a377c629ea1fbafcf8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): provide a way to do the denoising in-place (same input and output buffer). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/denoiser.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6e6d49a110ca4c4b7809d32516f52a2b4661419e084db4d7a0ef430da2c213"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): maybe change this to a boxed GpuBuffer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/denoiser.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc977917fc989b8cbfa493ef1586824519231c5913fb1e9d107a50260c81e80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): expose device context 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":"crates/optix/src/context.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cf0f3e975ae3df9233b0e96772cae0614972cf2666054f88fba56cea3a304d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (AL): Do some sanity checking on the values 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":"crates/optix/src/acceleration.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe99d6ce68d29f1dd686623a753a37328dcc81b155ef1cf462ce60f4e3c6f96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (AL): do some sanity checking on the slice lengths 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":"crates/optix/src/acceleration.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cdbdcf236f4823ba85732fa8e210a82683ed10c8457a9292e6649def453c19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): ask al what this is for :p \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/optix/src/acceleration.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"23587fd7239669b1d609181371c146106ae504ee0f8c9b777cc7ba46c8a43a1a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack used for dealing with .0 modifiers being either options 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":"crates/ptx/src/lexer.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd703e8ab8df8f5bc45bbbc5f4df82eceea065fa4c87b0a2068a408ec38f71f"}},{"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":"crates/rustc_codegen_nvvm/build.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ba5845837aed7b1052cc059e5b41515e8c63d8b22ccd5e799da35990434503"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) special-case fat pointers until LLVM removes \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":"crates/rustc_codegen_nvvm/src/ty.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"51980c6fca3d4193eceb06ce5fd34a90a676d3fca8a002f5bdcc04aa262c2f92"}},{"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":"crates/rustc_codegen_nvvm/src/ty.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cdcf1634a05ff0e962ba7f3fe7f861bece6499bfb611ac797caea04360a769"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): maybe include the nvvm log with this fatal 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":"crates/rustc_codegen_nvvm/src/link.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ea9dfee2627aa600ffc67216b6e5dae0d83b9d680d6527635f74641ddcb870"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME If we can use the default metadata loader in the LLVM backend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/lib.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ff8b642ca7d156000cd41796b2edc3a3648bb58d4c2a433a5b3c8788a5f767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): does shouldDiscardNames affect NVVM 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":"crates/rustc_codegen_nvvm/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefcfeda30f1d9555e7d136104897a2e3268144c6fddd0f2c3e7020549c05664"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@LegNeato): LLVM 7.1 doesn\u0027t have llvm.ctlz.i128/llvm.cttz.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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6aeba30342d4432393654df78e0a992af31cd2050ec5c038c67cf125b8e9da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@LegNeato): LLVM 7.1 doesn\u0027t have llvm.ctlz.i128/llvm.cttz.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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17dd913b1fc36dcc5ba83d6358197829bfbff1546db1b51a40e9b32575fce44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@LegNeato): LLVM 7.1 doesn\u0027t have llvm.ctpop.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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"719e7f6284a939e7554d3bbda5298b0bd55172d336b433fa7321642ba655680b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@LegNeato): LLVM 7.1 doesn\u0027t have llvm.bswap.i128 (added in LLVM 9.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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cc3b152daceaa72bc3278e65b6ac151e91029e0e4052abdd20547b40d81b5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@LegNeato): LLVM 7.1 doesn\u0027t have llvm.bitreverse.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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd9647ff15100df64134259e10f86716a8bed0370341b75edee2f7078cf5d1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@LegNeato): LLVM 7.1 doesn\u0027t have llvm.fshl.i128/llvm.fshr.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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a161512437732ea8126af3451e96db3e4285946b6758155634bba422f05e2c7"}},{"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":"crates/rustc_codegen_nvvm/src/intrinsic.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a07212987c024eb0adcfa2afc7c718125bd6ae3aec22a6d41133fa520d688"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): We override the meaning of llvm-args to pass our own nvvm 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":"crates/rustc_codegen_nvvm/src/init.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675cf8aac741404d42bfc74a547807fb2935969f20c0f0da2e7e205a3f4fd03"}},{"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":"crates/rustc_codegen_nvvm/src/init.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"854607b980b9b6c5bfc7733b1d970bfb0ffee241eb602fb260dcc69c4c424d35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@LegNeato) ideally we keep track of what we have put 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":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ca37b5e526be4df6c272b3b00906cb378863f1c6848baafc5c5995f41b2629"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): we should probably still generate accurate calling conv for 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":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"66be6fe9b9c58fbde1dc55b4ab52c610152aa39d4c451f9c4511e21a99660c5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this with a \u0022proper\u0022 arg 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":"crates/rustc_codegen_nvvm/src/context.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf123b8a50529562d12cbee790bac2c871ebf49357e27d90efc17f66936929d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): replace this with latest rustc\u0027s handling when we use 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":"crates/rustc_codegen_nvvm/src/consts.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"078855d49755f3efd4da8ecb046763caa619356172047904f77ff04545f637e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): is this the same as putting this 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":"crates/rustc_codegen_nvvm/src/consts.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"1171a69d7a63e6c8c28edbab3a70909f13c7094d6b5370dabde2330e73cedcef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use LLVMGetPoision 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":"crates/rustc_codegen_nvvm/src/const_ty.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a47b3877f63ee17c799833b298e15642d156a7afd63361841bf5c7c81b3b36a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: get rid of this nonsense once we are past LLVM 7 and don\u0027t 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":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37dbb39db4a5a950aac6485fb96578fe42818939c28bc4ffb7d5dad7bbde196"}},{"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":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90222d4491e22c0a63049d7a449816f37dae39c4d08293f5f2ccb3060cfaa8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FractalFir): Once again, a bunch of nosense to make the LLVM typed pointers 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":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a4c58dd7ff5403dec90c28aaa82e835d4ca26f9aa26252c36f9870422098b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: measure if this has a positive impact, or if we should just use more blocks, and conditional writes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efde2504fa8a517f0cc5534b609ba0b18e686967e19df52eacb17afe78b0805"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(FractalFir): this code assumess all pointers are generic. Adjust it once we support address spaces. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"10025c121de8d3da5e87d27bdfcd009020c1409acb52a779e757d4502ec74f35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // **ASSUMING** only the current thread can access thread-local memory. (FIXME: is this 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":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b1aeb3286c4c674cc24a47f06a1916ec521c9ca3ed6ddcd586212caa7666a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we print some kind of a message here? NVVM supports printf. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/builder.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b18192c287b423f13b1026aa4841f62e6416daa2e2f4b46ccbc6ed1847eff9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): maybe the same cost as the llvm codegen 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":"crates/rustc_codegen_nvvm/src/back.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a209785937d9f228a8c68ca3b984fe2c3952de590c7f05758d6e4590be330b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We use rustc\u0027s optimization approach from when it used llvm 7, because many things \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/back.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fd4df7ad4861a8324d8989920e2abc358ac480db711c5e6b381377cb197ac0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): Apply mutable noalias once we upgrade to 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":"crates/rustc_codegen_nvvm/src/abi.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9829f1b7cd466a9046d558a87c25a0819c03e2b492f6e4c5fa72e419146612ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): should this always/never be applied? unwinding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/abi.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9b4d656d84b4c5779ee26cc6a95c5e3664e553c1fe27e5c710f4d62f61428c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RDambrosio016): we should technically apply byval 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":"crates/rustc_codegen_nvvm/src/abi.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ef5c69082f241101c48520942472d367f6d1689ed5e7ead1ef6a811eec40c2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(RDambrosio016): We sometimes lie to rustc with return values and give it a bitcast \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":"crates/rustc_codegen_nvvm/src/abi.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f365a35aa909bb784911988930422fcabae6b8e9de9f8144a5cb5c963ef3e3"}},{"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":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"318642622243b0d51b32643a5e8aadc64983f338b496f8a342bef9991e137f1b"}},{"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":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"84706b7904fdac96e2e65ef9212fafd83bcbe8946af2fc5d29f8783b8c54c2c5"}},{"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":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a3ba13f1ed4e144c15ae1f9e9f1ee8f8fe2cb0996b6f7ed94073c70b914918"}},{"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":"crates/rustc_codegen_nvvm/src/debug_info/metadata.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd76f24aaa03ae7ab9f1ab3ac602d95635cbca5c6c87fe35f5b9c9410dfa299"}},{"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":"crates/rustc_codegen_nvvm/src/debug_info/create_scope_map.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"010752456ce2626b147a297329b29ff07eef6984bea4639b12e569a8858c4c6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) this would be \u0060self.monomorphize(\u0026callee)\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/debug_info/create_scope_map.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b491ac3433a516c52e9c62ac078064cbf7b0295f44872eef0042e9c343f593c8"}},{"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":"crates/rustc_codegen_nvvm/src/debug_info/metadata/enums.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7e3eccff608b107b1c5f62780e69d9867036c880c984eb6e5354862bc9fa8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pass all 128 bits with newer LLVM 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":"crates/rustc_codegen_nvvm/src/debug_info/metadata/enums.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfd0113d13b8d3bdcaa4fc2daf63e70faf5ebcf109cb2dab9043dfb6da7d2c8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) force \u0060compiletest\u0060 to pass \u0060ui/...\u0060 relative paths to \u0060rustc\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":"tests/compiletests/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e60b8aee91896482c59328d2b8ad92da0e3ae179b30ad8ff6ad0dd71e7c2d5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) in order to allow *some* tests to have separate output \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/compiletests/src/main.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b7743cffe1b48b220a94cf23f98b71d9cec035ac867f6432bab4cbca75d671"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) do we need this? shouldn\u0027t \u0060compiletest\u0060 be independent? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compiletests/src/main.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28cc42cb77d7139d2f90ffb8c74b7f384f606621c61776608caaeecf3cc0b58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) \u0060missing_count\u0060 should always be \u00600\u0060 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":"tests/compiletests/src/main.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d3301dc1d7633e0ef426e627339b575e843561c4b254c7cd37685f9ceff97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) use \u0060--message-format=json-render-diagnostics\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":"tests/compiletests/src/main.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"558a652711b865227f4a0b59c8ea52634d38b1b21838c83c0e58d47ef0ece9bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) expose most of these from \u0060cuda-builder\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compiletests/src/main.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfb7fbe0cfe10636d77f805ecbd3972a5bdeb84bf6bb6e9b237c4e310dd5be9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) this is the same configuration that we test with, 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":"tests/compiletests/src/main.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3b9c832472af3442c48895ffb61ebf03c618b47ed0e4020f75ead03243fcb4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) we need this for \u0060core::fmt::rt::Argument::new_*\u0060 calls \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/compiletests/src/main.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af4b878956ef50dc60e00457bb99dbc0e28ae08d5536552bd8d99b8cfdded43"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) avoid ever reusing instantiations from \u0060compiler_builtins\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":"tests/compiletests/src/main.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ae718bcd83934f4668d8ca6844ae41178ac0d91a07bd2aa177920d16f5b2d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This currently fails because NVVM doesn\u0027t support family suffixes like compute_101f \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compiletests/ui/dis/target_feature_family_cc.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d944b31af1828a6fd0a09979e1085bb96e76dedf700008044d5c2ae0a9577fe2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This currently fails because NVVM doesn\u0027t support architecture suffixes like compute_120a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compiletests/ui/dis/target_feature_arch_cc.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fce48ea007b998b9010ba2be038b23d2ba0a850c5e10b840df8e9103c8cd6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The default of \u0060-Cdebuginfo=2\u0060 causes a seg fault, for unclear 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/compiletests/ui/shared/shared_memory.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c49526f2424a593080af960d11f6883338b7a535ae252916262b6a2a09cbb59"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent resource management pattern: Some types use a static method \u0060drop(ctx: Self)\u0060 (Cublas, Cudnn, Context, Event, ArrayObject) while others rely on standard Rust \u0060Drop\u0060 trait or do not expose a manual drop method in the signature list. While \u0060drop\u0060 as a static method is a valid pattern for explicit resource release, the inconsistency lies in the fact that \u0060CudaBuilder\u0060 and \u0060GpuBuffer\u0060/\u0060GpuBox\u0060 do not show a \u0060drop\u0060 method, implying reliance on RAII, whereas the context/event types require explicit manual cleanup. This mixes RAII and manual memory management paradigms without a clear, consistent boundary.: Standardize on RAII (Drop trait) for all resources. If explicit cleanup is required for performance or determinism, provide a consistent \u0060close()\u0060 or \u0060release()\u0060 method on all types, rather than mixing \u0060drop\u0060 (static) with implicit drop. (signatures: CublasContext.drop(ctx: CublasContext): DropResult | CudnnContext.drop(ctx: CudnnContext): DropResult | Event.drop(event: Event): DropResult | ArrayObject.drop(array: ArrayObject): DropResult | Context.drop(ctx: Context): DropResult)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"af17e38678c08dc8e800afb32e1c9155755935b004fb229c3b563ee299e4a449"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent API for retrieving version information. \u0060CublasContext\u0060 and \u0060CudnnContext\u0060 return a tuple \u0060(u32, u32, u32)\u0060 directly. \u0060Context\u0060 and \u0060UnownedContext\u0060 return a \u0060CudaResult\u0060 wrapping an opaque or unspecified type (likely requiring further calls). \u0060CudaApiVersion\u0060 uses a builder-like or accessor pattern (\u0060get\u0060, \u0060major\u0060, \u0060minor\u0060). This forces users to handle versioning differently depending on which context or API they are querying.: Unify version retrieval. Either all contexts return a structured \u0060Version\u0060 type (e.g., \u0060struct Version { major: u32, minor: u32, patch: u32 }\u0060) or all return a \u0060CudaResult\u003CVersion\u003E\u0060. Avoid returning raw tuples in some places and opaque results in others. (signatures: CublasContext.version(): (u32, u32, u32) | CudnnContext.version(): (u32, u32, u32) | CudnnContext.cuda_version(): (u32, u32, u32) | Context.get_api_version(): CudaResult | UnownedContext.get_api_version(): CudaResult | CudaApiVersion.get(): CudaResult | CudaApiVersion.major(): i32 | CudaApiVersion.minor(): i32)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cc8fa6589618200695b6d7b69ecd2d0caa3981fce515b51b2b21fd767410c461"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent handling of stream context. \u0060CublasContext\u0060 has a \u0060with_stream\u0060 method that takes a closure, suggesting a scoped stream execution, but also has \u0060set_stream\u0060 (implied by Cudnn having it, though Cublas doesn\u0027t explicitly list \u0060set_stream\u0060 in the provided snippet, it has \u0060with_stream\u0060). More critically, \u0060CudnnContext\u0060 has \u0060set_stream\u0060 but no \u0060with_stream\u0060. This creates an inconsistency in how users manage stream scope: one library encourages scoped execution via closures, the other uses imperative state setting.: Provide consistent stream management APIs. If \u0060with_stream\u0060 is preferred for safety, add it to \u0060CudnnContext\u0060. If \u0060set_stream\u0060 is preferred for simplicity, remove \u0060with_stream\u0060 from \u0060CublasContext\u0060 or deprecate it. Alternatively, ensure both have both methods with consistent semantics. (signatures: CublasContext.set_atomics_mode(allowed: bool): Result | CublasContext.get_atomics_mode(): Result | CublasContext.set_math_mode(math_mode: MathMode): Result | CublasContext.get_math_mode(): Result | CudnnContext.set_stream(stream: Stream): Result | CublasContext.with_stream(stream: Stream, func: F): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"59dea9cb3efc8f0b06be7a844a4c67932e9ad7f4a0c1d14b2235f90b1f1af996"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant API surface due to \u0060_strided\u0060 suffix duplication. Every BLAS Level 1 operation has a non-strided version (assuming contiguous data) and a \u0060_strided\u0060 version. While this mirrors the underlying cuBLAS API, it creates a large, repetitive public surface. More importantly, the naming convention \u0060_strided\u0060 is specific to cuBLAS terminology. A more idiomatic Rust API might use a single method with an optional stride parameter or a separate \u0060Strided\u0060 trait/struct, rather than duplicating every single function name.: Consider unifying these into a single method signature with an optional stride parameter (e.g., \u0060amin(stream, x, stride: Option\u003Cusize\u003E)\u0060) or using a builder pattern for strides. If keeping the duplication, ensure the non-strided version is clearly documented as a convenience wrapper for stride=1. (signatures: CublasContext.amin_strided(...) | CublasContext.amin(...) | CublasContext.amax_strided(...) | CublasContext.amax(...) | CublasContext.axpy_strided(...) | CublasContext.axpy(...) | CublasContext.copy_strided(...) | CublasContext.copy(...) | CublasContext.dot_strided(...) | CublasContext.dot(...) | CublasContext.dotu_strided(...) | CublasContext.dotu(...) | CublasContext.dotc_strided(...) | CublasContext.dotc(...) | CublasContext.nrm2_strided(...) | CublasContext.nrm2(...) | CublasContext.rot_strided(...) | CublasContext.rot(...) | CublasContext.rotm_strided(...) | CublasContext.rotm(...) | CublasContext.rotmg_strided(...) | CublasContext.rotmg(...) | CublasContext.scal_strided(...) | CublasContext.scal(...) | CublasContext.swap_strided(...) | CublasContext.swap(...))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1f3e3b463a511d5cff69e8326f8c69c9c9292a46be7abe91f450c01f73c028bd"}},{"ruleId":"D26","level":"note","message":{"text":"Split crates/cudnn: A huge CUDNN library whose namespaces are all sub-operations of a single tensor/convolution stack and whose namespaces are named only parts of the algorithm (rnn, attention, softmax) \u2014 it is large and sprawls across many unrelated namespaces. Suggested: "},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"83133338f54bfa1db49c9a42b80596ecc37c77286c179133978140538396a07e"}},{"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":"69c0dd5a391a32bff3a95418f288c2720fdaf0135e9b11b57f3a374fbdd39849"},"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"}}]},{"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":"93a346059ac1528930dc773d16adb29b451da099af455eff461704d19e7823b4"},"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"}}]},{"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":"c14970b989dfb50deb21fe343c2821f920388de417a21837312a1b45a6cbd90d"},"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"}}]},{"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":"6b6fa3918597e94ca5735dfa54041ba6e3b18adfa4e4ace23aacdb7f911686e5"},"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"}}]},{"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":"9bbe444ed8920e271c547771e42307603bcd53913f1005028a7081337a2698e7"},"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"}}]},{"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":"da26246e17dc1a1d33ff47d3cb248bf87714622e70d3d50cba47ce6216026a79"},"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"}}]},{"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":"502232d41f9b2fd935dc9c4ea866538bc6997149b1d232cdd6619804bb2f5cbc"},"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"}}]},{"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":"570f7687ffad43dcaefaef943a2fa196f5a291954b5e9db5d61134d7a9312e0f"},"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"}}]},{"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":"8d41329e74d06666f243244385f3beb0114995e4c6b7d9d39272d28caabc6827"},"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"}}]},{"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":"7ff91bec82da22f6d807922c176fe9342c21a8c929b64d6a6bbc85a231bd51bd"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c867d4587bae255742ec144286118e066b18ec4da1e98182a8b420572413dbcf"},"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"}}]},{"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":"02f8142b24f25effff71cf9b2b02133db33e9e833da808411e39333e70b659ed"},"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"}}]},{"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":"afc278079dd05ccb2b697d3ba023169581a3ecc3e43e96fea28a2e5329c7fe6b"},"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"}}]},{"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":"6a4f896e746b7f485eb6f73e30551a528f7cbc199922a512893e5a8aa238eee7"},"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"}}]},{"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":"7cbe8dff5c9d9b567d92550ca61505d6757793838a13acc813eedd33d1949241"},"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"}}]},{"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":"3712bdb9793ae137ba5e437f78332410a08bf2b108e8e8900780b97c893ffa51"},"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"}}]},{"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":"ed68cf6dda9e88b47be1e2b057b8e0fbbd030de03160a7a16c657216e093df7c"},"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"}}]},{"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":"e695d926cb4ffa38b11c6eee97ddce87a8f371a6af0af2bddd06a775927989d0"},"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"}}]},{"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":"ddebdc9a884896a5909319cc0c7751cda47e8080e86adbb23e36fb64a0d7ada2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"32250c2e21f9ee63f02e2768fa2172b98b64296c2d9a55c462f8c9a7fee77eb8"},"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"}}]},{"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":"ac56b9aaee7a924585e7620f3e64e68b21066f827e7c3742a82bce444c0b2bc2"},"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"}}]},{"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":"dab1b9d0431b89bbab474d8bd03c06082f9bb425f1fe056838283f4462f8dd73"},"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"}}]},{"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":"16db0fc765d4fd5cbed4af97404a88de044ca1ee20f9c4f1d58f4d8b99c3d5a3"},"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"}}]},{"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":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"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":"179bda9409a4f3dda855a5cb24a1586bd5c32f97fc894926e8a89ba5fe9febe6"},"properties":{"dependency":{"package":"servo-fontconfig","version":"0.5.1","advisory":"RUSTSEC-2025-0059","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":"aaa86fae8d91e7111ff2baad1a374ae0d14fc8de7d623061f570a68e9ca56760"},"properties":{"dependency":{"package":"core2","version":"0.4.0","advisory":"RUSTSEC-2026-0105","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":"730ad4edee8638a9bbe4460231379a8b1a9a5bf86bfc2ded077cbfe9b2e711d4"},"properties":{"dependency":{"package":"rand","version":"0.8.5","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":"9040b7ad52b862da8ec54c50aafe5b7aad49e0d3c7df8ecb342f09947efda51b"},"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":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.3.1","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":"4391e76d9ad37f3d34489e360242c917effcd31bd66458158a9781f57b45dbd1"},"properties":{"dependency":{"package":"memmap2","version":"0.5.10","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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.100","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":"0b4d0bd0ea0d3a81846d91c999f1c98d63806893d9b8b2fd8c703eaa81f667a7"},"properties":{"dependency":{"package":"tar","version":"0.4.44","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0067","RUSTSEC-2026-0068"],"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":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bfdeef5e0f490b08f4edee7cec344aa0fd415925bcbc905e2c2f7cda373bb7c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c95496e8a2270cb8be41ae19ab128e6dce3c7ea45a42e4723dc018066aafdfa0"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ae6831f8f7926fd11d7824e7f2b229da9b24453d40e86f5433d44bd336b3760c"}},{"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":"65c5bdf24a095924707dca4d9b80de607e9c6709ce04ab420cc2749cd24c2391"}},{"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":"29cae23a47d07dfd0ba5cbfcc172e8526a709455e287d2885e6e498151c843ba"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9724a404398f8a0f8224ae3a1ac5c58ba9170bd5bded70060a961898b53456a3"}},{"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":"a20237c8b8ae4660295ed362a66de28ad7650f6d34b737507a3c09fe50eebc38"}},{"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":"2fdb8433ca1827f260a7974411e523bdf8a694aae8e4f08ef6b38e009839f87c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e19b140b8c0fb0d7dbdc1ac44fc12ba3138f1b237a01a3408ea1d74a929e6ee5"}},{"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":"0eee8a4af104b43aa7af9a1617dde871afb0a6fee9104a6aa839718accff5b01"}},{"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":"dd523c236a1a90b52b1b73c6b5c38f887f883d9c68b5d95bcd971bc9912db40d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5dd96192f50af00181492cbafde0ae1fad5a1355fc01c521d66e569502c87eaa"}},{"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":"d2f44a9e3610cc52de366945de6f20437785053b125661eb8140462b718c13cd"}},{"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":"26bdd3f53a2c66f35c961aee6f8dc8fdb066087d72e0d405de889d9b1fd3f9e0"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"8f6ccc893fe9480d5ce27f5ce8e7d1b5dde1dfd2c877f6d1356d58ed68468168"},"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"}}]},{"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":"50fca895ed29c934ef3bcff4e6f27c5ad73292143985def52d49db15f10dd9f0"}},{"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":"135682060885b7d0ee2f56fdbaa8cadaf169c9658f88cff2abaa273b23ee4d75"},"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"}}]},{"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":"be7541b31942f1953245c0d4b64b77691af828a64bd6004717c867ce8cdd7351"},"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"}}]},{"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":"4e22f8c8d12c6c12703ad333a73c6dcff033488e6081cdfaf6d3ae48b83a6f0c"}},{"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":"6cc60053f7d1aa751d425c97e2ac364c217a9a967d4e03fc980385f09ff236c3"},"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"}}]},{"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":"07893895ab4ede53efe0364a25f6415c5411f265e3169a1797550772f7f3c1e6"},"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"}}]},{"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":"c10433ea360e2fd4089b88c0416d97f900cf29435a85f62f643f246aad499205"}},{"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":"f947b08c1567cd974443d85b8f6efa0085839cd9a44bf3ce6003bf6ea64e3f29"},"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"}}]},{"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":"1e8127fd6cfda9695c3e63aa8dbccb2a04d819fdbac6cdd54aa271645f9d8b68"},"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"}}]},{"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":"ce5eec552af3a6a3a357797984605ee04c2a3083f80eeb74405b9c9b76519e34"}},{"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":"350443b9b1e5e377fc0e75e51e82484f12074d72c74d4ce7e07417eead3fce3e"},"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"}}]},{"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":"9e6442945d3ec9a9e44ac4e750958acdae78b5f717ba776f610255e83e94928c"},"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"}}]},{"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":"11e9777333f496069b0258b174941347b8c2473e7c5d9ee90d6cfcc6c82b5ef2"}},{"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":"be0da531290b8e377d199d1c6bf62eff790653bc728ad1d7b32725ca81f6c253"},"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"}}]},{"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":"d92b0dd8fbeb83876db873e4f454b9136d96383897459df62b40f9a038722261"},"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"}}]},{"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":"58651bdaf5a94c2175e76c919a036181db818d29bde67011d43e490f373baa62"}},{"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":"4c7676e64dbbd68c90db1a086e90bb70fad4626565c750aa334396d91b7a7a5d"},"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"}}]},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 102 of 149 significant files have no living knowledge, while the repository is still being changed at a low rate (15 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 102 separate risks. Counted over 149 of the 234 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cudnn/src/convolution/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1405a515a83d4ccd8d54b9f305d9581f852fa8e9c949fcb7f68e2f0a07e994aa"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cust/src/memory/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b9e7e9cdf62c9a7bd9ebf39a9d84289464e5ef779612f0c81fdeb764ffc231"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/debug_info/metadata/enums.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70ccd2b829220f679b13c77f8c28ee45094dd2c29c632b2881771232e1c7225"}},{"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"}},{"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"}},{"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"}},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"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":"5e7a3c6c1eb45c71321131c5ec4bfec81f75f0dd398dfe046633608537074b7e"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"M1","level":"warning","message":{"text":"README may be stale: 33 code files changed in the last 6 months but the README was not touched \u2014 it may no longer reflect the system."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e973e7a8d5d866995cbf78b120250fe7f132bf928812d48ca62e69aba11b9910"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/cudnn-sys\u0060, \u0060crates/cust_raw\u0060, \u0060crates/optix-sys\u0060, \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060subdirs\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":"crates/cust_raw/build/cuda_sdk.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e0a7453db6b78c3d7f45e1b314261549ea86584b364feb48544a7595d3c06e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060demangle_callback\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustc_codegen_nvvm/src/back.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f1cec5607b0d9b9ebfea8a122356a3da83c4565296380fa813ccf45a465f35"}}],"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-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":73,"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."]}]}