{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"sccache::compiler::gcc::parse_arguments (cyclomatic 106): sccache::compiler::gcc::parse_arguments has cyclomatic complexity 106 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bf476a2ba089c5d33b082688670054d67916b7dc8ee5b663ca2cb4d1eb8842"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::rust::parse_arguments (cyclomatic 56): sccache::compiler::rust::parse_arguments has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d7365d825e8d23477f7501580fd910ce09f704282d83b3367c5e852231f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::msvc::parse_arguments (cyclomatic 53): sccache::compiler::msvc::parse_arguments has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eb6bb9b19e55a452678ffd041daa961e97572f455b19a39c11ed93fa322cfa"}},{"ruleId":"D1","level":"warning","message":{"text":"RustInputsPackager::write_inputs (cyclomatic 35): RustInputsPackager::write_inputs has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec3cd5a7475fd5c0741a53717d730e676c550be71b2eb9206726e9c24d999af"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::config::config_from_env (cyclomatic 34): sccache::config::config_from_env has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01af7119cfdcf0dee0502dc0e13eb5d7afc3cb21e5e2b4ad8e6b937690186e3"}},{"ruleId":"D1","level":"warning","message":{"text":"CCompilerHasher::generate_hash_key (cyclomatic 28): CCompilerHasher::generate_hash_key has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b41e74d2fc4146294bd10feafb73f75b29fc8579747f4b21edd7b5efda355"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::cmdline::try_parse (cyclomatic 27): sccache::cmdline::try_parse has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmdline.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"da642605d84dcd0213290d32777a5c7ffbc61095f53ed883317d6a17f733868e"}},{"ruleId":"D1","level":"warning","message":{"text":"RustHasher::generate_hash_key (cyclomatic 25): RustHasher::generate_hash_key has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e9bba6bbd96498b489d602f0da19edc628b609165b93d208d32ffc25696f22"}},{"ruleId":"D1","level":"warning","message":{"text":"SccacheService::start_compile_task (cyclomatic 25): SccacheService::start_compile_task has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f0192b585713727a5f4025929a86c6363a8505614527025e4d5b12066b0115"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiLevelStorage::from_config (cyclomatic 24): MultiLevelStorage::from_config has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/multilevel.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c045efac74dfe5cdf310a745334b46dcb10fa9b9b9a448a145af29cac298da0d"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::diab::parse_arguments (cyclomatic 24): sccache::compiler::diab::parse_arguments has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e30909994b8b6b2914969cb93c402018fafe22b1416c97b906e80b4cb3d28a"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::commands::run_command (cyclomatic 24): sccache::commands::run_command has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d32cca2a39a0e5b1b033bf6004b25780a387332bbd34c5bf86d2ef182d04ce"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::tasking_vx::parse_arguments (cyclomatic 24): sccache::compiler::tasking_vx::parse_arguments has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/tasking_vx.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"132ae0b1222ffeca1d9c98a4a5e7fd6573693b4b5a53a2fb841979f00fc35fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"PreprocessorCacheEntry::result_matches (cyclomatic 23): PreprocessorCacheEntry::result_matches has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/preprocessor_cache.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"394681d16abac79433969a716fe269bc4dde067267b2c413675112d990744d81"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::c::process_preprocessor_line (cyclomatic 23): sccache::compiler::c::process_preprocessor_line has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"f620e41827daf4d4d1e989cc581ced12193d53a9f2cda1aa95d423266d3b0fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerStats::print (cyclomatic 22): ServerStats::print has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7c167fec1a0d44f8d90bff1f5c18162eae1536d41f82e570175feb5e9cd2f4"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerHasher::get_cached_or_compile (cyclomatic 21): CompilerHasher::get_cached_or_compile has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Language::to_compiler_arg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc682058248a6cf0dc9892f90f213ae0f0158c9d11a2c87b92935c10e9d34949"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::c::remember_include_file (cyclomatic 21): sccache::compiler::c::remember_include_file has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"560cc7ea8fd5206009d45ba6616453a8cd3cffa351ba027815c6aef33bfac6e8"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::nvcc::group_nvcc_subcommands_by_compilation_stage (cyclomatic 21): sccache::compiler::nvcc::group_nvcc_subcommands_by_compilation_stage has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"968c1779550be9ef9a6878b6ed86e329b3813e861a4ce6a3677ccba87a0f2891"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::nvcc::generate_compile_commands (cyclomatic 20): sccache::compiler::nvcc::generate_compile_commands has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"126f7501a0b300bac2213a61fca7d7ec5945012289d4f86b85fd4ab29f5b2387"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::cicc::parse_arguments (cyclomatic 18): sccache::compiler::cicc::parse_arguments has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb55408e3b45dcd8687182fdc0282af8318ab9797ba8f7f923d1de39ae665ec"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::compiler::dist_or_local_compile (cyclomatic 18): sccache::compiler::compiler::dist_or_local_compile has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Language::to_compiler_arg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"27992fdea44afd6b63bd6770e8af07e70c4003fa81c2d5602a99b1d6c45f10c3"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::c::process_preprocessed_file (cyclomatic 18): sccache::compiler::c::process_preprocessed_file has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebde650effc798cbdb71704d13d7f90dcb240524881deaf4885083996b13222"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::handle_heartbeat_server (cyclomatic 17): Scheduler::handle_heartbeat_server has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e5b83bd601a1e7af66cc48c5d58142572045907b5aa5e2d7c0c08b9e5834a"}},{"ruleId":"D1","level":"warning","message":{"text":"RustCompilation::generate_compile_commands (cyclomatic 17): RustCompilation::generate_compile_commands has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"593027e75981d528c915005f4d0f5aba87950827e0722f3af2316e5d18f0ddd3"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::compiler::detect_c_compiler (cyclomatic 17): sccache::compiler::compiler::detect_c_compiler has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Language::to_compiler_arg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9021da7d03259f0046feaed5c64cdb42dd74b5957b07a54bdfc1743e09ed593"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::bin::sccache-dist::main::run (cyclomatic 16): sccache::bin::sccache-dist::main::run has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9771c958351a0f76d0659e73728fb67d100c3931b85f6188ce0dd9fb99fd5c"}},{"ruleId":"D1","level":"warning","message":{"text":"sccache::compiler::gcc::generate_compile_commands (cyclomatic 16): sccache::compiler::gcc::generate_compile_commands has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd92d6235da205b67366f059704c654fb26f7678674d8b2cd0e1fcfc8e06c5"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::gcc::parse_arguments (cognitive 92): sccache::compiler::gcc::parse_arguments has cognitive complexity 92 (threshold 15). Drivers by points: if/else 23 (43 pts), match/switch 20 (42 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"76632284796bc6dbdeaa1dd8829432f0dc96a62291ffaf708daab98b0c8946ab"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::rust::parse_arguments (cognitive 75): sccache::compiler::rust::parse_arguments has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (47 pts), match/switch 7 (19 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e83edb1f25568ebaeacea39be97d271ae59e8b926aab98d03de34af1ad59701"}},{"ruleId":"D2","level":"warning","message":{"text":"CCompilerHasher::generate_hash_key (cognitive 62): CCompilerHasher::generate_hash_key has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (47 pts), match/switch 3 (9 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"550b66026cb91932318ff1e2d8c05aacc862e6fbfd06fb8758fa40860b749c60"}},{"ruleId":"D2","level":"warning","message":{"text":"PreprocessorCacheEntry::result_matches (cognitive 62): PreprocessorCacheEntry::result_matches has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (38 pts), match/switch 7 (21 pts), boolean chains 2, loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/preprocessor_cache.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8db2c771f0ef65c92610c4a761b95a03f1994ef2f9986145ee36a474ff3d65"}},{"ruleId":"D2","level":"warning","message":{"text":"RustInputsPackager::write_inputs (cognitive 62): RustInputsPackager::write_inputs has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 4 (11 pts), boolean chains 9, loops 5 (8 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"26160d10967e634f6b7cab70b666cb2052710da760833395683df87bf3fd50b9"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::msvc::parse_arguments (cognitive 59): sccache::compiler::msvc::parse_arguments has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 11 (26 pts), if/else 13 (24 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb178edc661071ae7670a3a859b145497755863d85aac182a5e77d8fd3bd7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::cmdline::try_parse (cognitive 53): sccache::cmdline::try_parse has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (35 pts), match/switch 6 (17 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmdline.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"229d276e0b27b4de1b8b7878784418aa39f380f0bbc46c527ed9c1539892526c"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::nvcc::group_nvcc_subcommands_by_compilation_stage (cognitive 47): sccache::compiler::nvcc::group_nvcc_subcommands_by_compilation_stage has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (37 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc50c765e454654383af45454ba9345e8af2fe004c75ce4ddc64999d918eac8"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::config::config_from_env (cognitive 46): sccache::config::config_from_env has cognitive complexity 46 (threshold 15). Drivers by points: if/else 30 (32 pts), boolean chains 12, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"4501cdf41fe1760002c52e57e688ad0eabd33097bce5a71b962cbe84b28984a2"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::nvcc::generate_compile_commands (cognitive 39): sccache::compiler::nvcc::generate_compile_commands has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 4, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aea96fc6138e8dc841de6faa0ea559b11e962cd3865aa1928d25ae5aa7f38b"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiLevelStorage::put_raw (cognitive 38): MultiLevelStorage::put_raw has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/multilevel.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bedaffa62d5581fe5fc507add16fa030c19bbfef4e67b8511b38ef3cfde1374"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::handle_heartbeat_server (cognitive 36): Scheduler::handle_heartbeat_server has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"129376ab98e04e3c92269c667ca84e81c1734e1958d5e5ad7adc61a274a4a650"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerStats::print (cognitive 35): ServerStats::print has cognitive complexity 35 (threshold 15). Drivers by points: loops 12 (21 pts), if/else 13, 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":"src/server.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6ff91afb6af79109376929bd36e84f6e0c870af57ddad0cbbdd5b541e5851b"}},{"ruleId":"D2","level":"warning","message":{"text":"SccacheService::start_compile_task (cognitive 34): SccacheService::start_compile_task has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 8 (9 pts), loops 1 (4 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a718083120ae1852c733340f456f9783725dfe4c6b1b1545ac8b6b9f2b61e89a"}},{"ruleId":"D2","level":"warning","message":{"text":"RustHasher::generate_hash_key (cognitive 33): RustHasher::generate_hash_key has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, loops 5 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa7f1d8707c64cd13ad3b930ba1df3d4ecf83f734000e622e0efc465412f701"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::handle_alloc_job (cognitive 32): Scheduler::handle_alloc_job has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e711822b5d7aab5494c6ad88259600b251b5fc68241d16c520285e3f9b2d3fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::c::process_preprocessor_line (cognitive 32): sccache::compiler::c::process_preprocessor_line has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 4 (6 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c1154ae144330464005ffeaf58b64b367cf370241fb836a05d6be37475c2cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiLevelStorage::get (cognitive 31): MultiLevelStorage::get has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 4 (15 pts), loops 4 (10 pts), if/else 3 (6 pts) (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/multilevel.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9e9bfa32a85fd05081a365d1e6cc82e0afdae6be4b67aa4d38b4347e4acd63"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::c::process_preprocessed_file (cognitive 31): sccache::compiler::c::process_preprocessed_file has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 8, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a206dfe750abf431ad538ebaf0272a2c898419572e854f28251976ce448762"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerHasher::get_cached_or_compile (cognitive 29): CompilerHasher::get_cached_or_compile has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 7 (10 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a637b88959408205ad105bf90c285f7d19e376ee19051b9b88a4bd200cfad1e"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::gcc::split_gnu_response_file_args (cognitive 28): sccache::compiler::gcc::split_gnu_response_file_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd1612b3c962ef6674c0f4c4f5c978852e1fa099291260759e3662707109a04"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::bin::sccache-dist::cmdline::parse::try_parse_from (cognitive 27): sccache::bin::sccache-dist::cmdline::parse::try_parse_from has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (8 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/cmdline/parse.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18601afecf7ab9956c56ca35cdeae56df473f69ead5106777cc2e656f998b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::diab::parse_arguments (cognitive 26): sccache::compiler::diab::parse_arguments has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 4 (9 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"da414778900143980724fc849922391f645386516fb56b589447f483de25c8aa"}},{"ruleId":"D2","level":"warning","message":{"text":"RustCompilation::generate_compile_commands (cognitive 25): RustCompilation::generate_compile_commands has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17661fc1e8b71753d4d9c6d1465eabf641229e3516e329791b55cda52621147"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::cicc::parse_arguments (cognitive 25): sccache::compiler::cicc::parse_arguments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (10 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b806adff57e722990153a070d34ea3c3328bfbbccd6458be33e09a7ff53ae82"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::compiler::dist_or_local_compile (cognitive 23): sccache::compiler::compiler::dist_or_local_compile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 7 (8 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f7e2d078307cb76b39843999f45018eaa2f598c56fabe7f8b4e073e0ffd043"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::msvc::preprocess (cognitive 23): sccache::compiler::msvc::preprocess has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"becd07d2388a866e98449bf122ff72e0766a0066a77ef0c48a9daf73a4be01cd"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::c::remember_include_file (cognitive 23): sccache::compiler::c::remember_include_file has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, match/switch 4 (6 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac676b2397a1138ceb2a8e8895e55f4da36f3a9e64394c9c95e0e607b2fc1a07"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::tasking_vx::parse_arguments (cognitive 23): sccache::compiler::tasking_vx::parse_arguments has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 5 (8 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/tasking_vx.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"670d7a33f11f13bd3c0ef4a8af1a293cf8f41b1cecfada77c33f137419b163e0"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::commands::run_command (cognitive 21): sccache::commands::run_command has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 4 (8 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"be289e73573b1c88c07353841480e9a8af62e5c5bcbaef626c612613e93e09e6"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::gcc::generate_compile_commands (cognitive 21): sccache::compiler::gcc::generate_compile_commands has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd004c434aeda692da1502fa8762bafc700a8b64be2382549adb781e3e16f53"}},{"ruleId":"D2","level":"warning","message":{"text":"SccacheService::compiler_info (cognitive 20): SccacheService::compiler_info has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d39c4efc6c625d81903e51b1401d258f8cc77fbc630c4161e38b02f158c73b"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheRead::extract_objects (cognitive 18): CacheRead::extract_objects has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache_io.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a5aa9c49fc858d8826b910b18f7efa92b24177389167e85b23216daf30a09d"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::nvcc::fold_env_vars_or_split_into_exe_and_args (cognitive 18): sccache::compiler::nvcc::fold_env_vars_or_split_into_exe_and_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57a74a0ba3eed3c2433477f8300a44f879561d6b0e8882a14ea2981550d1df0"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::util::strip_basedirs (cognitive 18): sccache::util::strip_basedirs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceff5ab809ae45f85bf47ddf069fd09eee1bbfd11857626bf53b499c986f2a5b"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::util::strip_basedirs_from_arg (cognitive 18): sccache::util::strip_basedirs_from_arg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f45d6a0d8c60e279cfb720034ee41661033e855744cf4cc59a4258e0fdb743"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgsIter::next (cognitive 17): ArgsIter::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/args.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9836bb5456feab760660d637f3ac9662911bf2d1b7b5642ec828d7bce557df8"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientToolchains::new (cognitive 17): ClientToolchains::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dist/cache.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"784e765c7969fdb4579997ef08f76d25689f17145dc09472f0367e9017806172"}},{"ruleId":"D2","level":"warning","message":{"text":"sccache::compiler::nvcc::select_nvcc_subcommands (cognitive 17): sccache::compiler::nvcc::select_nvcc_subcommands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 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":"src/compiler/nvcc.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"9086972168d924caa3d47a34e4c6fc1d18c609377e63f5a7202ef6a3574bab32"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::handle_update_job_state (cognitive 16): Scheduler::handle_update_job_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17c5789e84ff85b945173ca6b0acd61f9a8a3c3f462a7437369c190b5835aba"}},{"ruleId":"D2","level":"warning","message":{"text":"RustupProxy::find_proxy_executable (cognitive 16): RustupProxy::find_proxy_executable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (7 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9c6f5b62b59b25861f25609ca40295bc9ca700c12acad2170d8b0dc95bc8d7"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeMacroFinder::find_time_macros (cognitive 16): TimeMacroFinder::find_time_macros has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff2421c652b0d8f7d8250181b9d16f499e148c138539a2e6029621e1b2416b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::gcc::parse_arguments: FunctionTooLong \u2014 sccache::compiler::gcc::parse_arguments runs 373 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 273 over it, 3.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a714f66a64248205de8ef32ee1866d69450385bcf10f8bca384c89031ded18f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/rust.rs: FileTooLong \u2014 1672 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1172 over it, 3.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d584bdb9d600e87714e41b0b7dd38e86e8d80c73ad2597ff8ec96ff20128d70e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 1572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1072 over it, 3.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df7482129bcc1db218b82aa25eaf59d2e4e0767ffb138002ff767e5d4c1ba6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/compiler.rs: FileTooLong \u2014 1415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 915 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7a6433c6173e69d5d272988e0d24a4e22645cf00d5233f3a33f2d48ae8c554"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::config::config_from_env: FunctionTooLong \u2014 sccache::config::config_from_env runs 265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 165 over it, 2.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b7c6f07ac3bc75397b70052051cc25d12a1dfedcb3212120383dac985094a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::msvc::parse_arguments: FunctionTooLong \u2014 sccache::compiler::msvc::parse_arguments runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a86b8febb885f3faca76d707437495dc9b489d42d43feb44252b06a35e843c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RustHasher.generate_hash_key: MethodTooLong \u2014 generate_hash_key runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"31de987b471098ed1775de7a05961e8dc97b32b23296b90ae18876982623dc78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 1110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 610 over it, 2.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4945c3bcfb06e8e0bf42248c5194e236ebe17412d594290e36ced9b966a475"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompilerHasher.get_cached_or_compile: MethodTooLong \u2014 get_cached_or_compile runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a27e90e802b4d155901928f514c365824f9a62fe89c589d04a15b223aaccc77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/c.rs: FileTooLong \u2014 1007 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 507 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"368a403c2a194752051a3ad44672c27d5f5c9dc7b74e723aef6a084568cdbfa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/msvc.rs: FileTooLong \u2014 986 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 486 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c420807ae03bcb17f242be23cd335d3dbdbc63f9a9c79d5c6f7a71edb53613e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/nvcc.rs: FileTooLong \u2014 977 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 477 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5232194f765f1cf36cca6063bf3df5c8f6020acfc0501b36f034dbbe82e26d93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::compiler::detect_c_compiler: FunctionTooLong \u2014 sccache::compiler::compiler::detect_c_compiler runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae7f7c3da9f2710125447d4aea21836c34481dd43973dca8bf7b60416d907c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dist/http.rs: FileTooLong \u2014 936 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 436 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dist/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"318110835da44a11f0dcdc41ba0ebedcddb373cde877b1c01ca511aa965b16ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::commands::run_command: FunctionTooLong \u2014 sccache::commands::run_command runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3b5fe4f33b77b30f87e7584290e4a71552acdfd13cc855529c2d6d891a8936"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/gcc.rs: FileTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 400 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1243b722161d5737f751d523007f3708d64682d21102bb1463c16f748e719d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::cache::cache::build_single_cache: FunctionTooLong \u2014 sccache::cache::cache::build_single_cache runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"192244fa5ddba4a242c544b21a23895068d1a64ea5f02c2f4d00a25e7f541cf1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SccacheService.start_compile_task: MethodTooLong \u2014 start_compile_task runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc272585620cf47419613c03ba329136f477cc6a705ae61f4d6bfddb9c1897c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::compiler::dist_or_local_compile: FunctionTooLong \u2014 sccache::compiler::compiler::dist_or_local_compile runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acb7b89e6153976922c60b9f508cca8c5f914ddcea37bf44f718eb8bd34b674"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/util.rs: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 316 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae831d5c1a3d22caee6579d201231d3b385c42cca36e19f47ee9fc243da657da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::nvcc::group_nvcc_subcommands_by_compilation_stage: FunctionTooLong \u2014 sccache::compiler::nvcc::group_nvcc_subcommands_by_compilation_stage runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cab075c3cebcadd966dbfe4445088f0b121cda06a4455632d792e35bcc6afcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::rust::parse_arguments: FunctionTooLong \u2014 sccache::compiler::rust::parse_arguments runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"869240df265cadb5e43c843bbd2d3200a2c3963139659e3a3324d2b988ca8c37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caed55e32d9b8e42a86c528785e345a7ae867519337aa56a51d40290f8a9fb14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiLevelStorage.from_config: MethodTooLong \u2014 from_config runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/multilevel.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cd6dae7e321bdbbd8e8d46ee64c8b143b1733eb2a6c00295fa495369cc11f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::bin::sccache-dist::main::run: FunctionTooLong \u2014 sccache::bin::sccache-dist::main::run runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a26a7963aaa6bbdd67091de7836d79726053814b9124faadaf1032a49cc9347"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scheduler.start: MethodTooLong \u2014 start runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dist/http.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6f75fd8006e310c982b5691763fba3cfc650686abe86b0004562fbf2c2abdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/multilevel.rs: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: MultiLevelStorage (3 blocks, 345-1005). The bar is 500 significant lines; this is 116 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/multilevel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f796ae47be4700a08dfb7199f643d254a0216750b9f456dc76634b4ca727ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RustInputsPackager.write_inputs: MethodTooLong \u2014 write_inputs runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"31385db7ca421cc05b04b200713b1cf1173b3110e2b1d47b9e529cc872631c86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerStats.print: MethodTooLong \u2014 print runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5747ba6e5fb37e2e3e5705c8e7a840f634de6325affdb55f105ce288eb66360"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sccache-dist/main.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"732e5adda7c2ee7c6a594fba7ed3c9821d77ebd7bc7f85c6fd6dc77ca2bf237d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SccacheService: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 2 blocks, lines 785-1671. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf3c339b62187b9d4754deb8b92f0360ffedfaab36a0bf798113b0f9c0aec35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::nvcc::generate_compile_commands: FunctionTooLong \u2014 sccache::compiler::nvcc::generate_compile_commands runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54882733238b84d033f35a949ce7b913d2b718bdca536981b5b86d896784682"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::compiler::cicc::parse_arguments: FunctionTooLong \u2014 sccache::compiler::cicc::parse_arguments runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b3584901b8a98ad47b9370e631665f6637938892fff67169a7f59d193bb412"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::cmdline::try_parse: FunctionTooLong \u2014 sccache::cmdline::try_parse runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmdline.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf9a115eee88aa1eb67a0af5447c234d3f68471baa9181f5b519d69e85b0700"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreprocessorCacheEntry.result_matches: MethodTooLong \u2014 result_matches runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/preprocessor_cache.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e795d3fca464a581b08089608a853ba4472e1dc3cfc5ee267ecb85d847b6da6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MultiLevelStorage: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 3 blocks, lines 345-1005. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/multilevel.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc107ac480f30c149e5be080f0da05c0745893854a50afb0bb2ea5e751c56f40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sccache::server::start_server: FunctionTooLong \u2014 sccache::server::start_server runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bbf357ef71f9fc60d45e9400d17d956ce54bc83a2de32e120775e1d9bf87af"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): src/compiler/diab.rs:181-321 | src/compiler/tasking_vx.rs:176-299 \u2014 These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeaa5be0740a43f522fd05c90d99016ec9101c602276eaaa4aa8e2dcd311f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/compiler/cicc.rs:281-347 | src/compiler/cudafe.rs:115-181 | src/compiler/gcc.rs:1044-1169 | src/compiler/msvc.rs:1141-1216 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4549ec89de64cd95ccb6ddfbe095fe2e6026b006e60207ab09fc6b54010fe0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/compiler/cicc.rs:301-333 | src/compiler/cudafe.rs:135-167 \u2014 before extracting anything, compare \u0060src/compiler/cicc.rs\u0060 and \u0060src/compiler/cudafe.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6205d9cf0d22a231fbc95ca732bb3a8ff4a82bb5cf6ff887d68372bb4a170500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/compiler/diab.rs:256-286 | src/compiler/tasking_vx.rs:225-255 \u2014 before extracting anything, compare \u0060src/compiler/diab.rs\u0060 and \u0060src/compiler/tasking_vx.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"26452bb78d3c404c1531bafe314d6a26d9b39594f346267257b8ea11e8d48bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/compiler/diab.rs:196-220 | src/compiler/gcc.rs:352-376 \u2014 before extracting anything, compare \u0060src/compiler/diab.rs\u0060 and \u0060src/compiler/gcc.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10ea88a24ffcac503f91fb18eac45a0322296be0662fa94d40e9c0f5d74bc3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): src/cache/multilevel.rs:841-858 | src/cache/multilevel.rs:871-885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/multilevel.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c0ffeb963c71ee1d4cb6e809c8e4b65643e0505bb7a98287462208c2d4627e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/compiler/diab.rs:230-245 | src/compiler/tasking_vx.rs:198-213 \u2014 before extracting anything, compare \u0060src/compiler/diab.rs\u0060 and \u0060src/compiler/tasking_vx.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9eb908371bf0696f44f318447fe033d090d6be1de4a3feafbdc6c0cf9b5dc6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/compiler/cicc.rs:283-297 | src/compiler/cudafe.rs:117-131 \u2014 before extracting anything, compare \u0060src/compiler/cicc.rs\u0060 and \u0060src/compiler/cudafe.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b1c7b8599cfd01dc97f98c8d86b622e4ff54d07d7579a25b7cd85fc54cc301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/compiler/gcc.rs:518-532 | src/compiler/gcc.rs:620-634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d4adfaf731af95eabfafd2078137f32d813f55d60dff5c5e5676ab82d22b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): src/compiler/diab.rs:254-266 | src/compiler/gcc.rs:551-564 | src/compiler/tasking_vx.rs:223-235 \u2014 before extracting anything, compare \u0060src/compiler/diab.rs\u0060 and \u0060src/compiler/gcc.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fe718cc183e73706fbdb68e20642ef48229e4e462e1d10ea6c1cb526d91a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/compiler/diab.rs:373-386 | src/compiler/tasking_vx.rs:386-399 \u2014 before extracting anything, compare \u0060src/compiler/diab.rs\u0060 and \u0060src/compiler/tasking_vx.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb7859e5a8729681d4ed11fc32b155ce0168cebe3f8be02c5e54b86ceafab5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/compiler/gcc.rs:482-493 | src/compiler/msvc.rs:628-641 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c8a7cfa5e045d3aa664842c34e1784d4d97f58edf628b9330f15005a60eb0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/compiler/diab.rs:308-321 | src/compiler/tasking_vx.rs:287-299 \u2014 before extracting anything, compare \u0060src/compiler/diab.rs\u0060 and \u0060src/compiler/tasking_vx.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c4715df4230767d96c34fae287ab5bc8f1e718b8e36b44e833d345e0c70043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/compiler/rust.rs:775-787 | src/compiler/rust.rs:791-803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bc15dcbb4e3350e2e52687606404cd71c981fbb3497ce90a2a994397d78eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/compiler/cicc.rs:318-328 | src/compiler/cudafe.rs:152-162 | src/compiler/gcc.rs:1094-1104 | src/compiler/msvc.rs:1177-1187 \u2014 before extracting anything, compare \u0060src/compiler/cicc.rs\u0060 and \u0060src/compiler/cudafe.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d552244202beba0655de169465fb5f4e6422215771fa852b73663ec1285051ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/compiler/cicc.rs:337-347 | src/compiler/cudafe.rs:171-181 \u2014 before extracting anything, compare \u0060src/compiler/cicc.rs\u0060 and \u0060src/compiler/cudafe.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2502ce319e9c2e55f1ded052ce079ab4f9a273bedde49c661de4f7cf740c246c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/compiler/msvc.rs:143-152 | src/util.rs:775-784 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d8042beb833a3c94417e7f04a288df2394d9155e9e3e1ea759c49a5ce712fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/compiler/gcc.rs:1189-1194 | src/compiler/rust.rs:1100-1107 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"20681e381ec154b8ae70cd90dd9d291af76acdffd48f18a990f9ac3d62522bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/server.rs:1889-1894 | src/server.rs:1899-1904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de699eb62c233c545fada295c66e825da2f953002d23262ccc4250db581855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/dist/client_auth.rs:540-545 | src/dist/client_auth.rs:594-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dist/client_auth.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d164d349042a56f337b4d8cd4eea91f74e3e4824926a43704230bf91a9ee646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/compiler/cicc.rs:106-112 | src/compiler/cudafe.rs:96-102 | src/compiler/diab.rs:97-103 | src/compiler/msvc.rs:111-117 | src/compiler/tasking_vx.rs:108-114 \u2014 before extracting anything, compare \u0060src/compiler/cicc.rs\u0060 and \u0060src/compiler/cudafe.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"135cafe63a10f5126fe767c6564d08afb71b37810c35899a13afc9ff20a0a765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/compiler/clang.rs:103-111 | src/compiler/nvhpc.rs:63-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/clang.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e97d429bb0f516ca5351285dd42127228018d75df7155db6dc30a4c2ed4c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/compiler/diab.rs:394-399 | src/compiler/gcc.rs:1177-1182 | src/compiler/rust.rs:1088-1093 \u2014 before extracting anything, compare \u0060src/compiler/diab.rs\u0060 and \u0060src/compiler/gcc.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b136da1d1058e281e4301f6e2d6ebd26238923766c3917cc819fe5ff216485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/util.rs:479-490 | src/util.rs:494-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd1d908d3708f1487f07ab8d9d2b29cf9e8347eed6b426b58028f79f8209f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/compiler/tasking_vx.rs:318-327 | src/compiler/tasking_vx.rs:348-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/tasking_vx.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9735e608ab3c78260698ccdcf2e663db0c222c04f12f16383cce05408cda15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cache/cache.rs:608-614 | src/cache/cache.rs:627-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbce5689a4899df0d578903e62ceaa2bf276f8a77c13dcb063d254690f425b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cache/cache.rs:591-596 | src/cache/cache.rs:608-614 | src/cache/cache.rs:627-633 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ab2b32bf232e49d73fc26cb06219c731c6f5f13eb7ddf0b824c6a8e4b0036c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/bin/sccache-dist/main.rs:71-75 | src/lib.rs:68-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/sccache-dist/main.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6707b6f3ae7176136693cf9ce3f1094e6d15e23c9f21749311e9e20f7b1f2bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cache/cache.rs:459-464 | src/cache/cache.rs:483-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dbc30faac9da8f790ee7296fb1c5c5d2a97b4bc0b91b385642a3bb6e493d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cache/cache.rs:459-464 | src/cache/cache.rs:483-488 | src/cache/cache.rs:518-523 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaad933bdda0c2110958fa1fe1fd43f3bf2260f62038346356b090cfd9fe3f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/cache/cache.rs:459-464 | src/cache/cache.rs:483-488 | src/cache/cache.rs:496-500 | src/cache/cache.rs:518-523 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2007c5bf50626c99a6d3a1b48ab8903ac4374dbd3809e334c74a13d66195e3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/cache/cache.rs:460-464 | src/cache/cache.rs:484-488 | src/cache/cache.rs:496-500 | src/cache/cache.rs:519-523 | src/cache/cache.rs:569-573 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0c308a26b5f06e9656fc96f4c50d6c17873af9b084a041d98142b11e70f891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/dist/client_auth.rs:206-211 | src/dist/client_auth.rs:383-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dist/client_auth.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e106e01614dfdab5f8aac90c8aa95dca1e32405034a6ca7505672dfa855a2aa"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: sccache::system.test_stats_no_server: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4a5b9c3efc5ca8b002fdf52b57bef19b8d981285f0688e1e4ac40163d04100a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compiler/gcc.rs: src/compiler/gcc.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in sccache::compiler::gcc::parse_arguments at line 291. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/compiler/gcc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c387e5b1ab0601669e5d9ac2531e31eff6218146cdc5862ef93d6e8384beb3c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compiler/msvc.rs: src/compiler/msvc.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in sccache::compiler::msvc::parse_arguments at line 557. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/compiler/msvc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"1979a53f32c4f7cefaa0930ebe2e56812ba5a8d1e43158656ef7cfa52bd20950"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compiler/rust.rs: src/compiler/rust.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in sccache::compiler::rust::parse_arguments at line 1120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/compiler/rust.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3dae44bcc2e64294e1f23b842308d3b05b85a593bf626d664bc029f9f33169"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compiler/c.rs: src/compiler/c.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in CCompilerHasher::generate_hash_key at line 394. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/compiler/c.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8a29cf0fc1a5fbe17ebfe2ec6f7e8d281192d85979004c85d38228b8db02c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config.rs: src/config.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in sccache::config::config_from_env at line 901. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f83fd10120ed4a917dcfc3ce4ccd0d2541e6e1b7c2e6302da48998a13fd067b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server.rs: src/server.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SccacheService::start_compile_task at line 1422. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"935aee74fcf38942724a4f591f0136169a62224b7e5b96f494ad8479376c1328"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compiler/nvcc.rs: src/compiler/nvcc.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in sccache::compiler::nvcc::group_nvcc_subcommands_by_compilation_stage at line 646. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/compiler/nvcc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"93df16490307d762bf79d1b772d0c6f99a1719fba4bad1795fd19c7ffa0344b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cache/cache.rs: src/cache/cache.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in sccache::cache::cache::build_single_cache at line 436. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/cache/cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache/cache.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222cb45830b898dd30e58d5ad46df567c25b366982a0649bb8ae517ea3cb9d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compiler/cicc.rs: src/compiler/cicc.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in sccache::compiler::cicc::parse_arguments at line 115. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/compiler/cicc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/cicc.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a04a423cd2e32837b293da38195c37af40a9a3d538cd50623430a2f507f76f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands.rs: src/commands.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in sccache::commands::run_command at line 719. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 21:14:59 -04:00\u0027 --until=\u00272026-09-28 21:14:59 -04:00\u0027 --full-history --no-merges -- src/commands.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e06d8cbb0b0c2129a3097019053ac8ffe80d59712448252c26fd9351c963530"}},{"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: src/cache/ipc_storage.rs, src/protocol.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"41f3a2fbe21cd1bb465325443f0bc153be1554e6f1fde8c6d81644803d4997fd"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (3 single-owned of 38 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; 38 of the 51 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"4befb30e27174c542c7ad3f3d332931021752fdc90b5d0720ca7bd409a2cec91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/harness/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccf99c1fe57f8355307aa3621c884ade64b99f14f036c7b7b6908ea1b59577e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"85407296492f55054426ff535a4ff18e9a79c7f4dd08d6e5a48bf29a7526b67e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO resolve the path right away \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1138851fba63d9f39e76988e5b6170c7f010c2fc4b458703da44ac7bea1d2e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add some safety checks in case a proxy exists, that the initial \u0060path\u0060 is not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc3a80f98c05ff074131cf7ebef384c839e38a4b9cbb6d6fe4f174244cbdf76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO the same as the resolved compiler binary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc55e4058005a9ccb5a177ab29bb8a2f9b2a05c28e0304557e890586936c587"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: See note in src/compiler/nvcc.rs \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaf1faea24b3c688e7ea0813d4e1797c8847c5588044fde4490f7acf50e17be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: figure out a better way to communicate this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"66458a322795b29ee087704a7bcbd34a32bde4426bdbd2072dbdd0c5eeeb154b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: save cache stats! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"875d5d0d4da49af8fca1613c0cab13a36f64db94d3178ee529b2ac72cd97c8cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: this would be nice to replace with a custom derive implementation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec4236f272cf832d44a39dacfe0086ee0a5d9beaacdbc4de5285303841c6391"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support get addr from abstract socket. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/net.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d38ee47a0f79e83181bcb75a313153a06189356cbfb2937fcdfb8231833469e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: this doesn\u0027t work to actually track 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":"src/mock_command.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"745f59f19b209f5f6a782b61a6e1e5ed1a585f9314ec3b07e03d1203d343b83a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: assert value of dir \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mock_command.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"596f943757968a3a42e9aa334c52fd47394ba1ba3aab56b9534cb9ed45d58797"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: assert value of program \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mock_command.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"baccdc16c9820461ec762abf09a8377ddd365a4d93dced104f069dfa1c4b62bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: relative url handling just hasn\u0027t been implemented and tested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"76854510c796b601cffb7386556de8cf759ffeaacfa90194382f9241daa185aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fields only pub for tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a41456c29bc3db1ebc243d1c58d28faea3a3577e59deceb42d43ddfd561a3fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expose \u0060bInheritHandles\u0060 argument of \u0060CreateProcessW\u0060 through the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f1eb1306f8caf426e5f3b9146abb9d4144fa83e8f00f508f21d5ca6b3c5d92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: better error mapping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d484c09510b0d5b9a62faafef30ba4f07f43eb9dce9ccb937f09d55cc9185fac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: better error mapping? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc19305f5cc4106007729fbbce81f93481de2cdf1a6f29787b132d8e29774edc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: something better here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e51a6b25e381bb70c20ce4107759404459294ce9bbe1d33dd6960c3052ffd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Delegate FS access to a thread pool if possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d4cc60f64ff53489b7990e7036fd892bb784c592b4591d406d8b4b93e6fd10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this doesn\u0027t produce correct arguments if they should be concatenated - should use iter_os_strings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfa1290373db1740edfd2f43a262ab08aa29e3437d54b4e1c45c2235116199a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there will be full paths here, it would be nice to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"916d8208788f77c94dac5c4ad8a21e10d3462cd2a8fd2c4d1d8c95019383a11f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we do end up with slashes facing the wrong way, but Windows is agnostic so it\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cb9c9d55f80d950883f64b948a666c7d32e6c5e15f7f9b441452c5e613fe4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO simplify this method. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9414df3c8f0a480f9d253e180b57c214738db7206395e0c0455c493ac84bf5ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unfortunately there is exactly nothing you can do with the k given the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4298b6218c1eabeb20d734dff826427c3d631ece70abaf5928f7dc0d2a8a1e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is fairly naughty \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/rust.rs"},"region":{"startLine":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ab50d3471b0ac376e8abe161547b62eedb5fd5ef71b667710b49ca5803c854"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If we need to chain these to emulate a frontend, shouldn\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvhpc.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a888b323c727b6dea8369cec4f76dc7c2a4cfba1bd3458a4c0d87ef32b0751"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //todo: refactor show_includes into dependency_args \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvhpc.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cb7aad5bf1b44e49904f6dd7bea94b1b19985ade0aaa4df18dd5f942900aa5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //todo: refactor show_includes into dependency_args \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"483dee67c3b48742a79302d961f635c67a9e76e8d6def1622015340062837ba9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This compilation will look like a C/C\u002B\u002B compilation, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/nvcc.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abd8c12ab2f06d5c64db237bf9c4429bb124da219a65a9730d9009dc92876e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // /EH[acsr\\-]\u002B - TODO: use a regex? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4752093167a421dd0de9cc6d02fc0133299743d83ec4cc0510bb57c9d643970a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: disable explicit language check, hope for the best for now? Also, handle /Tc \u0026 /Tp. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5934fd71bda2db0e703c3e477a95813fd7eb78c415b92912f7c8af33af12ab38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for msvc modules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cedfc66c12da43a5eccd8cc0296dce7a366cc35f664056f64180ff3a1f35d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: what to do with precompiled header flags? eg: /Yc, /YI, /Yu \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c15e0515ddc8d1cbd5557b5dbccaa761e9ee1bc7d73eeb7ade0b94b668fbb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: doing this here reorders the arguments, hopefully that doesn\u0027t affect the meaning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aad8ef375dc80f51bc6411bdf9eade820eb99d629d419f55dff680a1eac59d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: implement color_mode for msvc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"795f2a75e6b3332a6b9372f7f07b3042d657126156a63b6310a51e4ae44ac8ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use /T... for language? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/msvc.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bba09001eb20cfc4ba9b3ce8bd4ea3d24bcb7cdbec1db549ed721686d4edae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for GCC modules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/gcc.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"da926ff6a77b1c55cb43d4ba1964db81195bcdb3c4428ce3ad26b2fe2b6846bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement me. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/diab.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9962cfcbbecf4750c92eea85e67e664cd77e4f6ae3d8e2f3a9f471ab30b583"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b769fb7f0997e81b2e6d210d9e05d00f043796e699b928671bdee09383eb9dc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use nvcc --version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e2ecca0c6ffb9b505691b10eded31056f56a858e712c0eadf6add916abff11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use nvcc --version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44579a7bb4eaa4e5dd952fa47c7fede10ccd36753dec03d285967cb4effdbc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use nvcc --version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/compiler.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"908703cdee8172b385a885b0a9439832fdf525f1125dff4a58698ef5deefd558"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO how to propagate stats and which stats? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c2de50c0e917effe3a5bee7b7cfb9a35b8a6b0c488960386c9954795984626"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if precompiled header. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5fcb2063ddbb83f097cb16c8f75c4f4b6288d82060c62d36571374e2490383"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add an option to ignore some header files? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compiler/c.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baa128bbdb6e12bde6bedcd7f3df3b90f7692d28435b178461600d90b698613"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: ideally LRUCache::insert would give us back the entries it had to remove. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lru_disk_cache/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"837f1d7e99e6954867cba903b4e55e65ff996800646b3c9b4340bb6fdb7eb546"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: check that files are removable during \u0060init\u0060, so that this is only \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lru_disk_cache/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72bb1c40d1058ec914d8070419755c5b9875136d9541afe37cb2a4ec0b05328"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(conventions): implement indexing? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lru_disk_cache/lru_cache.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"32da3422368140f5110af6c69a93b4fb15406a429920b3497234c8182355e831"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: MockCommand should validate these! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/tests.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2f4129b6842f6dfc444b89661856e41c669e36f2ebb6aa0cde87d5ec6a2312"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: MockCommand should validate these! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/tests.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"015204014ccc05f6faec516dbe7fd2211710ebe103fdff15b274a938d11907d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: wire up a way to get data written to stdin. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/tests.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"234d5e876a2691e1a25a3071f02af7a1edb655abc0ed592cf55751f5f97768bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: could test gcc when targeting mingw. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/system.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b823d68d61626b3d3649b4be3a7674ccbd2138fec3dafb0a27020a6f3ae607cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will fail if gcc/clang is actually a ccache wrapper, as it is the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/system.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8746ea6619c64d04591fad5a79f310ed213dd27e7459446aa8d3e629bd1504bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will fail if gcc/clang is actually a ccache wrapper, as it is the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/system.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfccb26079af47b4cd7890b7b04fbf017747297b88d415137290a706b54afa2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will fail if gcc/clang is actually a ccache wrapper, as it is the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/system.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb91e205932ddecb14e83ee2070cda4b4e7beab718728cdab669293751f5c54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This runs multiple test cases, for multiple compilers. It should be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/system.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d3ee7e21de7016067b6e9e87e13b5d3516e8e75b05df5b494b00663d583a50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is copied from the sccache-dist binary - it\u0027s not clear where would be a better place to put the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/harness/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a0ac5b9e3f3a9a1e868c4c72cc9269d53e89d487a2620db692ba95996377c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pretty easy, just no need yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/harness/mod.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7351036d63dd11941bebdf4b6f6d363c70d4a4fdce6d79a4d2bf15efbe4fa95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: after upgrading to reqwest \u003E= 0.9, use \u0027danger_accept_invalid_certs\u0027 and stick with that rather than tcp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/harness/mod.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"4885c715e92e9dc2f800a81b880bd6070a396c0b64b26df803a73945493bf3e5"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The first paragraph describes sccache as a ccache-like compiler wrapper and its multi-level cloud-storage caching, but there is no overview of what the repository does or what it is for beyond the one-line title. Add an overview section explaining the project\u0027s purpose (shared compilation cache across compilers) so readers can understand the scope without reading through the entire README."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous and overlapping read operations. \u0060get\u0060 and \u0060get_with_raw\u0060 appear to serve similar purposes (retrieving data), but the distinction between \u0027raw\u0027 and non-raw is unclear. Furthermore, \u0060get_raw\u0060 exists separately, creating a triad of read methods with unclear semantic boundaries. It is unclear if \u0060get\u0060 returns deserialized objects while \u0060get_raw\u0060 returns bytes, or if \u0060get_with_raw\u0060 is an alias for one of them.: Unify into two clear methods: \u0060get(key)\u0060 for deserialized/high-level access and \u0060get_raw(key)\u0060 for raw bytes. Remove \u0060get_with_raw\u0060 as it duplicates intent or is a confusing variant. (signatures: Storage.get(key: str): Result | Storage.get_raw(_key: str): Result | Storage.get_with_raw(key: str): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b393f019f7dd4604473247c0e4e3de44e2640debce8f45406713ae8d66260473"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent naming for write operations. \u0060put\u0060 takes a structured \u0060CacheWrite\u0060 object, while \u0060put_raw\u0060 takes raw bytes. While the distinction is logical, the naming convention \u0060put\u0060 vs \u0060put_raw\u0060 is less standard than \u0060put\u0060 vs \u0060put_bytes\u0060 or \u0060store\u0060 vs \u0060store_raw\u0060. More importantly, \u0060get\u0060 vs \u0060get_raw\u0060 inconsistency (see above) suggests a broader pattern of confusing \u0027raw\u0027 terminology.: Standardize naming to \u0060put(key, data)\u0060 and \u0060put_raw(key, bytes)\u0060 if the distinction is strictly about serialization, or rename to \u0060store\u0060/\u0060store_raw\u0060 to differentiate from generic \u0027put\u0027 operations in other libraries. Ensure symmetry with the \u0060get\u0060 methods. (signatures: Storage.put(key: str, entry: CacheWrite): Result | Storage.put_raw(_key: str, _data: Bytes): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7980f5742822ca9e7d59d1579a391e4b1a2f9d7717e4cf5715e6857aebc8e5e3"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate intent in \u0060TcCache\u0060. \u0060get\u0060 and \u0060get_file\u0060 have nearly identical signatures and likely return the same type (\u0060LruResult\u0060). It is unclear why there are two methods for retrieving a toolchain, unless one returns a file handle and the other returns a path or bytes, but the return type \u0060LruResult\u0060 is opaque and suggests identical behavior.: Remove one of the methods. If \u0060get_file\u0060 implies returning a file handle and \u0060get\u0060 returns a path/bytes, rename them to \u0060get_file_handle\u0060 and \u0060get_path\u0060 (or similar) to make the distinction explicit. If they are identical, remove the duplicate. (signatures: TcCache.get_file(tc: Toolchain): LruResult | TcCache.get(tc: Toolchain): LruResult)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1b2d76b591c3303fefdada295c46820257e90b3ffd0636152ea819c5224ae3fd"}},{"ruleId":"D22","level":"warning","message":{"text":"Overlapping retrieval methods in \u0060LruDiskCache\u0060. \u0060get\u0060, \u0060get_file\u0060, and \u0060get_abs_path\u0060 all retrieve data associated with a key. The distinction between \u0060get\u0060 and \u0060get_file\u0060 is unclear (does \u0060get\u0060 return bytes? does \u0060get_file\u0060 return a file handle?). \u0060get_abs_path\u0060 is distinct but suggests that \u0060get\u0060 might not be the primary way to access the underlying storage.: Clarify the return types. If \u0060get\u0060 returns bytes and \u0060get_file\u0060 returns a file handle, rename to \u0060get_bytes\u0060 and \u0060get_file_handle\u0060. If \u0060get\u0060 is the standard access, remove \u0060get_file\u0060 or make it an alias with clear documentation. (signatures: LruDiskCache.get(key: K): Result | LruDiskCache.get_file(key: K): Result | LruDiskCache.get_abs_path(key: K): PathBuf)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"867912dc55a36c77eb91d05500e18cd40db80d1fe69b273276ccc98e650f2061"}},{"ruleId":"D22","level":"warning","message":{"text":"Severe type inconsistency in configuration structs. Many properties that should be \u0060String\u0060, \u0060PathBuf\u0060, or \u0060bool\u0060 are typed as \u0060Instant\u0060. \u0060Instant\u0060 represents a specific point in time, which is semantically incorrect for connection strings, endpoints, usernames, passwords, or boolean flags. This suggests a serialization/deserialization bug or a copy-paste error in the type definitions.: Fix the types of these properties to their correct semantic types: \u0060String\u0060 for URLs/credentials, \u0060PathBuf\u0060 for paths, \u0060bool\u0060 for flags, and \u0060u64\u0060 or \u0060Duration\u0060 for timeouts/sizes. \u0060Instant\u0060 should only be used for actual timestamps. (signatures: AzureCacheConfig.storage_account: Instant | AzureCacheConfig.connection_string: Instant | AzureCacheConfig.endpoint: Instant | GCSCacheConfig.cred_path: Instant | GCSCacheConfig.service_account: Instant | GCSCacheConfig.credential_url: Instant | RedisCacheConfig.endpoint: Instant | RedisCacheConfig.cluster_endpoints: Instant | RedisCacheConfig.username: Instant | RedisCacheConfig.password: Instant | RedisCacheConfig.url: Instant | S3CacheConfig.region: Instant | S3CacheConfig.endpoint: Instant | S3CacheConfig.use_ssl: Instant | S3CacheConfig.server_side_encryption: Instant | S3CacheConfig.server_side_encryption_aws_kms: Instant | S3CacheConfig.server_side_encryption_kms_key_id: Instant | S3CacheConfig.enable_virtual_host_style: Instant | OSSCacheConfig.endpoint: Instant | COSCacheConfig.endpoint: Instant | WebdavCacheConfig.username: Instant | WebdavCacheConfig.password: Instant | WebdavCacheConfig.token: Instant | MemcachedCacheConfig.username: Instant | MemcachedCacheConfig.password: Instant | DistConfig.scheduler_url: Instant)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c3fa2055014b4fc71e5dbb7b5e7a68321ae11802150fc464e9331e08e6271b7a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (41656 LoC, 295 public types across 7 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce32436baae3a3398294a13b2d81faf70dbe26dbec06db423c356d625e02f92c"},"taxa":[{"id":"CWE-78","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":"dfa47e0734e9fc194df9f972ced2a247be831773bb18b40a59d63d3634dee421"},"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":"594c72d3e058b509f7c51006fa6e95f353185c83a8e5ec488518e5e587fb7952"},"taxa":[{"id":"CWE-78","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":"d867e26a6b65cac0fb197c165d75a1aa3a1f72cd5ed27f966e3ddc98f56da67f"},"taxa":[{"id":"CWE-78","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":"cc23b5bb64d930d5064dc7a04b730582ee05b66a225953432a52b710d872856e"},"taxa":[{"id":"CWE-78","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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"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":"86ff7f2e594db47393c9f588f7e54996d645eda9ad52ff15a163a3d957e41984"},"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":"1d50d45a5f4f21c2ea4d35d5a86f4b0e0eb13103b6b901aebd52074b4ebad606"},"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":"772285dd79e4a70e1ea69c1d39fd49dcc482080467417ef21c1f3e6168c3d8d0"},"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":"7e58f76cabe74ae821b0c2f44fa7f1a0de480fc6ef6fa11ebb119b6d8bb8bb0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f7252d84ba739ecc83aa22f96b48b7bee95c4e0a6753eae98c1887b8e4ba0362"},"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":"f9976ad9cf6373713606ae7ab05bcfda2eacfc36f22323a03907e8f4fc808375"},"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":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"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":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"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":"6bc3b539f953f180f304780b633bbb65e6d2911ce57503f2f0e4a05dfd504060"},"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":"1d35561ec51791fe520e6144218cdb5dcf8cb9509c5791003fe82df2e95f1fb5"},"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":"28fb95c74cf7e51a3f6e58d6d5d9aaba698bdc10ef21fbd45c72dc90736c26c6"},"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":"dd65e2f04abdf477e5d882fff12a00d1ee228e0a527014aeb9b4139224ebe812"},"taxa":[{"id":"CWE-494","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":"bf6e654aae86dc886c5a2e651d1be07a1252f28560ba57c82c6b15ac3d1f9c30"},"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":"96f88121b035a898a6759141862415469563ae4858d3bd2449d90d5e5ba04a57"},"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":"2a279ebf4023337ba6f3d96d8031ed80e3a4b1d84df93eb03028b463169de7a3"},"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":"52a8258575708790444af5ece7f82769ad0d6ebb6c24251796eb7b7e9e469dc4"},"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":"7a07b93ce2363b478bb6172372805726066e1b693affb82bfde3d8f5dbc437b4"},"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":"015bf76b2b55459728d7ad659fcd50c15a8a7113f27dec5b84eb9b439681a1d4"},"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":"caec526121c6b345aa26010a26833cf5ed0c77f44e3cbc3738590a50bd240821"},"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":"36365f779d5f5d43fecedbe9e0d12a6ce8cbdb25464fe5f41d877264a817b1de"},"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":"76162bc8e690a8e2e13245162b14d070aa1bf6a4ce316b2a7e15e9e2c84d783a"},"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":"e91595e762a52203ffa3135be07456ec325b2c18de1f743c42f96d789f2271c1"},"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":"7a5cf36a5aafae98a8880de486497bb0a68fbc6eba85ab100375b8444826a436"},"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":"a5ff6c36cc77c52281fa395ac6b9e1e18754b22fb93caffb8d30a7715d1e22e8"},"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":"bc17439367157c6f6ff8590f4dfe29bc3a0ce4e328d99df310f8a49a2877af10"},"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":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"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":"2c20832b0840d1cafaaf91a5d8b21c03fc19a039067422db7f84fe5560dfdf5c"},"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":"1375048b9ca8ef192c23faf83af425d2e99a11eb2f6e7951f3d837d8c63c990e"},"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":"6697da3b2939cbcf901a777f5a24bd801502016d5915f04b926e15ae287c6795"},"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":"f90d8d5a76a4368ef80736d1b2273b127c79d66b09096558956d151969e66b77"},"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":"9119ee576a0a0f25500f745a1ac733db4e5052e6fc8c39d01a211c3e9cbeda65"},"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":"f5d5c96f014a6759f6e34b74976b53a0a735fd8f1f04d0bb4aae0ed9f02ad720"},"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":"fa26e706e88c081fd45d61d25d8dcb0cb39053d84438f1b23ce9c7c22b3def7e"},"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":"088a49c91a0664fc070f455f11ac9c973b9e62f38a8e086951080141c00807b7"},"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":"8134eedf2d509cc20f908ade6883e792cfe2b2dc03d97a0ee5f9b1602e923c74"},"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":"e177bb8634a26976c8c4ac9548f1ff02a83ec384bb9bd83753eb619294042d42"},"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":"133c967ae926ffcb4581f5da49e8947813d9f10783a52a34b63412dd03717731"},"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":"32c0ec077298669b96a1fdc976c0af6dc0275779155c3f9959409d919c8c8544"},"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":"80631f71f661bb14f91a19e86806759e0c5d0170e7c3b6a421272671b8e7b30c"},"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":"8f8abda83105925550bb6b7b45610124b890bfc6ea62509fca9df8ebac461464"},"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":"826026e853a1955dd570a1438c09055576c81937ffa7da33cb5199bf5938c0af"},"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":"05095cf11a432d281a6ee563758bdd93f1fb7e376a52e0fc21b220a3ecd05be3"},"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":"343ab7adb316d3b7d905029ca0fdaa61c188d27b980414950bf9fed156a74848"},"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":"f7b2081f08e0cb0b035e10866cd6d80b31966ea132332ffc403e40f6029c726e"},"taxa":[{"id":"CWE-78","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":"3a0244394a14594b0a4a9dbf07c8eedbbbef4d6c47250da17a8b164d98047dda"},"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":"62f70762372bb921d11872f81e51763ce2b46ea24ce81f189fb5bb4a406ddda2"},"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":"47cc1b3a010efd566f8a650f55103849f500caa0c1aa81bdcb1f296a3cb41185"},"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":"2517ca7bb08317e968db62474d7189f84962e37724c6a210a391bbcc1b9f9ec4"},"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":"e4164103d67029810ba8a834383d42b3495e1e8f7aba08367c4d64436a33c68e"},"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":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d3d2c2346bccaaa14c1bd0f0713c18ae4de849fffdc7282dbd533ab105c9398"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0049","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9e2c75d2fefa94504a6443bd33d31210eecfcc19eda5a718aaf21e504742ebf"},"properties":{"dependency":{"package":"openssl","version":"0.10.75","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"7cb949b0dfc97628adeb5867f44cfbeefa3a6a1068b707709bf0e421e653ea4f"},"properties":{"dependency":{"package":"bytes","version":"1.10.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"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":"be9977d5d7ddb867e7f2e9fb5ad301e217dd9c03427d8e948d094761434f4502"},"properties":{"dependency":{"package":"jsonwebtoken","version":"9.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85ffa314d77812277deab31fb2264e02366c4034561614d82315c198cb6bb99e"},"properties":{"dependency":{"package":"time","version":"0.3.36","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0009"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da9ce41d3dc2da176b4e1aa86f2ae1a68df334c8ac5ad721abff2335197b0ec1"},"properties":{"dependency":{"package":"tracing-subscriber","version":"0.3.18","advisory":"RUSTSEC-2025-0055","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe4a61fbc98a378fc53b54b0b8c33bb7f1e39af4547d0e244b65e56f6b2eb150"},"properties":{"dependency":{"package":"twoway","version":"0.1.8","advisory":"RUSTSEC-2021-0146","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":"c71806333264b34b7644e0c3565174d18fbab6534acab9d87f1cc26b81830dc4"},"properties":{"dependency":{"package":"buf_redux","version":"0.8.4","advisory":"RUSTSEC-2023-0028","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":"5047091f0da8fff6b27155b4acaf7af76c492d1138288a2c154700456c997d47"},"properties":{"dependency":{"package":"multipart","version":"0.18.0","advisory":"RUSTSEC-2023-0050","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":"b6e178e09ad3166928a6fd47fe2f1bcadc4f398ab02386e48ace5d8206b4c0f7"},"properties":{"dependency":{"package":"safemem","version":"0.3.3","advisory":"RUSTSEC-2023-0081","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":"705e8761c5e609601c0419d94a8bad1aeb6aee434f48ec4660c92e8bf534c9de"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d44a25813d8a9e18eb42fa5350a972c298292d454155c6472f091bfb670363df"},"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":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.9.4","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":"29657cae34dd8cde614417a5e63194c90262d7543de5763d566a22c44f87c6e9"},"properties":{"dependency":{"package":"scc","version":"2.1.0","advisory":"RUSTSEC-2026-0205","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.45","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.5","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3035e85b1a9c0c33df37dc333f490439b3fa52aefda24a401e2e75a177cdf778"},"properties":{"dependency":{"package":"rustls","version":"0.23.31","advisory":"RUSTSEC-2026-0285","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lru_disk_cache/lru_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"783cf13378e5310e058ed7dc6110657e60f0ce2581b322a4a54a7b5f9d8e1ac3"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 1 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/client.rs (2 orphaned of 38 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; 38 of the 51 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}}],"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":81,"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."]}]}