{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::string::string_instruction (cyclomatic 115): v86::rust::cpu::string::string_instruction has cyclomatic complexity 115 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/rust/cpu/string.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec65598a1c38c2877e543e12948b624986adccc76735391b08e976cdd2dd194"}},{"ruleId":"D1","level":"warning","message":{"text":"main.start_emulation (cyclomatic 103): main.start_emulation has cyclomatic complexity 103 (threshold 15). Of this number, 91 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df142757349eee5baaab85b494d5fd0fdd41c080135779251019109fae868be"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::jit::jit_generate_module (cyclomatic 86): v86::rust::jit::jit_generate_module has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f019b0b77942967721096b7616dca3f6c45ba83c57482ef90273df6eb71f35a"}},{"ruleId":"D1","level":"warning","message":{"text":"9p.Virtio9p.ReceiveRequest (cyclomatic 72): 9p.Virtio9p.ReceiveRequest has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa55947ce1c545fc4cc5d51ddb79769cd234cd640e4f8798b949cabcc257ff0c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.init_ui (cyclomatic 72): main.init_ui has cyclomatic complexity 72 (threshold 15). Most of this is not in the body itself: 11 of the 72 points are its own statements and the rest belongs to 31 function items inside it that branch (enable_theatre_mode, enable_theatre_ui, add_image_download_button, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59e2a26cde93ed1bb028876ba6229f8ecaa6b78080412615199bcb3d83b4bb5"}},{"ruleId":"D1","level":"warning","message":{"text":"ne2k.Ne2k (cyclomatic 70): ne2k.Ne2k has cyclomatic complexity 70 (threshold 15). Most of this is not in the body itself: 6 of the 70 points are its own statements and the rest belongs to 31 function literals inside it that branch (lines 406, 512, 536, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66180af3cae00742285f79a36d202613f0cfe08fa35da5f6c5c14608fc099c2"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::far_jump (cyclomatic 60): v86::rust::cpu::cpu::far_jump has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3049f90f8e0394abf3785ed5dc879ad54a44f08edd8d5bc115fb7c7b92e4ed59"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::do_page_walk (cyclomatic 60): v86::rust::cpu::cpu::do_page_walk has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7838fa5a8b1da25a34fe5a0160e42a00d913218c44da739d7cdc0b79f6e141"}},{"ruleId":"D1","level":"warning","message":{"text":"ide.IDEInterface.ata_command (cyclomatic 53): ide.IDEInterface.ata_command has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7740e24ad769b6f360b7f6967880648b19945f5796cb6b9654149281c0d1bd0"}},{"ruleId":"D1","level":"warning","message":{"text":"onload (cyclomatic 53): onload has cyclomatic complexity 53 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 15 belong to 43 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ed4d715429ae2b2beb2590d13521c5320952aa717d5d2d4efed0451867e811"}},{"ruleId":"D1","level":"warning","message":{"text":"ide.IDEInterface.atapi_handle (cyclomatic 51): ide.IDEInterface.atapi_handle has cyclomatic complexity 51 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a2c1b60bcf1960b698ec927a5e85213e59ffc29d7a8fd1a3bba86fd146eddf"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::call_interrupt_vector (cyclomatic 51): v86::rust::cpu::cpu::call_interrupt_vector has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"93934e7d85a3acf89fc82a263f783a55a1f35e66be85892dbdf8dcba88d1d1d2"}},{"ruleId":"D1","level":"warning","message":{"text":"modem.Modem.cli_exec (cyclomatic 50): modem.Modem.cli_exec has cyclomatic complexity 50 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"928087382265a1dfd8e49ed38fb1d03b03c85481fb9da3b1a286f1e52b4b6bea"}},{"ruleId":"D1","level":"warning","message":{"text":"starter.V86.continue_init (cyclomatic 48): starter.V86.continue_init has cyclomatic complexity 48 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (starter.V86.continue_init::done) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33aab006aad055b9175a539bdac69c4624b01526578126bdd3a16c3222a4d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"mouse.MouseAdapter (cyclomatic 47): mouse.MouseAdapter has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 2 of the 47 points are its own statements and the rest belongs to 13 function items inside it that branch (may_handle, mousemove_handler, click_event, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/mouse.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdb09a3657d5970df4170cf49d13ee9468e8f33648ffbec0bcc4decb7125179"}},{"ruleId":"D1","level":"warning","message":{"text":"ps2.PS2.port60_write (cyclomatic 46): ps2.PS2.port60_write has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ps2.js"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"af75de4b6c0d3763caa6af8993f79ff48ae5318e643a76a0d5fe7e2edd9c8609"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::jit::jit_find_basic_blocks (cyclomatic 46): v86::rust::jit::jit_find_basic_blocks has cyclomatic complexity 46 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca0e5dd934eae5470dc79a2519a18ab3dc287d30ac63be1a69f64aafecf1207"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::iret (cyclomatic 44): v86::rust::cpu::cpu::iret has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b958aaee40e9bd64391fbdbf8840bc0dac9a33d1f9f0d307b7dd1c3c394e6361"}},{"ruleId":"D1","level":"warning","message":{"text":"cpu.CPU.init (cyclomatic 43): cpu.CPU.init has cyclomatic complexity 43 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 15 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d753a1d68d39d4e19347149b8aa74f0aa3ece920725cb180e552d1b8a37fac"}},{"ruleId":"D1","level":"warning","message":{"text":"ne2k.translate_mac_address (cyclomatic 42): ne2k.translate_mac_address has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f69ae783000b79d4f223286f33cc405b7fa29df773b6f8db6e21f3110573594"}},{"ruleId":"D1","level":"warning","message":{"text":"cpu.CPU.set_state (cyclomatic 42): cpu.CPU.set_state has cyclomatic complexity 42 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b638b26d1d26bc563a4e18e1796cf636634970a182e8b520373fdbdca63df8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"cpu.CPU.load_multiboot_option_rom (cyclomatic 39): cpu.CPU.load_multiboot_option_rom has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 7 of the 39 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 1360, handle_write). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1900e997f60b55e595f59f13e8ad582e545823fc2d5483be7bc201c60a29b06b"}},{"ruleId":"D1","level":"warning","message":{"text":"virtio.VirtIO.create_common_capability (cyclomatic 38): virtio.VirtIO.create_common_capability has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 399, 518, 478, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e768da5160d5f398f5f1772107d829a71ddec091e82906d67177229b9072194"}},{"ruleId":"D1","level":"warning","message":{"text":"vga.VGAScreen.port3D5_write (cyclomatic 37): vga.VGAScreen.port3D5_write has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c92b5e66a93271be610cc0bbc0f4d6ae859ecb88677b3388b20c30ad23a7daa"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::codegen::gen_test_le (cyclomatic 37): v86::rust::codegen::gen_test_le has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa1208b76703ceef74b17645fdca5a9ba701e28ad90b8f4e104d17a9d0d5cc5"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::codegen::gen_test_l (cyclomatic 36): v86::rust::codegen::gen_test_l has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b524d4d1eb718fceebf30502faeb291dc81f59fec41994e75222dd659886b081"}},{"ruleId":"D1","level":"warning","message":{"text":"vga.VGAScreen.port1CF_write (cyclomatic 35): vga.VGAScreen.port1CF_write 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/vga.js"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"464f482245cc8821ab88685a77224015dc8786961cf532ffb74f24c7f1d2568f"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::apic::read32_internal (cyclomatic 32): v86::rust::cpu::apic::read32_internal has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/apic.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"649b29c7f91ec46d8f36ef406ad8d7aaaf3fae0bd6c4beaa165696082d8e7cde"}},{"ruleId":"D1","level":"warning","message":{"text":"fake_network.TCPConnection.process (cyclomatic 31): fake_network.TCPConnection.process has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"080f3c85e39b634857d786a616ad42705560874cff4d5dd3a188cdc78ffa9be1"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::apic::write32_internal (cyclomatic 31): v86::rust::cpu::apic::write32_internal has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/apic.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"68900ef3c61a18589d666ac8e4e97b6bca95b4e099a404964787f089881832ee"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::do_task_switch (cyclomatic 31): v86::rust::cpu::cpu::do_task_switch has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"de664d7c4037592961fe3dbd778162a80777353cae1f5b53f11f89ab596e825d"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::codegen::gen_safe_read_write (cyclomatic 30): v86::rust::codegen::gen_safe_read_write has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"7178d7b6570e0b9bddb7ac6219a0319982cab471e5b3df128744d63ea7016909"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::instructions_0f::instr_0F30 (cyclomatic 30): v86::rust::cpu::instructions_0f::instr_0F30 has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f64640bfb3b4482b760bea5667c41d7b2dcb2f07b176c3b1cf1fb26acf95134"}},{"ruleId":"D1","level":"warning","message":{"text":"filesystem.FS.Lock (cyclomatic 29): filesystem.FS.Lock has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8734e7e49d77dcc0e5388998d0de5b3f44de9321c959825482697c89dad16165"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::jit_instructions::gen_string_ins (cyclomatic 29): v86::rust::jit_instructions::gen_string_ins has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973fd4f02183f8f2b6796d69983cfcba9ea2cc4c1fa06e18a635a7c06872e8d"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_jit.gen_instruction_body_after_fixed_g (cyclomatic 26): generate_jit.gen_instruction_body_after_fixed_g has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69975002a08d9282e5e0534ba5e2c5af5d59fdaec4878993bdbd0e53810cd32"}},{"ruleId":"D1","level":"warning","message":{"text":"ne2k.Ne2k.receive (cyclomatic 26): ne2k.Ne2k.receive has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"442ed742b4948cae1e57a9f0b60444c991ba04696a63967cd1334ca54482be7f"}},{"ruleId":"D1","level":"warning","message":{"text":"ide.IDEChannel (cyclomatic 26): ide.IDEChannel has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 562, 590, 431, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e9fc70b94170419aa1da3c4e716798a25875e8f34c9186f5047935c68c2ad7"}},{"ruleId":"D1","level":"warning","message":{"text":"cpu.CPU.dump_page_directory (cyclomatic 26): cpu.CPU.dump_page_directory has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a056c12ae98b125b98234eda52e77ed8cbef31db4776f2e3001d61909802656"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::codegen::gen_test_be (cyclomatic 26): v86::rust::codegen::gen_test_be has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b471ceb34a690d8188072b2655aa15be2e50b16f1424c84c60448bb048995bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::instructions_0f::instr_0FA2 (cyclomatic 26): v86::rust::cpu::instructions_0f::instr_0FA2 has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: v86::rust::cpu::instructions_0f::instr_0F32 (cyclomatic 30) 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/rust/cpu/instructions_0f.rs"},"region":{"startLine":3256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb332f8b06b61bad1c8004015d139b12604a84844cdd56a9c989da079fba2f7"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::vga::svga_fill_pixel_buffer (cyclomatic 26): v86::rust::cpu::vga::svga_fill_pixel_buffer has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/vga.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"766073b3efb2296fe43ea7494c80007b4950d9d9a4716e4267e825c1f1a6c72f"}},{"ruleId":"D1","level":"warning","message":{"text":"SpeakerWorkletDAC (cyclomatic 25): SpeakerWorkletDAC has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 19 function items inside it that branch (worklet::prepare_next_buffer, worklet::process, worklet::DACProcessor::onmessage, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c0fc388c2103e0ae83391b43e9785130881b438b19197181183a3a1656f916"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch_network.on_data_http (cyclomatic 24): fetch_network.on_data_http has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fetch_network.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d96924691a94d9ae7d2999f9b31c9c7427539049a968305b7c8da317f6cf73"}},{"ruleId":"D1","level":"warning","message":{"text":"vmware.VMwareMouse.port_read32 (cyclomatic 24): vmware.VMwareMouse.port_read32 has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vmware.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5734516417808b5c5d63ed941ec2dca268e78a13b4e15c1ff4475a8b07ef41f"}},{"ruleId":"D1","level":"warning","message":{"text":"load_file (cyclomatic 24): load_file has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 7 function items inside it that branch (onload, retry, onreadystatechange, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.js"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eba680218a3df1f30560d279fdaf5a4e07a2cdde3cbca2d47c35eea8028cfcb"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::codegen::gen_condition_fn (cyclomatic 23): v86::rust::codegen::gen_condition_fn has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a53eb51ff3c5fd77c1d7864f299c57823595b1be7ee2ba87a4dd9cc28c91ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"filesystem.FS.Rename (cyclomatic 22): filesystem.FS.Rename has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed7b506bd543686ab5fc8f03cc9c8e4b0e0d7b621ea414c8f1bcc8992e1bf38"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::far_return (cyclomatic 22): v86::rust::cpu::cpu::far_return has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba42859059ffd21ef94b674a08f17493ce65d23d64c7f0f745453f26220ab44d"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_analyzer.gen_instruction_body_after_fixed_g (cyclomatic 21): generate_analyzer.gen_instruction_body_after_fixed_g 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":"gen/generate_analyzer.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c676105165f38c33ee2c5cda198ef92a914db8179462064d7083972c06b0832"}},{"ruleId":"D1","level":"warning","message":{"text":"print_stats.print_instruction_counts_offset (cyclomatic 20): print_stats.print_instruction_counts_offset 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/browser/print_stats.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f5ee65371ef5b67ccc33e9f32de1942bd653924fbc1e5e41aa22c0be767048"}},{"ruleId":"D1","level":"warning","message":{"text":"screen.ScreenAdapter (cyclomatic 20): screen.ScreenAdapter has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (screen.ScreenAdapter::render_font_bitmap, screen.ScreenAdapter::render_changed_rows) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2c732af86b6218ab25df063410f2a700fea6eb2872a206bb5ba80224f62b90"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::cycle_internal (cyclomatic 20): v86::rust::cpu::cpu::cycle_internal 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/rust/cpu/cpu.rs"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0613b793e5d990e44c63ac92ce20ca4d0759253490ed59a8c9486213caa866"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_analyzer.gen_read_imm_call (cyclomatic 19): generate_analyzer.gen_read_imm_call has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5db4195cb6135b9e5427811b68d101590a9755c7b1f0609882a8535aa996f4"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_interpreter.gen_read_imm_call (cyclomatic 19): generate_interpreter.gen_read_imm_call has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bf3519b03901510232859800a157be5c01a77ee3c621083afe62f32f0e1c99"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_interpreter.gen_instruction_body (cyclomatic 19): generate_interpreter.gen_instruction_body has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4776068e7c4e96043add031e7374c8961c3ad17a2d9c67dc8b5cacced1bfac"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_jit.gen_read_imm_call (cyclomatic 19): generate_jit.gen_read_imm_call has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acee30640feea2f470043bf1e5a229649bd75b4da4a058ff020988beb0c3bab"}},{"ruleId":"D1","level":"warning","message":{"text":"screen.ScreenAdapter::render_font_bitmap (cyclomatic 19): screen.ScreenAdapter::render_font_bitmap has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (screen.ScreenAdapter, screen.ScreenAdapter::render_changed_rows) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25239ca4786dcbb6ec22c4d49e8304adf9b6c1615a6f45a966375abccb19a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"starter.V86.wait_until_vga_screen_contains (cyclomatic 19): starter.V86.wait_until_vga_screen_contains has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2d6bdef80431431fa643d8b49d341a2a5f59be04f94c7f2d23da08a115cea"}},{"ruleId":"D1","level":"warning","message":{"text":"ide.IDEInterface.get_disk_geometry (cyclomatic 19): ide.IDEInterface.get_disk_geometry has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed67d76a8c5406ac25b4fa1bf7ad3e67d44a2583f098b2d81020148991ed4438"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::opstats::decode (cyclomatic 19): v86::rust::opstats::decode has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/opstats.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd623502169ee0c8c4760b455a6e4a0288d676852089305cd0a3451b5410b9a7"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_analyzer.gen_instruction_body (cyclomatic 18): generate_analyzer.gen_instruction_body has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53c9113b37fab80057dc48fe06d4c53c13ba6d0e7854f39e677d413c7241d57"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_jit.gen_instruction_body (cyclomatic 18): generate_jit.gen_instruction_body has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe147f4d846b425437a2d626b772dc59f8d047f3e8be904758efe6998125c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"virtio_console.VirtioConsole (cyclomatic 18): virtio_console.VirtioConsole has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 114, 218, 91, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74541532924887f86af71221f2770a0a2a40bcad3e7136f3e637c66278d80b3"}},{"ruleId":"D1","level":"warning","message":{"text":"vga.VGAScreen.port3C0_write (cyclomatic 18): vga.VGAScreen.port3C0_write has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: vga.VGAScreen.port3D5_read (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"db80d651717a5e74cedb6013ce3dfd5ef3aa9dfa42e116e194124c2658ae2f97"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::cpu::cpu::switch_seg (cyclomatic 18): v86::rust::cpu::cpu::switch_seg 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/rust/cpu/cpu.rs"},"region":{"startLine":2676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f91c1d599cbb368fc6bfb7870bca46682e46d63aa154aa7c1632d62fc6b6d85"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::jit::jit_dirty_page_ctx (cyclomatic 18): v86::rust::jit::jit_dirty_page_ctx has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2171bec8ecb65ca7f91c2f1f93a99b976d1c2a418296a2046c066e5c937dd7ab"}},{"ruleId":"D1","level":"warning","message":{"text":"screen.ScreenAdapter::render_changed_rows (cyclomatic 17): screen.ScreenAdapter::render_changed_rows has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (screen.ScreenAdapter, screen.ScreenAdapter::render_font_bitmap) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82615af907430a3eb5d5a4252693a3b41430d35514fc22007679abbc2c7e142"}},{"ruleId":"D1","level":"warning","message":{"text":"modem.Modem.cli_exec_dial (cyclomatic 17): modem.Modem.cli_exec_dial has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b722cb58c0632664a12e8b5e5ef56779834550853a431697016e558d12a19d"}},{"ruleId":"D1","level":"warning","message":{"text":"floppy.FloppyController.start_read_write (cyclomatic 17): floppy.FloppyController.start_read_write has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ffee9c9f94c1a5ad9e6fd81e651523a5a75dd8b68fc444bcd73f9e86a35400"}},{"ruleId":"D1","level":"warning","message":{"text":"iso9660.generate (cyclomatic 17): iso9660.generate has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 6 function items inside it that branch (write_volume_descriptor, write_record, write_root_directory, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87a761760eee2efd1a934eeadc4258db03c619b9fadcc8540d3111be4b3a20b"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::codegen::gen_safe_write (cyclomatic 17): v86::rust::codegen::gen_safe_write has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd46dab3218ccce393be82601d86fce2ed54fa7879846d512f8548044e42026b"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_interpreter.gen_instruction_body_after_fixed_g (cyclomatic 16): generate_interpreter.gen_instruction_body_after_fixed_g 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":"gen/generate_interpreter.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2fa217f43fac6564ac123e0e74cfca3ccdb9bdf1de4bd684026b390aa2ce6d"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboard.KeyboardAdapter::handler (cyclomatic 16): keyboard.KeyboardAdapter::handler 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/browser/keyboard.js"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4b681bf356292fe6172e4f19b41fb59616a65fd52bad55437935c3b45d6474"}},{"ruleId":"D1","level":"warning","message":{"text":"modem.Modem.cli_translate_dial_address (cyclomatic 16): modem.Modem.cli_translate_dial_address has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a6621eca1b162bf659fe8285d5e846b55919e40aab3156b4a898e71c92eced"}},{"ruleId":"D1","level":"warning","message":{"text":"starter.V86.continue_init::done (cyclomatic 16): starter.V86.continue_init::done has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (starter.V86.continue_init) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb2a28d831b37b8064464fbb739a1a30ad7713bc03096f73998c0f5805bffae"}},{"ruleId":"D1","level":"warning","message":{"text":"uart.UART (cyclomatic 16): uart.UART has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 154, 175, 218, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bf6d41a1b97d5322e0311518056d33a93c711126e4518fb28ea9116bd189d4"}},{"ruleId":"D1","level":"warning","message":{"text":"floppy.FloppyDrive.find_disk_format (cyclomatic 16): floppy.FloppyDrive.find_disk_format 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/floppy.js"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"79113614bdbb9e6587ff12a43fbde6314912179720e245122de51f0008eedf9f"}},{"ruleId":"D1","level":"warning","message":{"text":"vga.VGAScreen.vga_memory_read (cyclomatic 16): vga.VGAScreen.vga_memory_read has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: vga.VGAScreen.port3D5_read (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c41b380ba533b551480ae73c6fc98f77c1a9fdf323d699607fc2661e145652"}},{"ruleId":"D1","level":"warning","message":{"text":"fs2json.handle_dir (cyclomatic 16): fs2json.handle_dir 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":"tools/fs2json.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f006d26490e3fe52e28990445caab37dd0c67d065e90760902fcfebe8f795b60"}},{"ruleId":"D1","level":"warning","message":{"text":"v86::rust::codegen::gen_getcf (cyclomatic 16): v86::rust::codegen::gen_getcf 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/rust/codegen.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"013940ca9d72656d37778f5e016155b748bc87361d689dae905ffca958af44a0"}},{"ruleId":"D1","level":"warning","message":{"text":"codegen_finalize (cyclomatic 16): codegen_finalize has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"143998650d3abe6bb440b2ba4fb20ea527654fde91fdc3fa1e81723c3e9190aa"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::jit::jit_generate_module (cognitive 318): v86::rust::jit::jit_generate_module has cognitive complexity 318 (threshold 15). Drivers by points: if/else 77 (261 pts), loops 17 (43 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 218). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"113615fb7d4f8098fca9a9c877167a57b0287cbbbee08e93c1663edd259640a7"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::far_jump (cognitive 167): v86::rust::cpu::cpu::far_jump has cognitive complexity 167 (threshold 15). Drivers by points: if/else 57 (138 pts), loops 2 (12 pts), boolean chains 9, match/switch 3 (8 pts) (nesting depth added 96). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b085861455e90ba929a2c4686023a039bf8dcc7d0cda48e30dcaa5979731f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"start_emulation (cognitive 165): start_emulation has cognitive complexity 165 (threshold 15). Drivers by points: if/else 65 (125 pts), boolean chains 26, ternaries 6 (14 pts) (nesting depth added 68). Of this number, 150 points are the body\u0027s own statements and 15 belong to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c527221f7bc320e645a98b4e9bcde35263b4c519e5cc0b6823d4d2ff913f7"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::string::string_instruction (cognitive 146): v86::rust::cpu::string::string_instruction has cognitive complexity 146 (threshold 15). Drivers by points: match/switch 45 (75 pts), if/else 24 (49 pts), boolean chains 18, loops 2 (4 pts) (nesting depth added 57). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/rust/cpu/string.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d855d6115fd421ed4dcf1a0a98c5b0c0ba230baa7bc7631d684a860d1d52074"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::do_page_walk (cognitive 141): v86::rust::cpu::cpu::do_page_walk has cognitive complexity 141 (threshold 15). Drivers by points: if/else 57 (121 pts), boolean chains 18, loops 1 (2 pts) (nesting depth added 65). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"df98c6581d324f7380edb1c257c453c63c6443b4c90ebbefde717f62c42ac511"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::call_interrupt_vector (cognitive 116): v86::rust::cpu::cpu::call_interrupt_vector has cognitive complexity 116 (threshold 15). Drivers by points: if/else 49 (100 pts), boolean chains 11, match/switch 2 (5 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f925abf97cdeaa7429a5ae3dbbc496b2b8b6858e3cffe6095c178f854404a7f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Ne2k (cognitive 103): Ne2k has cognitive complexity 103 (threshold 15). Drivers by points: if/else 95 (98 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 6 of the 103 points are its own statements and the rest belongs to 37 function literals inside it that branch (lines 406, 585, 512, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1236ebd1c5e7e7378b7740373d464e18807caf0d94f5d569c3f82fef8cf56cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"9p.Virtio9p.ReceiveRequest (cognitive 98): 9p.Virtio9p.ReceiveRequest has cognitive complexity 98 (threshold 15). Drivers by points: if/else 41 (81 pts), loops 3 (7 pts), ternaries 3 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 47). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a49f6cc276938041064f66566fd963ac66ae1eabc6902720be9420972a80ebb"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::jit::jit_find_basic_blocks (cognitive 88): v86::rust::jit::jit_find_basic_blocks has cognitive complexity 88 (threshold 15). Drivers by points: if/else 33 (82 pts), match/switch 5 (11 pts), loops 7 (10 pts), boolean chains 3 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (v86::rust::jit::jit_find_basic_blocks::follow_jump) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8fd75bfa1bde71db446decdf676f0aec57b627437f2c03ccbfbad98217977e"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::codegen::gen_test_le (cognitive 85): v86::rust::codegen::gen_test_le has cognitive complexity 85 (threshold 15). Drivers by points: if/else 31 (71 pts), boolean chains 7, match/switch 4 (7 pts) (nesting depth added 43). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bd57a0e8310fbe42bb4c91282fa585a85dd570c79a416948a3823f49536c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"init_ui (cognitive 84): init_ui has cognitive complexity 84 (threshold 15). Drivers by points: if/else 48 (50 pts), ternaries 19, boolean chains 10, loops 2 (3 pts), error handling 2 (nesting depth added 3). Most of this is not in the body itself: 9 of the 84 points are its own statements and the rest belongs to 71 function items inside it that branch (enable_theatre_mode, insert_cdrom, enable_theatre_ui, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a0a842d1154703afb2424d3025b51bd84e206575b1e02b98328140ea8e78e8"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::codegen::gen_test_l (cognitive 83): v86::rust::codegen::gen_test_l has cognitive complexity 83 (threshold 15). Drivers by points: if/else 30 (69 pts), boolean chains 7, match/switch 4 (7 pts) (nesting depth added 42). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c501642df2659a4b3b8cafd50efec683c595f59b378a70bd50ff94dc00ee940"}},{"ruleId":"D2","level":"warning","message":{"text":"load_multiboot_option_rom (cognitive 79): load_multiboot_option_rom has cognitive complexity 79 (threshold 15). Drivers by points: if/else 26 (59 pts), loops 6 (13 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 42). Most of this is not in the body itself: 13 of the 79 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 1360, handle_write, a function literal at line 1360, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"3984100b1acb057c77c2db8981831c0e3ddee0a05988af71fd2b72f5f4b66965"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::jit_instructions::gen_string_ins (cognitive 71): v86::rust::jit_instructions::gen_string_ins has cognitive complexity 71 (threshold 15). Drivers by points: if/else 39 (68 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aa7e05f74a2a80d04b0f0bf579d9f29ea4aed42fc63c60d156fc7af7fac732"}},{"ruleId":"D2","level":"warning","message":{"text":"onload (cognitive 71): onload has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (46 pts), loops 9 (12 pts), ternaries 5 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 19). Of this number, 44 points are the body\u0027s own statements and 27 belong to 43 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e961cf1667fe7729c10569e8fb4de31b3542c9a4595b9591ade25f596b777f"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::iret (cognitive 70): v86::rust::cpu::cpu::iret has cognitive complexity 70 (threshold 15). Drivers by points: if/else 36 (55 pts), boolean chains 10, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b8c3bacd186f69aa463007f029bdbbb6cd23a0cbda3e05040de6d7158d0f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"modem.Modem.cli_exec (cognitive 69): modem.Modem.cli_exec has cognitive complexity 69 (threshold 15). Drivers by points: if/else 31 (56 pts), boolean chains 8, loops 2, match/switch 1 (2 pts), ternaries 1 (nesting depth added 26). Of this number, 63 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfd5e5e4d92c0248ee41ca9ebf7a1c5746fd20eecd6b2fbc80d969e7a3f6bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"cpu.CPU.init (cognitive 63): cpu.CPU.init has cognitive complexity 63 (threshold 15). Drivers by points: if/else 36 (51 pts), boolean chains 6, loops 2 (5 pts), ternaries 1 (nesting depth added 18). Of this number, 43 points are the body\u0027s own statements and 20 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"0280ef3d1d1c13621d4a4bf494166b8ad66d1a648e3e3116ef6c2869acbfeacf"}},{"ruleId":"D2","level":"warning","message":{"text":"starter.V86.continue_init (cognitive 56): starter.V86.continue_init has cognitive complexity 56 (threshold 15). Drivers by points: if/else 50 (62 pts), boolean chains 27, ternaries 5 (9 pts), match/switch 2 (3 pts) (nesting depth added 17). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43863e96956737a6de5464e2be46ab049831a2e031eb3ff8024352a47cbb95f"}},{"ruleId":"D2","level":"warning","message":{"text":"dump_page_directory (cognitive 56): dump_page_directory has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 15 (39 pts), if/else 9 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 29). Of this number, 49 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f53184bde3b5466974a71ae9b448ebf0a44f73222f3d182b0f1a157db3d0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"MouseAdapter (cognitive 56): MouseAdapter has cognitive complexity 56 (threshold 15). Drivers by points: if/else 34 (40 pts), boolean chains 13, ternaries 1 (2 pts), loops 1 (nesting depth added 7). None of this is in the body itself: all 56 points belong to 18 function items inside it that branch (may_handle, mousemove_handler, update_cursor, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/mouse.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b75ea2eee4330007423fa50b33b1a44e31217c9c23206d0a76f7c4a205df854"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyboardAdapter (cognitive 54): KeyboardAdapter has cognitive complexity 54 (threshold 15). Drivers by points: if/else 31 (39 pts), boolean chains 11, loops 2 (3 pts), match/switch 1 (nesting depth added 9). None of this is in the body itself: all 54 points belong to 15 function items inside it that branch (handler, handle_code, may_handle, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/keyboard.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e6d6ddf256eee939cb3e24d4baf558cf7b6fd317870045913e127b27282757"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::codegen::gen_test_be (cognitive 53): v86::rust::codegen::gen_test_be has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (42 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"d635dbafa2bd20d44cbac5cd38b69affc90bed21ede08650d2b72dbb032dad24"}},{"ruleId":"D2","level":"warning","message":{"text":"port60_write (cognitive 51): port60_write has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (41 pts), match/switch 3 (6 pts), ternaries 1 (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/ps2.js"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e893e4a34a49686b2293720d731e75d954000fa0062fb191181a19e93da41ee"}},{"ruleId":"D2","level":"warning","message":{"text":"fake_network.TCPConnection.process (cognitive 48): fake_network.TCPConnection.process has cognitive complexity 48 (threshold 15). Drivers by points: if/else 29 (43 pts), boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9f598f3e781db919a5f57a8575cdfc2fc52dbc9afeee63f114ff879921ecdc"}},{"ruleId":"D2","level":"warning","message":{"text":"filesystem.FS.Lock (cognitive 46): filesystem.FS.Lock has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087beeed3d9df2babf825549209d17620ad59200ebb7ddb7ffa68b3e82fa3be"}},{"ruleId":"D2","level":"warning","message":{"text":"vga.VGAScreen.port3C0_write (cognitive 46): vga.VGAScreen.port3C0_write has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (41 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba845f35d0ee912ba9c136313182909d89a64aeee26113711b4fb063c4e31bff"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::vga::svga_fill_pixel_buffer (cognitive 46): v86::rust::cpu::vga::svga_fill_pixel_buffer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 5 (9 pts), boolean chains 8, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/vga.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df09b6d244a7f37e21dfcdaf68bd579099ba90a1054ed121ca164735603d95e"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_jit.gen_instruction_body_after_fixed_g (cognitive 45): generate_jit.gen_instruction_body_after_fixed_g has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b625f20e2d023f6b66cf76965f19e26735da756797521e7256e1fe1fea69fc"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::cycle_internal (cognitive 44): v86::rust::cpu::cpu::cycle_internal has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (37 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcce46d9975a1a6414eee8c9110ed0080b0d1c90ff069758aa3fe7be7cea059"}},{"ruleId":"D2","level":"warning","message":{"text":"atapi_handle (cognitive 44): atapi_handle has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (25 pts), ternaries 7 (12 pts), boolean chains 6, match/switch 1 (nesting depth added 12). Of this number, 41 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"736013cb1b74d73cf34546f16cf94b00b69cb8134a120ee69974476b9ad3172d"}},{"ruleId":"D2","level":"warning","message":{"text":"ne2k.translate_mac_address (cognitive 43): ne2k.translate_mac_address has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 6, loops 1 (4 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d425d674fcf712283c2cd03a4b932edd804ceea713d2bec15d5f8732a0c7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"vga.VGAScreen.port3D5_write (cognitive 43): vga.VGAScreen.port3D5_write has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 1, match/switch 1 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccbf349de2728f4f5034c556f66adaa0924652adc4a9bfd31750b96e2e1ba18"}},{"ruleId":"D2","level":"warning","message":{"text":"set_state (cognitive 42): set_state has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 28, if/else 11 (12 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2060360934e652d345b311fd0caf919b3bea13f64b84cfb59d92b60d74b98a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::do_task_switch (cognitive 41): v86::rust::cpu::cpu::do_task_switch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25 (32 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dcb8305c4f1a68466720ab144704b0f006553198e8bc83db1dcf19f2221049"}},{"ruleId":"D2","level":"warning","message":{"text":"ide.IDEInterface.ata_command (cognitive 39): ide.IDEInterface.ata_command has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (30 pts), ternaries 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f754e0609feba906c8a0a86122cbe6f0dbb774334f1615a1e923ecc46b3e8105"}},{"ruleId":"D2","level":"warning","message":{"text":"port1CF_write (cognitive 39): port1CF_write has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 13, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8612e0a3d77d0c581e069ada8faf1eba754882522394fcbf7d639f7c0de372a9"}},{"ruleId":"D2","level":"warning","message":{"text":"pci_write32 (cognitive 38): pci_write32 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (35 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pci.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d995ff5574f239fbee80725d01c5166454d0cfe5b31bfc1f49bef7ff387ec00"}},{"ruleId":"D2","level":"warning","message":{"text":"virtio.VirtIO.create_common_capability (cognitive 37): virtio.VirtIO.create_common_capability has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24 (26 pts), ternaries 6, boolean chains 5 (nesting depth added 2). None of this is in the body itself: all 37 points belong to 19 function literals inside it that branch (lines 399, 518, 478, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8523a1b18f5ed200b913e18af55fbe9d24d10fa7e6f6be3233d71d418df81027"}},{"ruleId":"D2","level":"warning","message":{"text":"filesystem.FS.Rename (cognitive 36): filesystem.FS.Rename has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 5, loops 1 (3 pts), ternaries 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":"lib/filesystem.js"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4c293f97105d5e7431061cdcf055165164db8136514ff0ab2579afcf819451"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_analyzer.gen_instruction_body_after_fixed_g (cognitive 35): generate_analyzer.gen_instruction_body_after_fixed_g has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4183c9a7deede68fcee71cc8b3e0abfd1f3eb306f7d095a86136900ad6812a3"}},{"ruleId":"D2","level":"warning","message":{"text":"print_stats.print_instruction_counts_offset (cognitive 34): print_stats.print_instruction_counts_offset has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 8 (11 pts), ternaries 5 (11 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/browser/print_stats.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d60d6c5ff7cc92100aa5235b98a9c8a0d7a310deb1e5064e78542646bcf8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"starter.V86.wait_until_vga_screen_contains (cognitive 33): starter.V86.wait_until_vga_screen_contains has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (11 pts), boolean chains 4, ternaries 2 (nesting depth added 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0833154271cc084cc06d72b1a7aaa9c1a701b8524459be8b303c151ada73b13c"}},{"ruleId":"D2","level":"warning","message":{"text":"screen.ScreenAdapter::render_changed_rows (cognitive 32): screen.ScreenAdapter::render_changed_rows has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (screen.ScreenAdapter) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f2de18c2c8f0cb14f473725e0f375c3702ee31c0bc530eac4aa89a18ba9172"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_network.on_data_http (cognitive 31): fetch_network.on_data_http has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fetch_network.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"429d61e1f37671ba08b133e4b0419fb90b5768fdfbfb044548ec6df12d1585e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ide.IDEChannel (cognitive 31): ide.IDEChannel has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (19 pts), ternaries 4 (8 pts), boolean chains 4 (nesting depth added 5). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 562, 590, 431, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"27edbb0c434ec6c36aa0e6300f590655a2558a82b69dd6f5830ac54678d9fb26"}},{"ruleId":"D2","level":"warning","message":{"text":"fs2json.handle_dir (cognitive 31): fs2json.handle_dir has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (10 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fs2json.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbea63e2217a8bc5b254ce4fb81445376ec5f47b37568787b862ca96d0e4b44"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::far_return (cognitive 31): v86::rust::cpu::cpu::far_return has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcacdeaeba062844a2ee5adf6ff629ba47bdddda530f249cd009c86d788915d"}},{"ruleId":"D2","level":"warning","message":{"text":"codegen_finalize (cognitive 30): codegen_finalize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (4 pts), ternaries 1 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"7051e39d9527cfa9bfd34a6544a5bde21297cca7511c52ef63ef45fc087d3d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenAdapter::render_font_bitmap (cognitive 30): ScreenAdapter::render_font_bitmap has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 5 (9 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d5a4b83d26b1e0801234cefc8543e78527fcef9a07b85b6e79ae4afc97d62d"}},{"ruleId":"D2","level":"warning","message":{"text":"vga_memory_read (cognitive 29): vga_memory_read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 4 (12 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce80eea994b5f5456e518eb28e0ae46fa9f71606d3445fbdf957e9e1ab5629d"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_interpreter.gen_instruction_body_after_fixed_g (cognitive 28): generate_interpreter.gen_instruction_body_after_fixed_g has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"20da8bb92f704ddabb987bf0fa46e016286965d6f8a7fc6bf642e49d7c5a7597"}},{"ruleId":"D2","level":"warning","message":{"text":"find_disk_format (cognitive 28): find_disk_format has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 2 (8 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cdc24669cdee3de151b35c1f045a15bb28396e2d8b73d4fdc5ea786c94cbfe"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer.AsyncXHRPartfileBuffer.get (cognitive 27): buffer.AsyncXHRPartfileBuffer.get has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 15). Of this number, 19 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/buffer.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"06671ddb069d62ac7df99650cc65ca5c06dc1fecee0cc5559e4242cf6e75850e"}},{"ruleId":"D2","level":"warning","message":{"text":"filesystem.FS.Check (cognitive 27): filesystem.FS.Check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (8 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":"lib/filesystem.js"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e196d11d8fc4f1216eab829625eaaac1ab5bc23dfc1a89c6f648a9c0bcf57ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ide.IDEInterface.get_disk_geometry (cognitive 27): ide.IDEInterface.get_disk_geometry has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 1 (2 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcac3da62102f34bf0f8af0e58ec1e802c785d2697c3d46e02d4c15ab1dc589"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::opstats::decode (cognitive 27): v86::rust::opstats::decode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, match/switch 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/opstats.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1459ba041d5ec9a97db196bea6ea8eae92ae097f0c8ca085dd3ddbba4d967ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtioBalloon (cognitive 27): VirtioBalloon has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (7 pts), ternaries 1 (2 pts) (nesting depth added 15). None of this is in the body itself: all 27 points belong to 10 function items inside it that branch (a function literal at line 112, a function literal at line 95, a function literal at line 80, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_balloon.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6330dac66777b64b795c2437621669be9dda4724bae1b2d70be894cd7edce2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli_translate_dial_address (cognitive 27): cli_translate_dial_address has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (11 pts), boolean chains 2 (nesting depth added 15). Of this number, 20 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5dbb59cb33a2fb8a9de554bbd121a3a020242e529d81161ee6f0a9171cb21a"}},{"ruleId":"D2","level":"warning","message":{"text":"SpeakerWorkletDAC (cognitive 27): SpeakerWorkletDAC has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (15 pts), loops 4 (7 pts), boolean chains 3, match/switch 2 (nesting depth added 4). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 19 function items inside it that branch (worklet::prepare_next_buffer, worklet::process, worklet::get_sample, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2267c167dfda9a94e464685ba64bf9a2144beb45f63163d421db0cfd1d470ba"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::apic::write32_internal (cognitive 25): v86::rust::cpu::apic::write32_internal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/apic.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c058117c4db9b3d101df10a1a024964405e73fba96256ddaaf3fc3df009a02"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtioConsole (cognitive 25): VirtioConsole has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 pts), ternaries 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 114, a function literal at line 218, a function literal at line 91, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc514608234fc5b46386435be69cb904cbb89753dde18bc84bb9306398b2affb"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_interpreter.gen_instruction_body (cognitive 24): generate_interpreter.gen_instruction_body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a9c0abf4171c63f382b80865b824b30af642312ce5458569476792e43ccb66"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::switch_seg (cognitive 24): v86::rust::cpu::cpu::switch_seg has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":2676}}}],"partialFingerprints":{"codehealthFindingId/v1":"312d5fc6c99a456e2ce0ef28686c937e3a0538e76eec131af449675db1302f19"}},{"ruleId":"D2","level":"warning","message":{"text":"IDEController (cognitive 24): IDEController has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14720f0f0fb9500e014856808533c202687c4e4595b6add4fd9a54561e80e50"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_analyzer.gen_read_imm_call (cognitive 23): generate_analyzer.gen_read_imm_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d463729962059048c4e8af8b8310d5a14c21496852c6c77997f64ecfb4e5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_interpreter.gen_read_imm_call (cognitive 23): generate_interpreter.gen_read_imm_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcab6ee70b2251e1e01bbc63eff54ab42eae36a75ffc09d36a4e90f73fdf6c09"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_jit.gen_read_imm_call (cognitive 23): generate_jit.gen_read_imm_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c606d596c1f4fe8282fa958511a75846b640bcce955636846e5c31c41128d6"}},{"ruleId":"D2","level":"warning","message":{"text":"fs2json.handle_tar (cognitive 23): fs2json.handle_tar has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (8 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fs2json.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7812bf69879ed053094455d6deb8bd4bfc95bedf4249e5c8b2c4f1d467092c"}},{"ruleId":"D2","level":"warning","message":{"text":"Pic::port0_write (cognitive 23): Pic::port0_write has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (23 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/rust/cpu/pic.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2428ac407c68e2d1238019cf0853c56715dadec0d174eb65a11efea4e348f403"}},{"ruleId":"D2","level":"warning","message":{"text":"start_read_write (cognitive 23): start_read_write has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7162160000ffd5d54464831954126075719eea828a1e43789c9cb6281d021b"}},{"ruleId":"D2","level":"warning","message":{"text":"receive (cognitive 23): receive has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 8, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d6bb2dff83aa03d96d4b3715a86a5e5b9e9aa1b3cd133cc15b497837e58435"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_analyzer.gen_instruction_body (cognitive 22): generate_analyzer.gen_instruction_body has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1e67c36bd582ca757495db48f91b8fd9fea2dad7dd8b2b51fc4e2edbc3e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_jit.gen_instruction_body (cognitive 22): generate_jit.gen_instruction_body has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28db61349378062b3ea2dadb4b0b4055d164910ea7f6074271a3ae38382d82c"}},{"ruleId":"D2","level":"warning","message":{"text":"vmware.VMwareMouse.port_read32 (cognitive 22): vmware.VMwareMouse.port_read32 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vmware.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"875705740df181d70fa5e1d0cfaf747418e62c22433d3e19d6b20b6ac7bf0815"}},{"ruleId":"D2","level":"warning","message":{"text":"ide.IDEInterface.read_end (cognitive 22): ide.IDEInterface.read_end has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"1429f887593cc78288bfbbe55378ddbfb73bdca416444ea88e32172e9d4a73c5"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::control_flow::blockify (cognitive 22): v86::rust::control_flow::blockify has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (11 pts), loops 4 (6 pts), if/else 2 (5 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/control_flow.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e77c85a84ae19577925862d71b13e091badd130768664a821afad5c42c4eb6"}},{"ruleId":"D2","level":"warning","message":{"text":"set_disk_buffer (cognitive 22): set_disk_buffer has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 8 (10 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cb15ba6b8e32c248606a54d2007e704b479c5a34c938d23676772e8efdc6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"generate (cognitive 22): generate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 7 (8 pts), loops 3 (nesting depth added 2). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 26 function items inside it that branch (write_volume_descriptor, write_record, write_root_directory, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfa1b3a89a0954891f11b9547db381197ce4189a7b5bb584190e372fde46375"}},{"ruleId":"D2","level":"warning","message":{"text":"continue_init::done (cognitive 22): continue_init::done has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"55361fff709ebca0ba7cd0f8ad077c5a3e3fd337ab6de950464a5c01f21bafed"}},{"ruleId":"D2","level":"warning","message":{"text":"modem.Modem.cli_exec_dial (cognitive 21): modem.Modem.cli_exec_dial has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 1 (2 pts), error handling 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 10 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"349e65f6d8fecd71f8c9059f87d70cd7d776504d2e66652bdd8a9a2f99abd9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"cpu.CPU.dump_gdt_ldt::dump_table (cognitive 21): cpu.CPU.dump_gdt_ldt::dump_table has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b1d8e6756e7a4b2787bd0f143c427d2f81f72c488c23007f59ca697217cb21"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::apic::read32_internal (cognitive 21): v86::rust::cpu::apic::read32_internal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/apic.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6368ad78743b54fbbc0c78bacb0cbf0615d566f20756257cfd0bbb563165fcbf"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::instructions_0f::instr_0FA2 (cognitive 21): v86::rust::cpu::instructions_0f::instr_0FA2 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":3256}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e604bff810c31d7aedf0594c39cf11bcd43f6e2a8621b0a3df40c8ef4bd368"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::modrm::resolve_modrm32_ (cognitive 21): v86::rust::cpu::modrm::resolve_modrm32_ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (21 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/rust/cpu/modrm.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"833a760e73923209a8b89036f57edcc9b200237740bcd155a21992c72f170ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"state.restore_state (cognitive 20): state.restore_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b0ff2545950def6421bf8cc78712dc7802116547135ba6499eb45ba85de96b"}},{"ruleId":"D2","level":"warning","message":{"text":"vga.VGAScreen.vga_replot (cognitive 20): vga.VGAScreen.vga_replot has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7155ac08b91037055b835eac1528aeee8f8e045f56a6fedb5807c7baf1eb15ec"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::apic::timer (cognitive 20): v86::rust::cpu::apic::timer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 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/rust/cpu/apic.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"469143f8cfce6db5aedb559c0a99a438dc6e447036c19d1ddf4a02053350fc5b"}},{"ruleId":"D2","level":"warning","message":{"text":"create_common_capability::write (cognitive 20): create_common_capability::write has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 7 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de4fea1d20301c4d4b12f5eaf365a20540088a80fd4609fd1426f681e5bd90f"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtQueueBufferChain (cognitive 20): VirtQueueBufferChain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5359f6f54593bb5ea89a9af6452adbaeb3dce6a3e353e198b5a3287cd9cbd51a"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_ast.print_syntax_tree (cognitive 19): rust_ast.print_syntax_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/rust_ast.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6e2d3515df36075b2f410dc77368391073eeb6432306f4de2e2b4c1a7da2be"}},{"ruleId":"D2","level":"warning","message":{"text":"screen.ScreenAdapter (cognitive 19): screen.ScreenAdapter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 27 (50 pts), boolean chains 26, ternaries 7 (15 pts), loops 7 (12 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (screen.ScreenAdapter::render_changed_rows) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"972a3c1cb46d335bb911fd0be7c236ec1b1921539ee000402402db44b444f78e"}},{"ruleId":"D2","level":"warning","message":{"text":"uart.UART (cognitive 19): uart.UART has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 175, 154, 206, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3ddfe76c4896a7bd33b60fde19cb00278cac6c77914f8f5c4d78401245461b"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::codegen::gen_getzf (cognitive 19): v86::rust::codegen::gen_getzf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1379380d9a3c24e5b39fb63cb8e5924a5ab8cf9b6eb57958f7c21ee89666430f"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::codegen::gen_getcf (cognitive 19): v86::rust::codegen::gen_getcf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (4 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a485e2703dbb0c8096d52897f1e01907f061b37a1a5ecb0883896f0dfc0cbe6"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::test_privileges_for_io (cognitive 19): v86::rust::cpu::cpu::test_privileges_for_io has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f9f628d537fd334a0dd36e3cfc3aeca4c5ea39d257de4a951425ec19213822"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::jit::jit_dirty_page_ctx::free (cognitive 19): v86::rust::jit::jit_dirty_page_ctx::free has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (4 pts), loops 2, 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/rust/jit.rs"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4112edf2bab1394fbb2d8e7a5f620187bc253089ab0dc059120af473ef434477"}},{"ruleId":"D2","level":"warning","message":{"text":"load_file::onload (cognitive 19): load_file::onload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.js"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bf40a837c4f917deaf959c7021f8eb58d4a67bb0991a4d5513c8a21143689c"}},{"ruleId":"D2","level":"warning","message":{"text":"init_capabilities (cognitive 19): init_capabilities has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), match/switch 1 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"755969d00ec8f4d963789f1400e3a02eea0b5e44a55c80edddf0cce4e2162387"}},{"ruleId":"D2","level":"warning","message":{"text":"TextAreaAdapter (cognitive 19): TextAreaAdapter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 1 (nesting depth added 3). None of this is in the body itself: all 19 points belong to 12 function items inside it that branch (update, show_char, keydown_handler, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/serial.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a8cda4118a07abcf863d9be0653283603e44be4ca39751e421b7c7bed11d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_analyzer.gen_table (cognitive 18): generate_analyzer.gen_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5304053ad0d4b53384d2a78cc6102f2e7af6beaf71f47db72faef3ab3fe8c634"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_interpreter.gen_table (cognitive 18): generate_interpreter.gen_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ebdecbb7787d2335711a6123b5047430866bc2aae0c4b58b9e740a4e321e19"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_jit.gen_table (cognitive 18): generate_jit.gen_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb715799acd29d90d4ffeb6c25e795b90d8c516a7ee11bd3b5d218b63b7c5b60"}},{"ruleId":"D2","level":"warning","message":{"text":"floppy.FloppyController.write_reg_fifo (cognitive 18): floppy.FloppyController.write_reg_fifo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee4a869c06681860b094c693ee7dc4c3c854ae8088952f3e4f4c207a31df4b"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::codegen::gen_safe_read_write (cognitive 18): v86::rust::codegen::gen_safe_read_write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 8 (9 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e7f7cfe19c4d52e388e709da41c126198206a23b134bc349077bdb9529bcad"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::jit::jit_find_basic_blocks::follow_jump (cognitive 18): v86::rust::jit::jit_find_basic_blocks::follow_jump has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (v86::rust::jit::jit_find_basic_blocks) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"01145db15f7eac5061aec3374a3ba99ad4024af059e8b935ebe67e3df0ee1593"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::modrm::gen (cognitive 18): v86::rust::modrm::gen has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/modrm.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5489817b1a5e09714c029c3c430f35bde9be10d10dcb726d6c32e4cd8bd7cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenAdapter::elem_set_scale (cognitive 18): ScreenAdapter::elem_set_scale has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec2d17d982d9a54dbe3daeb6a7136aac14be6967fcae9139dadc0752c3367fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ide.IDEInterface.read_data (cognitive 17): ide.IDEInterface.read_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 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/ide.js"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c6b6856dc91d14de1b02cec521c45a4d426cac0e5079d7343d3602fa484eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::codegen::gen_getsf (cognitive 17): v86::rust::codegen::gen_getsf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ded02c33440235708dfdba105451a7dd7b9d7fe76710122535e2afa5c942af5"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::control_flow::loopify (cognitive 17): v86::rust::control_flow::loopify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/control_flow.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f84aa3c99bb35e9c44117dbd5208d489f7fd34810eaca701d9882481c3ef8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::cpu::safe_read_slow_jit (cognitive 17): v86::rust::cpu::cpu::safe_read_slow_jit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (5 pts), loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":3661}}}],"partialFingerprints":{"codehealthFindingId/v1":"9546e83dd7a79b43343bb0df5538a3a999dbe4415e553f86138c56859639451a"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::cpu::fpu::fpu_fprem (cognitive 17): v86::rust::cpu::fpu::fpu_fprem has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb959ef5b61ee520992542743448aa2adebe6ba263dc8aa742614063c3add23"}},{"ruleId":"D2","level":"warning","message":{"text":"v86::rust::jit::jit_analyze_and_generate (cognitive 17): v86::rust::jit::jit_analyze_and_generate has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 6 (7 pts), match/switch 2 (nesting depth added 3). 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/rust/jit.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbc536826dacf1b89a6515e1bb1531ec77acb4977ff0d5e7aa13546e5c1e5f7"}},{"ruleId":"D2","level":"warning","message":{"text":"starter.V86.get_bzimage_initrd_from_filesystem (cognitive 16): starter.V86.get_bzimage_initrd_from_filesystem has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 3 (5 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed6f338a6effa97ca5c1217a9da2a8fb53e36512f316e1ea21fe2116a2546ba"}},{"ruleId":"D2","level":"warning","message":{"text":"pci.PCI.set_state (cognitive 16): pci.PCI.set_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pci.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de0a5f1ab3816e843d0d8bd38e3940bcc8d7993ff22b4d60258a4c44fe6cce0"}},{"ruleId":"D2","level":"warning","message":{"text":"ide.IDEInterface.write_data_port (cognitive 16): ide.IDEInterface.write_data_port has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15790ff01af6d106f7200dcb41cf85492e7acac2baf8606a2856a1c6cd6add7"}},{"ruleId":"D2","level":"warning","message":{"text":"do_atapi_dma (cognitive 16): do_atapi_dma has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da0da809c3406507c856022db03bca55392450eee55ef5596c5ac646840c865"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 3 function items inside it that branch (dbg_log_, a function literal at line 44, a function literal at line 48). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1937cc6e24291b80dc0e6acd1e17dc7b45d76a1626b5b4bb240e8b7b467272e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.onload: FunctionTooLong \u2014 onload runs 1300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1200 over it, 13.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e481c533b566a5a8611ba942a5f2c12952d03610df7ac38a5492147ff627f89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/jit_instructions.rs: FileTooLong \u2014 5700 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 1748 free functions. The bar is 500 significant lines; this is 5200 over it, 11.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d519eb05cbad79954ba00a5eb64c428b4118ae5e318835be030aa371db5889fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/instructions_0f.rs: FileTooLong \u2014 3701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 1166 free functions. The bar is 500 significant lines; this is 3201 over it, 7.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af59eca2e32a1c657d3233409e74f811a59a72327a2461a5082c33e4b5e24a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/cpu.rs: FileTooLong \u2014 3102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 184 free functions. The bar is 500 significant lines; this is 2602 over it, 6.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/rust/cpu/cpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"303f778c209a5b74839916488e73b01413b9e44a0bfc76e69343e867df8851e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::jit::jit_generate_module: FunctionTooLong \u2014 v86::rust::jit::jit_generate_module runs 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 470 over it, 5.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c17ee3c672a1562db8fea05654545febef339433e65955670fc7a189d7d9481"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: screen.ScreenAdapter: FunctionTooLong \u2014 ScreenAdapter runs 500 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 400 over it, 5.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"352c2aec880a84aa6da4e0470b46b5cb2dd4841cf75661089fae46516214e3b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 9p.Virtio9p.ReceiveRequest: FunctionTooLong \u2014 Virtio9p.ReceiveRequest runs 459 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 359 over it, 4.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8474462a7d8b9ff986dcb93d5fa650cff54c07d476f9c5faa756c5462bbacd70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/main.js: FileTooLong \u2014 2151 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 60% of them inside a single declaration: onload (138-1988). The bar is 500 significant lines; this is 1651 over it, 4.30\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/browser/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf457ab49713bbe260aa7a1aa3808d08beb410e9b3850655320fcad53b31bca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WasmBuilder: TooManyMethods \u2014 128 methods. The bar is 30 methods; this is 98 over it, 4.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/wasmgen/wasm_builder.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e690770a615a899f1a238bc52ff7b2ed1d096d6c84eb450d7d567e808d6632cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.init_ui: FunctionTooLong \u2014 init_ui runs 420 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 320 over it, 4.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"509fab45e08af68ebf23f3ba2ed03eaa3961fa4a69dd0dd25572e4afc5969d2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ne2k.Ne2k: FunctionTooLong \u2014 Ne2k runs 416 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 316 over it, 4.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"62da4d9cc89ae4cf9a60aed10b3c62e0400608f291c85a133c6f20e96d83d715"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/instructions.rs: FileTooLong \u2014 1846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 992 free functions. The bar is 500 significant lines; this is 1346 over it, 3.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2cf33888ebcb7317968f25aef9debe238eb21b2e9935b864495e32ad2a732d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/codegen.rs: FileTooLong \u2014 1845 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 111 free functions. The bar is 500 significant lines; this is 1345 over it, 3.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7d859e4448e7f1dd36b24ced9d293c20d284f587cae4932810e575dbdfde15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ide.js: FileTooLong \u2014 1724 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 224 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73b6c796c819232cc88811628e6e5d237bcc06b65cd14a994b6044931276060"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/jit.rs: FileTooLong \u2014 1651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 1151 over it, 3.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d5adb4bdc8412d041f02abbd1ea9b0a2aea49e22aa5dbe1ef7217b1eab7bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::string::string_instruction: FunctionTooLong \u2014 v86::rust::cpu::string::string_instruction runs 310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 210 over it, 3.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/string.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f10fcf2941c9232f533b4197dca65d039fa947dd89ab481aa0736db7efeed73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vga.js: FileTooLong \u2014 1441 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 941 over it, 2.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"874067defcc41c4bbfc32748b515ef00500878c3baf31f9c849237b09a3522cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cpu.js: FileTooLong \u2014 1393 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 893 over it, 2.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee65935cc0327e76f0473c3f2baa4b559df66abd0b9ad9956433842c3090fe90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.start_emulation: FunctionTooLong \u2014 start_emulation runs 260 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 160 over it, 2.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/browser/main.js"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e66d9ef7d31fedfc0ee669449283778bf6f1cac953dd930b1fdd584da27b33e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: v86::rust::cpu::misc_instr: TooManyFunctions \u2014 74 free functions. The bar is 30 free functions; this is 44 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/misc_instr.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c720d94ec18bb0d354aaf91dcf33f1e5d252a4ccd538705a28da1ff197072b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::jit::jit_find_basic_blocks: FunctionTooLong \u2014 v86::rust::jit::jit_find_basic_blocks runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c360aff5d415a7cda00c4b6f0698cda8eb0ddf5971d0ccfca28782427ee73ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::cpu::far_jump: FunctionTooLong \u2014 v86::rust::cpu::cpu::far_jump runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa4b99475e650359e2af2792ef0c3018ba39e6a966727755c12ec8fa6c4e0cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/fake_network.js: FileTooLong \u2014 1003 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 503 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c377a725c69dd7a74b4583705d9610fe9d47203f1bf0e649e5f6764c692742ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::jit_instructions::gen_string_ins: FunctionTooLong \u2014 v86::rust::jit_instructions::gen_string_ins runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b0389ae470101d5e52ee2639d53ae366b32dd7ec55043d6805426699eb2ece"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::cpu::call_interrupt_vector: FunctionTooLong \u2014 v86::rust::cpu::cpu::call_interrupt_vector runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab61d3b10f55fa6df0cea544529471b1eb49bb85f664771ae6a8fbd0570438d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/arith.rs: FileTooLong \u2014 959 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 124 free functions. The bar is 500 significant lines; this is 459 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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/rust/cpu/arith.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3492f53f43f7df3c182f2e630aba972e5c827bfbbda0ddd8adb6db8e44fb9f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iso9660.generate: FunctionTooLong \u2014 generate runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) 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/iso9660.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e37f4ba6be07d78ca3a21fa14f8127060966afff12d8b7811b60f498a85a2bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: speaker.SpeakerWorkletDAC: FunctionTooLong \u2014 SpeakerWorkletDAC runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4dc758556e988eb03b3b9ea2f3b9cf6e29eb625ca197b7687b5ab7733f1f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/filesystem.js: FileTooLong \u2014 940 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 440 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c82213aa7f4c9406c6279fb7fdf71d0ab3f9708f29fb3f6bb04e9a7092c5444"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::cpu::do_page_walk: FunctionTooLong \u2014 v86::rust::cpu::cpu::do_page_walk runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1d442f7c436ae499d99109ba251db41af4662644a9831687a429daad1963cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sb16.js: FileTooLong \u2014 864 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 364 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sb16.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2cf14ab7d28fa383783781ff95058d21194aa2e92b010404a53889eb6fe6ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/floppy.js: FileTooLong \u2014 834 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 334 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef35cee7066ee7cfb89f9d0f5db6b7c966dbcbe513a422bc31dab6766166acd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: v86::rust::cpu::string: TooManyFunctions \u2014 50 free functions. The bar is 30 free functions; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/string.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfebd8749af561e7f5dc7fee114a527ba20346a68bc7ea563e85513ebd1a559"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::cpu::iret: FunctionTooLong \u2014 v86::rust::cpu::cpu::iret 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/rust/cpu/cpu.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a839c4c6f7240e0c4c486d30a77d9a15a7b02ab4ebf5d97d35aaec57bc5d647a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mouse.MouseAdapter: FunctionTooLong \u2014 MouseAdapter runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/mouse.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9def3b544a4350102cc37c11fc9e20f2a8cc5a24c17bfb253c68c0ed66ebdf3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WasmBuilder: ClassTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 128 methods, 2 blocks, lines 72-979. The bar is 400 significant lines; this is 233 over it, 1.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/wasmgen/wasm_builder.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"140a7fd64122b6c6ee945f36720cbb8130a551cd68a5cb04d128d4e804d9fbae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/9p.js: FileTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 267 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74228c0e26d4dbb896a572dab216b2e538a73c3778b68f553ae5b99297f421e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ne2k.js: FileTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 262 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7967ea8dc2011e276efe6afa86e04cb16461d60c1e5ace09476047e01b2062"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::jit::jit_analyze_and_generate: FunctionTooLong \u2014 v86::rust::jit::jit_analyze_and_generate runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dad4fc7da8b757ff5ec5900b3071f0c81ca22aa4f12169c3ff8b6f7ece0ce2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/virtio.js: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97145862399ca7a4ebb119cc3fb289eba646d4ade639b76d110a8826a3eb95f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WasmBuilder.write_type_section: MethodTooLong \u2014 write_type_section runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/wasmgen/wasm_builder.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"041cafbab4edd1dd9086a8b97e9ab12a349647f2707a137736d24bcdae80d07a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/starter.js: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7f32dca5f8504cd6a362c0a82b15e495c8f05f731dcf7a081973f49d689ee0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::cpu::do_task_switch: FunctionTooLong \u2014 v86::rust::cpu::cpu::do_task_switch runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"348950eddd77e508efb006cd8bd772fc96599dad06de08ff523eaf6a26f29c0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vga.VGAScreen: FunctionTooLong \u2014 VGAScreen runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdb19a3789943a5df79c1981721cd453a14c2792c7e27a15169d5f1f9233d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::codegen::gen_safe_read_write: FunctionTooLong \u2014 v86::rust::codegen::gen_safe_read_write runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"478024e833921c5049d301e05e61de063a48c4a1e98f6a81f798f201903e78ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wasmgen/wasm_builder.rs: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: WasmBuilder (2 blocks, 72-979). The bar is 500 significant lines; this is 194 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/wasmgen/wasm_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac4c6fdac2005cb798a79cfb76b40e329e75ab84465ffda0ff18332a3bbfae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide.IDEChannel: FunctionTooLong \u2014 IDEChannel runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcea6fb7af9ee90958b938ceb8e90f05195680a56e63bfba6cf5e0314a348837"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: uart.UART: FunctionTooLong \u2014 UART runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9528eee8a32663f2ab5b821e0e67d06d7e2b525ca68984aa5ca0a509c15ce108"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/fpu.rs: FileTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 118 free functions. The bar is 500 significant lines; this is 144 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2282aa357709091ed99350d5e591f36b8b22e9bf63d9b331e270d7a6c7a4e32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gen/x86_table.js: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TESTS_ASSUME_INTEL (12-866). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/x86_table.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"929eed4f5d3934178a46c477d8d1b030e69f44979f7f3b907d738c62895ede18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: virtio_console.VirtioConsole: FunctionTooLong \u2014 VirtioConsole runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8dab6381b68045d144f9454eac085547d93d0f80e3f1e9f223de607508f52e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: virtio_net.VirtioNet: FunctionTooLong \u2014 VirtioNet runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_net.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"df51c7d6f6b7c627630720a1386eeb0933db73977cdede3bfeeb7505734e559a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generate_jit.gen_instruction_body_after_fixed_g: FunctionTooLong \u2014 gen_instruction_body_after_fixed_g runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64287d7c33195ac77e07969431cbf47846545b1c91083ab4fa77a49bbe1c020"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: v86::rust::cpu::sse_instr: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ab4496c952ae9ea76367fde3d089c86393c0ac61aa8fcae525a654c5ab7ff9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::apic::write32_internal: FunctionTooLong \u2014 v86::rust::cpu::apic::write32_internal runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/apic.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"069bf86d1be75c6eb56fc25812bf77331abdbbc8ae01f13f409e97a67c6e69d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/speaker.js: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b58f482e84f081666bcb25bc14a26b1a81ba7552af4d1f286bde878072b7b35"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: F80: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/softfloat.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c741634e2a6db1af49099f401012bb3dc4c6b9022b2469bb19358184e70f5a64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ne2k.translate_mac_address: FunctionTooLong \u2014 translate_mac_address runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) 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/ne2k.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaaefd0439d5d3574d946b411925f1c57fbaca8c1ba2051adafd98a255405aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: v86::rust::cpu::instructions_0f::instr_0FA2: FunctionTooLong \u2014 v86::rust::cpu::instructions_0f::instr_0FA2 runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":3256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8550be9d6460418432c652c630cd8058432dc57054a62eebdd5c8df6743896e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fake_network.TCPConnection.process: FunctionTooLong \u2014 TCPConnection.process runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"670e41759cb496d3c781cb45083e70e0f17f9f0c8a8bee8c34bdb2e6ea878343"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/screen.js: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ScreenAdapter (13-967). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae725d02f086848dc21eed5cbfbbb996fc3704808a2d20ff90fc46bdbf72371"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 27 shared lines): src/rust/codegen.rs:647-780 | src/rust/codegen.rs:782-857 | src/rust/codegen.rs:864-1007 | src/rust/codegen.rs:1014-1245 \u2014 These 4 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a5a1567c927fd2d4092e279380e395732d1b63178390e5b987869826b91092"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 27 shared lines): src/rust/codegen.rs:2090-2199 | src/rust/codegen.rs:2201-2326 | src/rust/codegen.rs:2328-2457 \u2014 These 3 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"058554e7bc0cea6558cf8e7768a74e952b62c980e25b46accef72c4d8e9b608f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/rust/jit_instructions.rs:1495-1512 | src/rust/jit_instructions.rs:1513-1530 | src/rust/jit_instructions.rs:1532-1549 | src/rust/jit_instructions.rs:1550-1567 \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/rust/jit_instructions.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"516559acfaa644f579ac67814495fbf27b3403889607b83a41f8b2d744828415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2): src/rust/jit_instructions.rs:1143-1214 | src/rust/jit_instructions.rs:1242-1313 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"738a25d865d02b5f83ab11cfa74ee2f5afe8841797134d27479a84ccf085ce31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): src/rust/codegen.rs:2209-2255 | src/rust/codegen.rs:2336-2382 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5c117d5a1e6568a8143e8248279aaa2f2608d2b674bd313c73e60049cfcede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): src/rust/codegen.rs:2261-2294 | src/rust/codegen.rs:2388-2421 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8ef4351a6bbeece889749a051217e34fe5ffabf4a546132f5fe182103bcafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): src/rust/codegen.rs:1511-1540 | src/rust/codegen.rs:1607-1637 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca17f7f69d6308e242042f7dfe0db9b24822720524ec5dbedc38f9a8204def8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/rust/jit.rs:1583-1611 | src/rust/jit.rs:1777-1805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfa86ac8395c7d15fb7856abc99759914fe87211c2688a5c750f43bb1075c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/rust/codegen.rs:191-216 | src/rust/codegen.rs:234-259 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5222492e2f3ff9261ef141b7af180635d93e694b10787a35de8e099d01d74697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): src/rust/jit_instructions.rs:1603-1627 | src/rust/jit_instructions.rs:1676-1700 | src/rust/jit_instructions.rs:1742-1766 \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/rust/jit_instructions.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd455d9581749bf0c87a4e71588a6a466013a414f03f67f977d4ae210bd2d441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): src/rust/codegen.rs:1498-1520 | src/rust/codegen.rs:1544-1566 | src/rust/codegen.rs:1594-1616 \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/rust/codegen.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e3a3ecacaaac9c5282ad7ceac7bc4d001c89592be8a30a3506087cf07b24c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/rust/codegen.rs:924-943 | src/rust/codegen.rs:1163-1182 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"61849d169d55942157d3156b17e9e2b65595bfe37c3d98568318b28f4fefb975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/rust/jit_instructions.rs:2365-2383 | src/rust/jit_instructions.rs:2415-2433 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":2365}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b050eb31e1528e20fe4c45b4929577da5cf2c182f7b862d3525f0182139c86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 2): src/rust/cpu/cpu.rs:742-759 | src/rust/cpu/cpu.rs:1620-1630 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"444181cea9fdcac634371a888a9255882ded7e00d960b908b04a730ab9d508a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/rust/cpu/instructions_0f.rs:1108-1125 | src/rust/cpu/instructions_0f.rs:1159-1176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5113501cb361b7b6d85bb7c79528969e22e43807e7bc9050689b3a329efd9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/rust/jit_instructions.rs:7057-7074 | src/rust/jit_instructions.rs:7084-7101 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":7057}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2b093b3f064ceba7ebf90e5430cab14b022b84c6a83d6dc0946c7099472a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): src/rust/codegen.rs:720-736 | src/rust/codegen.rs:830-846 | src/rust/codegen.rs:948-964 | src/rust/codegen.rs:1093-1109 \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/rust/codegen.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd815d5c739ad889f349d3cc27574862ae83fab4d9d59a7060756b6ac6902fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): src/rust/codegen.rs:674-690 | src/rust/codegen.rs:888-903 | src/rust/codegen.rs:1042-1056 \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/rust/codegen.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a3b2dcb3ed8992b0962ff04fa077c8a17f7ab53cf4fb122644ec1e5e6e5d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/rust/cpu/instructions_0f.rs:1083-1099 | src/rust/cpu/instructions_0f.rs:1134-1150 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/instructions_0f.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fdb0e0b77c0583672b5d7c9ac7b21ad0cca514e28598475ae134b6d9337897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): src/rust/cpu/misc_instr.rs:464-474 | src/rust/cpu/misc_instr.rs:514-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/misc_instr.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"77573ae31e362387ca31f12f90887096d0d4422207376c9bd903d18c19640dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/rust/jit.rs:1444-1459 | src/rust/jit.rs:1581-1596 | src/rust/jit.rs:1775-1790 \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/rust/jit.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"877b4f48d65ffa2dc37dfa344a87d8ce628ef29250d44ee644229e783d0f6940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/rust/cpu/arith.rs:856-871 | src/rust/cpu/arith.rs:879-893 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/arith.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce488e3c96fe5a6574019de33fea2d7e9a5b5f2e2d56da2803ca33bff580a5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/rust/codegen.rs:1992-2006 | src/rust/codegen.rs:2018-2032 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7206749eb535d47119b7f6623f811b57c26ce0c6623b2732ad9e021868b053d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/rust/cpu/cpu.rs:1154-1167 | src/rust/cpu/cpu.rs:1192-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"261b6a73f275358cc12270cd3a3006513b0b65c66460ec47f5be9c4ed88f7c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/rust/jit.rs:1360-1374 | src/rust/jit.rs:1413-1427 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09be6f6ff6a0b9363b04c8a9791f055ecd1cb2ae5ad8231b350f3c30a7e7a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/rust/jit.rs:1500-1511 | src/rust/jit.rs:1648-1662 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7e1d6ac7396e4b6b1f187ddae82fb97d4db100b205c7a4d1a82b123b524e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/rust/jit.rs:1945-1959 | src/rust/jit.rs:1989-2003 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c628ca170e13caceaaca2b35453b974e30e85aa53b2762f4143ef0fda05d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/rust/jit_instructions.rs:4761-4775 | src/rust/jit_instructions.rs:4795-4808 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4761}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ca7a99dba92d6d0f93c433abfff19836e7f176e58c231cf3e3cf9d4419690b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/rust/jit_instructions.rs:6901-6915 | src/rust/jit_instructions.rs:6927-6941 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":6901}}}],"partialFingerprints":{"codehealthFindingId/v1":"72131392891194209bb51c18782cde7dd282202861cc9efa909bab24ab2f769d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/rust/jit.rs:1414-1427 | src/rust/jit.rs:1443-1456 | src/rust/jit.rs:1580-1593 | src/rust/jit.rs:1774-1787 \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/rust/jit.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5e03fd11519c9a53dda63ad579978b82c53eac48cfbb2cc3edb438f4bf3487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/rust/jit_instructions.rs:1496-1509 | src/rust/jit_instructions.rs:1514-1527 | src/rust/jit_instructions.rs:1533-1546 | src/rust/jit_instructions.rs:1551-1564 \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/rust/jit_instructions.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"1986feec1449f1eee203b77203b7e72d6f011ef74270f06575eb2ebf1621283a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/rust/codegen.rs:990-1002 | src/rust/codegen.rs:1221-1234 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d065c83ec3801d00cc47d663a9c7077689f581e1ccd71417499b825d532edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/rust/cpu/cpu.rs:1132-1145 | src/rust/cpu/cpu.rs:1475-1488 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a03820ecd7cc7848095ec2d318270db5be4234abd506eccdfe7a602b190156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/rust/cpu/misc_instr.rs:310-323 | src/rust/cpu/misc_instr.rs:340-353 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/misc_instr.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b476b0cdfc1d94026e798a31dc432f9ac8bd84a5a43b79d44880f5bac3062e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/rust/jit.rs:1361-1374 | src/rust/jit.rs:1705-1719 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc5f605029c0b115e0ef2a03c484b2b50573b8b09d97a5c523fb101159d0c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/rust/jit_instructions.rs:1123-1136 | src/rust/jit_instructions.rs:1222-1235 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7497add8ca248ad2a49254fd7edb86cb4cdb28d840eb899457721b619575b75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/rust/jit_instructions.rs:1727-1740 | src/rust/jit_instructions.rs:1785-1798 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bab4932c25b1e180451c1384dac0c9190a2dbbe874c90b7ea2bafb86b40f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/rust/jit_instructions.rs:1845-1858 | src/rust/jit_instructions.rs:1878-1891 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b71d9ee5897885b0a165ae5902d62c6369b0e44a6f62eb75e7133f81e75d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/rust/jit_instructions.rs:2385-2398 | src/rust/jit_instructions.rs:2435-2448 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7c696bf18e002d74bf43dc3fba247b151632991759c2d616da98ef2c61353c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/rust/codegen.rs:2091-2103 | src/rust/codegen.rs:2202-2214 | src/rust/codegen.rs:2329-2341 \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/rust/codegen.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d09272b181b01757d40c8e4ecc81e05b078a01a061655024d996f5f57b8122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/rust/codegen.rs:749-761 | src/rust/codegen.rs:1122-1134 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3552782120ff0bf9c3ba88ca894f1d000db3879115136a0c8aa3603654eb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/rust/cpu/string.rs:264-276 | src/rust/cpu/string.rs:405-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/string.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3887949eb16d5c6773244f4c58c12f82c2ba4527b35a2ead31f6d20b2419ffb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/rust/jit.rs:1921-1933 | src/rust/jit.rs:1965-1977 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit.rs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac76a33174f03508cc7c95cddfdd99a574cc51ccdc8333d0dfefb9d1abf63706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/rust/jit_instructions.rs:2946-2958 | src/rust/jit_instructions.rs:2960-2972 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":2946}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d98465e796a0439d637b3b50deee07c2f7e8bdc0b21f3ccc8c19f5e95bdb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/rust/jit_instructions.rs:1325-1336 | src/rust/jit_instructions.rs:1412-1423 | src/rust/jit_instructions.rs:1454-1465 \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/rust/jit_instructions.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb49ca8e2bbae2d55512ac54611de8380df552a9d90cf54be7a43b3dd043c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/rust/codegen.rs:1455-1466 | src/rust/codegen.rs:1477-1488 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2fa3748eeb84fe48e0f80bd55048efc11884053b6ed384948ca6db673e1d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/rust/cpu/apic.rs:238-246 | src/rust/cpu/apic.rs:474-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/apic.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cbc57dcad777eb2e79aa99317b4f38ba41746a9a1da6b7a2c272c4ab2401bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/rust/cpu/cpu.rs:3943-3953 | src/rust/cpu/cpu.rs:4058-4069 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed56e9bbb49abfcc4ba2026eb6041f18db81ad03f58636fe7997c60bca51501e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/rust/cpu/cpu.rs:3965-3975 | src/rust/cpu/cpu.rs:4085-4096 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":3965}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6ddbb75a12e0ebd9c6a8dcb8284f2d9a210f94c4a40d01f701e7d1170e3ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/rust/cpu/cpu.rs:3989-3999 | src/rust/cpu/cpu.rs:4113-4124 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":3989}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5c7056b6d32d3e42f4b18c7117d990d9a67b0c88c0c538ec4f90cbd8c2100f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/rust/jit_instructions.rs:4687-4697 | src/rust/jit_instructions.rs:4819-4830 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4687}}}],"partialFingerprints":{"codehealthFindingId/v1":"4576c4e85ac3f001874f4715c7be03b71122bdd681c8d8095c1b1bb38b8bea1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/rust/jit_instructions.rs:7655-7666 | src/rust/jit_instructions.rs:7755-7766 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":7655}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d15c6323fcdd5d7b5c4c1a8a7171b09cf6da23391f24a8892a9473e89dd172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): src/rust/codegen.rs:660-670 | src/rust/codegen.rs:798-808 | src/rust/codegen.rs:877-886 | src/rust/codegen.rs:1031-1040 \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/rust/codegen.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5942fa566546307f874e9421eaa1c83e03ce35eb4ba40ea0cc565fcb6e8d56c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/rust/codegen.rs:219-229 | src/rust/codegen.rs:266-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae04039e22cb6dac3a9db028ca6688606fee6da191001e86dd4ddeb3fdb8de0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 3): src/rust/codegen.rs:1821-1830 | src/rust/codegen.rs:1848-1850 | src/rust/codegen.rs:2144-2154 \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/rust/codegen.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e26e588a8ec0fd8d00a5a3f3ea111c9972bdd2a690f1171e8d8a224986058e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/rust/cpu/arith.rs:489-499 | src/rust/cpu/arith.rs:506-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/arith.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"80343fce011a2343b22545be79efaafe98b5ef7d6b64a08cb7e36d7f6a9804eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/rust/cpu/arith.rs:587-597 | src/rust/cpu/arith.rs:604-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/arith.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d965f60a52aa5f59adf8fbfd207539adb86b64909718df064ce3fcb54321008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/rust/cpu/string.rs:280-290 | src/rust/cpu/string.rs:421-431 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/string.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a233728dc2b61f4289a23ce4acd3d37dd3c4ca2afb28f30dc3e4b31b4032a48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/rust/jit_instructions.rs:968-978 | src/rust/jit_instructions.rs:1024-1034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee90fb01996c95e1936c3662b77c2e5b5b8df6ca8fb7b53fec2f9576b4f0342d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/rust/jit_instructions.rs:2041-2051 | src/rust/jit_instructions.rs:2063-2073 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3366c9f390c579a13ffdccf1e37f5c0561e69dd3d12435913ffa26c1791de4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/rust/jit_instructions.rs:4711-4721 | src/rust/jit_instructions.rs:4862-4872 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4711}}}],"partialFingerprints":{"codehealthFindingId/v1":"236f2e23b1bee183e2ccdd2c59bb61cb93277cadb4cb5a0144041755a6337550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/rust/jit_instructions.rs:6380-6389 | src/rust/jit_instructions.rs:6398-6408 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":6380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1c3d8be37a0c7a4eabb2c2aca43e44b39bc62ca03edcf8d496b00a5ff09b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/rust/jit_instructions.rs:1095-1104 | src/rust/jit_instructions.rs:2371-2380 | src/rust/jit_instructions.rs:2421-2430 \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/rust/jit_instructions.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4d476702d196a4ddf6d4593ec1bb946824d7b3f412893ac6c0060b819173a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/rust/jit_instructions.rs:2039-2048 | src/rust/jit_instructions.rs:2061-2070 | src/rust/jit_instructions.rs:2083-2092 \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/rust/jit_instructions.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e06e76cb3dfeca69aa8608fea68c3218ef81a0f3c1a5c82a5a5d5acc8f0dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/codegen.rs:404-413 | src/rust/codegen.rs:424-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb946b4323e762bc84cacc9ef71265bab1ca822b47849c38a63013c98f1f2012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/rust/codegen.rs:692-701 | src/rust/codegen.rs:819-827 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"7241849c4572ce01b7d2d3eb2a339e442de7a0cabe10fa9466407e770c819c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/cpu/arith.rs:442-451 | src/rust/cpu/arith.rs:458-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/arith.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b19a2b537debe250690329757b1fef088cb0714f512d23669c2e5e980e97d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/cpu/arith.rs:540-549 | src/rust/cpu/arith.rs:556-565 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/arith.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34a7fceb94cb93c37615a9e588756f9ebe279d8b47a14022150b4dbbc6f5d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/cpu/cpu.rs:933-942 | src/rust/cpu/cpu.rs:1247-1256 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"90661796398624c6f046878a3adcef4609802262622feeb1909189f03f637835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/jit_instructions.rs:1346-1355 | src/rust/jit_instructions.rs:1433-1442 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00829365b47b356af0dd251a1073be62931d19c8ae212fffbde084daf3c7903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/jit_instructions.rs:2624-2633 | src/rust/jit_instructions.rs:2657-2666 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"186bcbfded0d7406a5d7021f2d18786b6bcb69298dd08f1f1f5cb12fee769490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/opstats.rs:150-159 | src/rust/opstats.rs:216-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/opstats.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb05a0f99f2ef4e71aaf77437fa2b613a830231a6cf37d340b4fb54b94c48e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/rust/jit_instructions.rs:4765-4773 | src/rust/jit_instructions.rs:4798-4806 | src/rust/jit_instructions.rs:4852-4860 \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/rust/jit_instructions.rs"},"region":{"startLine":4765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5116069d244af2a66886d62a066cb56df71e8b317f80cfe40379cefd5bfa0a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/rust/jit.rs:1484-1491 | src/rust/jit.rs:1631-1639 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a41986e29579d756d7238906cfca133c158c326cb2f95f3223dee11e6d0d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/rust/jit_instructions.rs:1863-1871 | src/rust/jit_instructions.rs:1900-1908 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c6fd1960326e17d37b9f54c940e2918ed91db3c738572e850089d606ee2c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/rust/jit_instructions.rs:4201-4209 | src/rust/jit_instructions.rs:4212-4220 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4201}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaeb3769f59f8fc939ca8392bead2e982d0abd08bce271e81c816300b21dd22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/rust/jit_instructions.rs:4723-4731 | src/rust/jit_instructions.rs:4777-4785 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4723}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c3c6e978de62b714435522b86677290e1d78a33685bd95f09699a083121ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/rust/codegen.rs:2238-2245 | src/rust/codegen.rs:2285-2292 | src/rust/codegen.rs:2365-2372 | src/rust/codegen.rs:2412-2419 \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/rust/codegen.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c015c838c1720704d8cb909e9bfb08f807fd17483c44f644648d1f4ed9015f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/rust/jit.rs:1485-1492 | src/rust/jit.rs:1506-1513 | src/rust/jit.rs:1633-1640 \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/rust/jit.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5cc2e55d42ad253eee4bfd1541547db0a40aedc54f9463ff22fdc0f6e6777f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/codegen.rs:2122-2129 | src/rust/codegen.rs:2158-2165 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adb1cf42808fb6483987d390d4ba1b4784ef3b5512978a0916686cb36d2959b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/codegen.rs:2672-2679 | src/rust/codegen.rs:2685-2692 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":2672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6a39978420a6fef2c45f557358c3750fd7e2a51b14f448a7af5fc33ad27eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/cpu/instructions_0f.rs:1385-1392 | src/rust/cpu/instructions_0f.rs:1414-1421 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/instructions_0f.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ce5f2ec2dea3eaab41b490f0072420b15bd6d0819aaaca74ea8cdbbe19f8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/jit_instructions.rs:3518-3525 | src/rust/jit_instructions.rs:3538-3545 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb79709610cd7226fbcd2425b6df5c03f02ad32c9d08a923d3cefd3e2a1aea46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/jit_instructions.rs:3720-3727 | src/rust/jit_instructions.rs:3733-3740 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bda20e738ad45a7cfa298fe4a0b170f7559c7f568081af63c27ec530622168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/jit_instructions.rs:4001-4008 | src/rust/jit_instructions.rs:4014-4021 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4001}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b43673bba59194b9090fb27afb3a476cb4554617e208ffb937e289be5ae74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/jit_instructions.rs:4172-4179 | src/rust/jit_instructions.rs:4182-4189 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52399b2bb15daa39af3025110fa1be2a3d8e0ef667c86bd40c854d5f77024b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/jit_instructions.rs:4223-4230 | src/rust/jit_instructions.rs:4233-4240 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4a07c15adcc1fcacda536d306d57be1535e4b483441384a82a9f61dee0283f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/jit_instructions.rs:6494-6501 | src/rust/jit_instructions.rs:6505-6512 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":6494}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba06aa4c329684524ca1ad563bbcef5af8348698d68c262b69b56e02a6a0042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/rust/codegen.rs:2119-2125 | src/rust/codegen.rs:2235-2241 | src/rust/codegen.rs:2362-2368 \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/rust/codegen.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdc35d5c7485dd2975f3da744a8a315bfd630e7e4b268190bf1a024965f16ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/rust/jit.rs:192-198 | src/rust/jit.rs:1130-1136 | src/rust/jit.rs:2280-2286 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"85994678b6b454ec4a0ab2bbe00ef4003128578b9d1634957e7cda226312ef61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/codegen.rs:2306-2312 | src/rust/codegen.rs:2438-2445 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b23f0ee4c53927ea606490a401f0a204cff52429af2f99c213a945d153f635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/cpu.rs:1492-1498 | src/rust/cpu/cpu.rs:1642-1648 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f7a12f62beaf2903b8c8e5eadae699491790facb610755ddeae574f07169fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/cpu.rs:2515-2521 | src/rust/cpu/cpu.rs:2538-2544 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c505856a6de6b5f5287f28b10f049ce2ac18514ec036602cc9425e524bdd313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/fpu.rs:194-200 | src/rust/cpu/fpu.rs:699-705 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/fpu.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a2eddbd5fe70b3aace22427512ce89f26cd8eecaf59eebbc687ed221167561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/fpu.rs:210-216 | src/rust/cpu/fpu.rs:715-721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6908c40cee4f980f54c9550a2d1df4b33d0b5084bce157ab5056080291633cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/instructions_0f.rs:5120-5126 | src/rust/cpu/instructions_0f.rs:5151-5157 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/instructions_0f.rs"},"region":{"startLine":5120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2788c427f7bff66b4d3b899bfbcc5318dceda9f8e2e7f59955541aa5cd51d3b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/instructions_0f.rs:5238-5244 | src/rust/cpu/instructions_0f.rs:5269-5275 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/instructions_0f.rs"},"region":{"startLine":5238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dac4c4251c61edfe5903d6be33e50b259ff4c8e3aa851f8633e4cf8125652e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/misc_instr.rs:476-482 | src/rust/cpu/misc_instr.rs:532-538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/misc_instr.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e874c5c6e12aa4877705f6d14f2ee0767760c5d05a54b145be227bff9834f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/rust/codegen.rs:2121-2126 | src/rust/codegen.rs:2157-2162 | src/rust/codegen.rs:2237-2242 | src/rust/codegen.rs:2284-2289 | src/rust/codegen.rs:2364-2369 | src/rust/codegen.rs:2411-2416 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccab0d0d7d953f0ad9873e5cee9af337a9dad8158bd96c1758cc6be492e6522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/rust/cpu/arith.rs:29-34 | src/rust/cpu/arith.rs:51-56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/arith.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4f4b5f763a85c6891dbdfc14ea488e1a003204eef4d9dcf3d57d3bd107a85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/rust/cpu/cpu.rs:3667-3672 | src/rust/cpu/cpu.rs:3820-3825 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":3667}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cb6efaa0fc4218331f609810b8e722abf302b30aa61f811d56ee6430e520d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/rust/jit_instructions.rs:3864-3869 | src/rust/jit_instructions.rs:3882-3887 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"6927dce936c7b1ba42a93922fcfed3a4ebb50cc96e1577fc18c2ce7816a81593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/rust/wasmgen/wasm_builder.rs:285-290 | src/rust/wasmgen/wasm_builder.rs:378-383 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/wasmgen/wasm_builder.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1091e234d8d65e207f3707d41b8fe4345c15a653a6d8e0bbc6d8a32b17a377ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/rust/wasmgen/wasm_builder.rs:395-400 | src/rust/wasmgen/wasm_builder.rs:403-408 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/wasmgen/wasm_builder.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"753faa48434025eec89e47de2b659b21b7126b621f4313174fe25a4658c4b9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/rust/cpu/arith.rs:1025-1029 | src/rust/cpu/arith.rs:1033-1037 | src/rust/cpu/arith.rs:1041-1045 \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/rust/cpu/arith.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f6afcd99d7a5359b1205c1b7aca08e178c32bc80c96c156053b8137781c2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/codegen.rs:137-141 | src/rust/codegen.rs:155-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4feff5044b4b4e5498e55e6b7878412be2db7e0baf81ddc409cb4631724311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/control_flow.rs:153-157 | src/rust/control_flow.rs:162-166 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/control_flow.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a350e17662d04680acf585963167a7d916150747bafc12103ee0d6715359d1c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/cpu/instructions_0f.rs:1378-1382 | src/rust/cpu/instructions_0f.rs:1407-1411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77374c5729a9b5042592268d47ac33a81f89c16ff1144db4c048c64fd61a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/cpu/instructions_0f.rs:2714-2718 | src/rust/cpu/instructions_0f.rs:3942-3946 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/instructions_0f.rs"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e4754dfa7b23ed69201220e390442eb4c55953d2133566bf15bdc504b27e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/cpu/vga.rs:86-90 | src/rust/cpu/vga.rs:105-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/vga.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a72f1de480aa3168d10a8abaea0a3be2f58e0d9837cd17e65bdb3f586fdde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/cpu/vga.rs:108-112 | src/rust/cpu/vga.rs:130-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/vga.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db8dc3e5fa5aceab860feb4014072e5e37044c5efd0b123b2ea4db5946c1b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/jit_instructions.rs:5120-5124 | src/rust/jit_instructions.rs:5263-5267 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/jit_instructions.rs"},"region":{"startLine":5120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4287eb6856e98689299303b9d5680db4f2f7430a082e2edd3ee9c7797633c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/opstats.rs:80-84 | src/rust/opstats.rs:91-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/opstats.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a6c8a8dc22fe0a8a9ec5d36dcb268bbd928fae11cfed7debae5907d360fc51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/rust/wasmgen/wasm_builder.rs:355-359 | src/rust/wasmgen/wasm_builder.rs:363-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/wasmgen/wasm_builder.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8845aebcf35c833bd8d1f09541616c421956d5ee0997bc0f263285e1734df97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/codegen.rs:694-701 | src/rust/codegen.rs:1062-1071 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"517877f0702fbd14b49fbfa88e2c1445aa92119aaa37fc5a3bc51b0d2f0ed31a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/rust/cpu/cpu.rs:1149-1158 | src/rust/cpu/cpu.rs:1519-1528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"13075e256081518bc714255450231e8d1e7fd375ace4fa3698ca81be9212b90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/rust/codegen.rs:692-700 | src/rust/codegen.rs:905-913 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/codegen.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01977b2254d53c94b54729f8449209923bc88f725baba9c1819b0a7c7d221f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/rust/cpu/misc_instr.rs:563-570 | src/rust/cpu/misc_instr.rs:588-595 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/misc_instr.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1417df6948a4941dfdd44c6c793cf08b1f985d5b59c47bfbc0cae4b2f466b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/rust/cpu/cpu.rs:1400-1406 | src/rust/cpu/cpu.rs:1420-1426 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cpu/cpu.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0c67890b7ec7af04da2a1cb4ac4f7afc4527fc283860e2647647886a8de540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/rust/jit_instructions.rs:3542-3547 | src/rust/jit_instructions.rs:3709-3714 | src/rust/jit_instructions.rs:3737-3742 \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/rust/jit_instructions.rs"},"region":{"startLine":3542}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e3b1f9a8bd521ab69f2b7578f055dae702b113b7d0aa58b7a1483d008f35a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/rust/jit_instructions.rs:3601-3606 | src/rust/jit_instructions.rs:3613-3618 | src/rust/jit_instructions.rs:4052-4057 \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/rust/jit_instructions.rs"},"region":{"startLine":3601}}}],"partialFingerprints":{"codehealthFindingId/v1":"130c92f45a36931e8292d976081773e109e924cdead6aa4d0427d821a3003f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/rust/jit_instructions.rs:3847-3852 | src/rust/jit_instructions.rs:3866-3871 | src/rust/jit_instructions.rs:4068-4073 \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/rust/jit_instructions.rs"},"region":{"startLine":3847}}}],"partialFingerprints":{"codehealthFindingId/v1":"590e5690a759776375b16a2f8640338abf5e051e512b205ea2e55ae487d8c531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/rust/jit_instructions.rs:3988-3993 | src/rust/jit_instructions.rs:4003-4008 | src/rust/jit_instructions.rs:4016-4021 \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/rust/jit_instructions.rs"},"region":{"startLine":3988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31804ec35dcd255107c69cd3efce9d5663b2515514d948f59d4f22473c5b01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/rust/jit_instructions.rs:3558-3563 | src/rust/jit_instructions.rs:3576-3581 | src/rust/jit_instructions.rs:3749-3754 \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/rust/jit_instructions.rs"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8057d1b2d552fadc9ef9554e4b241ecdbb4a8cd7c0301ccc83971bf5d7065aee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/browser/starter.js: src/browser/starter.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in starter.V86.continue_init at line 192. 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-07-20..2026-10-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-20 18:51:06 \u002B02:00\u0027 --until=\u00272026-10-18 18:51:06 \u002B02:00\u0027 --full-history --no-merges -- src/browser/starter.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c6339343b40c1c114400583330796653ef21f643f7b6e5dec977f45481d764"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ide.js: src/ide.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in ide.IDEInterface.ata_command at line 1185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-20..2026-10-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-20 18:51:06 \u002B02:00\u0027 --until=\u00272026-10-18 18:51:06 \u002B02:00\u0027 --full-history --no-merges -- src/ide.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae19f2363d1a51ddf16cac130fd6b32cd083bc749300d1e5d4c484ee89b2c9e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/browser/screen.js: src/browser/screen.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 138 in screen.ScreenAdapter at line 13. 1 of those changes was a fix/bug commit, and the other 1 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-07-20..2026-10-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-20 18:51:06 \u002B02:00\u0027 --until=\u00272026-10-18 18:51:06 \u002B02:00\u0027 --full-history --no-merges -- src/browser/screen.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6d8594cad49f522c580e95fc3a2393b84424113a41d70cc8b457a04f93874f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cpu.js: src/cpu.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in cpu.CPU.init at line 1000. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-20..2026-10-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-20 18:51:06 \u002B02:00\u0027 --until=\u00272026-10-18 18:51:06 \u002B02:00\u0027 --full-history --no-merges -- src/cpu.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbfedb34ab28b38381d01fb08335142f54dcfd7af16eb792786c9afe8a4bca9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/rust/cpu/instructions_0f.rs: src/rust/cpu/instructions_0f.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in v86::rust::cpu::instructions_0f::instr_0F30 at line 1183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-20..2026-10-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-20 18:51:06 \u002B02:00\u0027 --until=\u00272026-10-18 18:51:06 \u002B02:00\u0027 --full-history --no-merges -- src/rust/cpu/instructions_0f.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rust/cpu/instructions_0f.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cffa668008504bf9f602ef009990b0822f07e4b9b1fc5af8441c6cd101e1407"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 12 significant file(s) lose their only recent owner: src/rust/jit_instructions.rs, src/rust/cpu/instructions.rs, src/rust/jit.rs, src/rust/codegen.rs, src/rust/wasmgen/wasm_builder.rs, src/rust/cpu/arith.rs, src/ps2.js, src/buffer.js (\u002B4 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dab847aff17113c074b007eef973ac04c1ba0c1baf11ee48992b7696f22790da"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 6 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 (20 single-owned of 82 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 82 of the 109 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/iso9660.js, src/browser/ansi_screen.js, tools/docker/debian/build-state-raw-disk.js, tools/docker/debian/build-state-9p.js, src/browser/modem.js, src/dma.js, src/vmware.js, src/parallel.js."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Both fast and slow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d9f4840aeef35baa854974024894983bb7bb9b56191585d4e197fe4762cc4a"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Both fast and slow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf93adeff71ca41b69334020d3e48e682e2fbc8e2016e87223a6047aadc732f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Both fast and slow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afdfdc24c6f5afcf2dadbcb2e27c3d16e63a10129c4dbeff26b50240f8057eb"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Currently does not use ctx.start_of_current_instruction, but rather assumes that eip is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"b642acbce137b8299c0191ed19ddd6de01c92bcefb0a03f51d70e2ee1a5fbaca"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa303d8f49b4676c3526add8d08d7a5bbca71e1c0d97592d470b6a269004ea5f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e6cedb7907e5301d6b04e9e580e0dfe84b51ed3479b35db3597f14c6d1cc53"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"850021bc861db071244cf3167520c18ec2a07aeeb2bbcbe5b7cd9be8647e95b9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d92bb196ac3fbe954d36b80f4b96be02b5bba71e1940268d7b9df50672c4e05"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/memory.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"267297e42c6e23032111f3586b9d695af383413d0cbd40aff3c0e7376eb25e79"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Also slow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88816cb0a174bf4796babe69946f6816b6c954a0dac620cd83fe8b02fad68eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could get rid of this local by returning one from f \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0645bb4161b659e3b2a21d65e0cc0d5f6f741ee87c9456846c871b1b639e3a0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use local instead of last_result for 8-bit/16-bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a98ccaaa7134c7f3480f3b8955c547de45f2ae5234b2353e4c9070ae975927"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use register (see get_last_result) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf2338a663da82f13ecce0847e678b297517edbd2fb65799bcacab00e81c0e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a better formula might be 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/rust/codegen.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd613996c31671eb0bfa74e3e9206919e898cc7f41ea8700366ea28984dbf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a better formula might be 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/rust/codegen.rs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c62fc592b8dac792bdb91516ce53d91e334c93674a8b0b08edab999e8628f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could probably be improved (\u003C= 0) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/codegen.rs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"effeedfdd0a685a4a77ec8a2c6fee07cd3805e5f6c672533bdc96cb80a9fef83"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: This might remove forward edges to other loop entries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/control_flow.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb2e9c76b9fa988229b3af9938167d9017e9d05621da3e8d60a0344462623bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Might be faster to do this *after* inserting blocks in this block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/control_flow.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8614831e164118d2e2decadbf684197fc86f155162f7d7980b0b6b4f309db602"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: //dbg_assert!((w.is_some() || page.is_some() || entry_points.is_some()) == tlb_has_code); // XXX: check this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba7bb483dbae7c70dbd46ca2062df7d8f4e0b12618e2fdfbb9f97492e4c7498"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // don\u0027t assign 0 (XXX: Check) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afd0ab6ee01fe5b5d7d83f8bf98b9d1071d8ae95a167dba4b496856c30538fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dedup with jit_find_cache_entry_in_page? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5e42ede811156b1c4e3888e486725bce5f394c7d4a9ab0dbe65ac7b5a4f9b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: generate code for this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dee636aa3fc22742205af4df832b3b8896525aa30b57d221e632c7822b36135"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Remove this paragraph \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbb6502df2396e1f9acab818732147b8c994d7f25b5faa0b1697c7402ecf1cf"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: check and 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/rust/jit.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"44416fb3f6f92b17f37c7446a6137e19ea74238451aeee024fb6defb100e9cd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could make this unconditional by including exit_label in the main br_table \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7067c940f308f440a8faec180071ebd19422cda0eb53f41fbd59771ae6d9f57e"}},{"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/rust/jit_instructions.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e364743ad5f33869c80af841397198b1d9568de66c7bc132fbf3f0ea70cbcf"}},{"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/rust/opstats.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdf4f5d08d28f55f031dd4dc053a0c85291b68fb0291bbb9481f2a03e1c737a"}},{"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/rust/cpu/fpu.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"03368d02c879810c3ca17d408afb51778e50202d0dbf40f253c658bb2531c16b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check es/ds is null (only if rep \u0026\u0026 count!=0) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":4882}}}],"partialFingerprints":{"codehealthFindingId/v1":"429ba91687238849edb2d7eeef86cc227b300979ac5c35672cb12cf9ef2197e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could use sign-extended read \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":5212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1116476d115b5cdf1209bb8506f36abc672e58f42cf7fbe779078bd8bf386d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could use sign-extended read \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":5237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3686090cee51c15bb9ad48f3349b8672820a9365ba468d3c1ad371e6faeda6f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could use sign-extended read \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":5257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f006279b491494703385d2d5bcd2e9945ce8276484cb23495ff7888c1ce8bb3f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned write or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb90b6848321582285784ae4dc4e198cadcfd6b4c2e37f117b15b0eb179c4b96"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned write or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a8924982416e7ec0c298c82b3213ae2b80501df662ee2045c0a0b147ba8493"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned write or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0afd6844ea5e5270d1dc099197a2165ddd14cbe30c01b284c0837c689fa2d0"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned write or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae6546c882a92207b8b76e79dde044771d1a209deafcf28d69a04cc3856c9d7"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned write or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"419235b60e8681c48a456c997ed92d9fba99d18b6d0944fe1adf8831c222b7a6"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned write or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b1e339cbc9377348341b8be31d7ded3d56698a0189b9023eafe4619168717"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned read or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":6515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5b320db447e9a6ec2d1d519b0df34876c203b295d05ae5685384a6fdf5e89c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned read or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/jit_instructions.rs"},"region":{"startLine":6527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f608b60d3d15948ae98132eb023795a88943ddfc5ea44703f3444c34225ef8c1"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned read or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d42149b2532692efd2cf7ec895e4615562043403ddb090be20719db925c1880"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned read or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a78661dfc2d27cfe6daec20dff1669c74f2fbd726df00229d03ee3c0d75ad14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: perf: copy less (handle aliased src/dst), use 64-bit loads/stores 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/rust/jit_instructions.rs"},"region":{"startLine":6564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a4ac4c784be36a3d599b0446efcbbb73d9f1c6f515c80fdeb5bd8490e13a5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can probably be done more efficiently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/softfloat.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d817520404c740a02207f4b413e422dc5b50eb8edeb3c58f70b8d35d011b0a0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can probably be done more efficiently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/softfloat.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0f9fe5873abe3b25cd9086eb9ee9f41d0187f47dbcc074d4d7a59cd8919bf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can probably be done more efficiently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/softfloat.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"926e711d428dbe3e95a93bde9ef8489540a44678b882de9ffdb3dc408e375d02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can probably be done more efficiently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/softfloat.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"203b7be33b95b216b1a122ba8e694ffd413c7c2cce178951203864e7d0d2bef6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if unmasking and if this should trigger an interrupt immediately \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/apic.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a526dacf53b711b2eb4c1920a6cfa1d02f79899785009c88e9592fda2c89488"}},{"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/rust/cpu/apic.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf8b18e6bb8f2da2d7670fad9f52e0d35cca4b61c956bdd4691baeab73f72a5"}},{"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/rust/cpu/apic.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dc9f20045c558e3b82732da6eeaaea3f83e37105bc4bf0e52a6e42ff158573"}},{"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/rust/cpu/apic.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf385215728ede55749bd9588fa4256f0dc6b6e4e8c8407eb6785b73b0b7943d"}},{"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/rust/cpu/instructions.rs"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2437b5a01bf372236e446ea71fb6fb9ff9a59fde813b1dd338270c4a33e8e32f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should be checked before side effects \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffd364ce181d8cf95d0d3ec66398d7260607073462012b6627074e7d5c27d91"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should be checked before side effects \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"014701ca825a0919d7dd14851ddf8ebdc3e637d60bbe1a0dfdb1ac2c323ce3b0"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should be checked before side effects \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae831dd73c575dd65fb708c954a4b6f1c78b1916590145da85755323d82ee93"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: #SS if stack would cross stack limit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4b68f002c85ea08bd99e46fde0dfbca2e8b0fb3d16691a47afe7a58635ed8f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: #SS if stack would cross stack limit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc86ee4da042420f2ae8051dffe8ebfbd41c1339c8b2b46d9b9870ce0f66fa5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: #SS if stack would cross stack limit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0685c778e68d7c76f570963cf84d907dcae8f2f2959f6e2df4ccd5acb9990d75"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: with current cpl or with cpl 0? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"52642616f690909ccfa62188e06dbf352caaafb1767a8397d199af4a5b6c761e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx: 0 in v86 mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c9806fa9b7f6acc930e895af7a1ff5eecdaa8da80e67583be9a3a33e0596b9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: This failure should be checked before side effects \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eac0d9f9a0f1fc7d6ca84b226aface5dec0de759e5e5e21c9d8d2637329a0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Write 16 bit values if old tss is 16 bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f308cf62d61833e4d70df490f7e082f415d5b2a3b70180f7771c22b836e681"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check that there are no duplicates in valid_tlb_entries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff1b9ad23109195f097cb3f6c505d04367b548fbdb4b4bef70f04cea7928038"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: There will probably be duplicates due to invlpg deleting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"befb3c691303106f818be04adf80e46351a4cb20649dc76c9e0eecfc64279b39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should set segment_limits and segment_access_bytes if ever implemented in get_seg \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7760bed5335f6201b0c329801b71e8139ed50fc10997c02239f4d302a145e4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could check if virtual pages point to consecutive physical and go to fast path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":3699}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b68b5dcfb9beaf0b19b5ee3a9361f8d9bf0c4fa222375c518f0c383a1457ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could check if virtual pages point to consecutive physical and go to fast path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":3841}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e6b6cb64c955456b8a1dfdbd3d30faace1b6342a876d1e70460c9fe869dd94"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: What if called after instruction (port IO) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/cpu.rs"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a97d163dcae1b251f7bffe168949327982da3a227564f165f3424113f5ed87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Interrupt \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d25ca1c2434a4a02b021e2a9aa73eb337363f46bda1f9037a37fe7a18fb8706"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Interrupt \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2463a530273536eb6afd5c548099fcba6d3fca94653ff71f7d8534ed0a09d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Interrupt \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"242a6266c1902dc87d66bee90ec6ba15c8ba77afc930fd16d4ab1f358ea67229"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Canonical form \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a3928f93a11077d9835bc754eb5869cc45b327ce4934eae37234b559779bdb"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: writable_or_pagefault before get_st0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a220c360b4d6f43ba5beb253921522e9c9e929fcb3f24c420374a9bdd2f37e29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unordered (x is nan, etc) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/fpu.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4eda8e9221f9289074b415669932a30aa6d6a85cfe23de5b53aa2a31fe0faa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reorder below segment_limits \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/global_pointers.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"665ef672e991026b2ff9dae60c82b9098c03185a1b5e885fa48353838767a0fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: inhibit iopl checks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"10acdf7507eb7ee5c3297477f67a61ed8b89b2f4a996e582b7240ee37ee87f78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: inhibit iopl checks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7104506035e0b94974285b97e7237b3b591e9f2c398c96749275f6788691dcbb"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8b6df9d94abece4becb79c9c658cd3bde804bb1a8a61130f79d4a2c8d3bacb"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f57be37b33251527b25d252f430bbf14c73d6eaab6eb1ba21109c28a78555a9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d994f99b4a587d6fe0d374c48dcd248277fa1628ddb910c3be87cffb4c91a516"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a3cd2022b0b60a8bdf6e32510c478785531a5d4fe08b8b2b75ede406628198"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"de83a07f932705927e042ac7a3cf21448d423cf25b4bc397c85487291a2e17f1"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"533d334741e7885bb85211175ac716f924c742927517e360edb08ddf563f42f8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dce3ea610abedbedf0eeb45054bf2b482b1761d4d2f83c679b3fc9215c50a6"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"098b95adabd587a3617b522c3ec5b8880f41fd0d8df358b838e303a1250df242"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2261f950f67fcd4853bfcd7db9d3511a7e33dde39f1c85e54c79d9256313129"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f51a82943934182ad4912d48b46d7649704a441b27c7d7d0fcd90e190ca1a4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0fc593c5a43151769b59ba6ca9afbad27cbf092e94a53764fcc474c934dcfe"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f09ad9ffde4089d3d02d15818693263c498ebee1cdcdacd895cae425efac75"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0cb53b6b33baa1bd92b74d66cd26f3ebe64be43b29834943cfe1da89212ac8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2914eae05c15c42af818241f042f3a08083122ae7c8bd97e3810be8002f3f3"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77536bf6b1a8484f4e0e4ec310ce094790337278ff05c1b361e96c7724d58cb"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dfdbde43adaa3250f8126d9eb3aaee138f4860b916396fc6e84ded3be2f2e2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc8aadb5ab11487dcafdb7719a81cd19bcb865577921534cb35a41e72bcc2c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bd9616bcf2027eac9224a7ea511691e490d35fcc60891a2ca7ed21db47756e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6768130eab80195a3795c5949f15f5e9a288c425fa67d5ddf19f1bfcddf321f0"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c81ff627f32c7ede5d530f17226411aaa983a8d7650762da2eb9a06b09c28a4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccac5094a6771d0d63771656b8e7be152e2d0b4a290e27392e176a4cfbd3e96"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"131b3b7de686c8f3a8b84e32336dc77af827a117dfe7d260110cc85f2d7a31c5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c1886abaa2542107357c4510e1552e62029e0ea585dae239fadee593a085e3"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f82f360b77d59a80cc849e5c80096905b60c6df1f98693f9b4af1745bb936e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"e222503c3e0a7dd23335e57a253d45d64b85ac923d00ffb9779cb42f6be8d111"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6dfe7dc5005550a952836cd236f5e70d39a411a96fa00016cb01ba55d1449d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"078fd1bda7b5ef288993baff5d113a3e5adacb0b9d6b0b075d4520049994e943"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"844fd56589bf3694c064579bd2dfd069963959b69e5b8785e70e1a9c5c34f420"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"409ce195389f9f4553caef9716b7b2049ab5c894007c3158eb34f04a2fd074e4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6439fdedef2362a735239a42fa8474f58512394d5f9990689d5690eef016de3a"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeaa92df3877304aa083d65c67a7b34688457bb5587f610a8ce501d61dfe7a9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2953}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20c8316c85d9dde8ffc90e01fb4439df09102fb97beb19568ef15460489cb12"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"262e59b186c8402d4329ae80a2f25ea827e90511d31399d842579ec29271100f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":3150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35c903c0171b3bf70a8433cba95c51414db50c788a4d128bb78da35ddc47bbe"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2e52d42428e909ad4420d56c3eb22b24f1f64df2b73f3a27f37eb37538ef65"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"721a6122ea5262b0e6ad098eed81f9e48febd467712820861b9b44ec6f3d0fc7"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4069}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8601abb8dd9411681ce2675b0d403362393898b160558472e61762b6053fda"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4108}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cda4398d5185c3fa4535f01a6eb078ff28c8a67248f30c5bb502d89719e462"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe03b300e98c17e80583313e0ea262f59976d7d242ca5f36786b3d9a2bf64a00"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a70a7a5e06a5dc1d8c564ec9d892c62f340fdc2b7ebfa1cc6115b3ca662ea4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4312}}}],"partialFingerprints":{"codehealthFindingId/v1":"295eeb534e8ea061b1fcb50fc517c0589d5a6cb844cfa01f2f76664fbb01a656"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93bc36d79fb55a11cb06d6193178387fe9ae230780d99db4b81a598dc9e860f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4369}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a415e5504b6ce4f4ce68f97731133720c94390a4224ca263257570b6aa35e6"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7d98ee4076bad27ac5221e8f98548d0dd6a9009843b32716991b2d16adc78e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b137df1158476e3ab66f2f25d197c111940c6ecc5a79faf86e2f42aeb19df75"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3bd920e37143d3e9a383a21dc12cf239ace422ef5a3796dfd8593b35737c1b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5976a57c73c987e2b8c04b1236158c83a84e0c334baaa11e7f78c21de7d6bc"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4495}}}],"partialFingerprints":{"codehealthFindingId/v1":"002b034f5f7608a3b2ad41405a74925d9f6ab2b5a0b786b1819758d220831d71"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef988df33087823962a40effd1a2ccac761f1659887eb0f067cd689675075f0d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4551}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e388f885f98a522c77997ddeb192bd43a5cdcff30692004bb7013d19e0d9bce"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9562cd5b8445de051d36df7a733c2cf21ccc695b1007d25c0a8e1d308f11910"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4685}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fc4bd46937446070aaa1f502d91184b20edcf9c778c0dfa25007610f38fec4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8783cb012932a12d6e35cfe26aa416477674f1cd1e95ed32473926e934066bd"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4747}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c624a30b41b7e275132b7ac1031a456ee755cabc3c2ecd90345eb1cf644416f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4773}}}],"partialFingerprints":{"codehealthFindingId/v1":"5535afc948ebf398b230384fe8baaaba1da68a1902479efe59c9c8704427467c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4799}}}],"partialFingerprints":{"codehealthFindingId/v1":"396d808fe1f2477d98f41267b2dbcd3899c0695f62f1c957ea14019786102c04"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4830}}}],"partialFingerprints":{"codehealthFindingId/v1":"d188aa4e0f0999c7004da7363e782e30d2294432743b36835a787994b0822591"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4861}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c8577921a2bede78504f9bb5a1f572db2aaae52b9a11a149e66a058f5ef97d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4887}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb4646c6328168c4fb0878b417044a39a94fd93064239b30d24cf05113c8502"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4908}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddce2eab94708646ce85e72b557504a9d5c1a993fc86f55ebc85f9057b1a7f9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4927}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f706fd95344c965940c0e085a40e811c7406d094688ff3fd5567b0ac45c921"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4946}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28c1264d26b98681943ad919d56c62fe844ec5ae87877ff45d891a05b3d1770"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4967}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d86c2036b7e278fb9162338e715fbac9d8da572f6f7564b0f27e00e45f8a8d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4999}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7318cbaf9aa42f39bed06640ce1d3be509bfb100cf858bbde85ccf465b8a586"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5031}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d0765e1456c48905a845f948362d0fd1ce93ab1d62341000f35d8f07e5a2d5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b158ae4aedfe2810ea30bb935d88625e7df5d9d22999ce2b934087b94321851"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5134}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e7779f0efd0f796fcb51d067e4441fd84c97e8cc7d2939f9bcff9d81e0525c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5165}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9b571778e6037f05c9d169134a03abbf0b84821598c0666acb62c88051bbe8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5192}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c75d87d183258ae886a2225c90c7a7ce2c2565bf9d0639061a7f0f6bc49a7d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5221}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a37f60a85e1911d08847ccae2b3f8f716f01b061b1fd35da41c664dfb19d85"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b116e839ded6ef11f5c76906a503c72081206104fbe363326b235d96371c586"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":5283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c98623f272766adb61f84be6ca6fcd7f13ef1be1ccdef3aac04fee721d55496"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b18394b30028c08899b94465abdc40869d3db9a666ac33e4e39fe3217c599e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c60729c49a1a62cbcd0dd23cdbafa7c7aaa6cfe458b03cb0b5b3dd907e54556"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1cecb7573c6c9aeb2f8cbb20529539d110903a6b9dd1fc919261744870b886"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Aligned access or #gp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22eeb65ca790284227067533278d38132cd6e92634b947c20bc6ef2cc426ea3"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should round according to round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93a64379ea1c01e99e8b95289c1d0053cc59df29767fd8b30a84e40fc389630"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should round according to round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0215048d52c91907dff99cd913c3ea94e653fa5fbfa8ac58df117446a6a352f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should round according to round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1e0b04bd5ba931427b3e944f05f4c8601882ea61e9473d6d18881cbf9c661f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should round according to round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d303dac5a15c4c2325ac397a6f1e63298a3d4498c07be9f3419b0230280486c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should round according to round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"885d86e01064eb9e5c7918c54d14ec08390944caa2f8cd9f0362766fcc028d77"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should round according to round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce31179a54545304658a84a8dd626ed9b5e07cd2b75fa2e1918574405b64628f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Should round according to round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b559c522fd219e76fc6cebe2d3b8581e1fbfcd0caf83a105585f8c09f0474e2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal on SNaN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ba1cf3511eab1463d3e03c95cee7386aaa33e9ecebb5f90d3c6e3ba34a0a1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal on SNaN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3843ac45602ab252b51e835469b4a9d0951e4f949e24fad163ecf3df544036b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal on SNaN or QNaN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae75732835df130634e80e3aa7fd787de8ac5794d2f9d6a034221737d2df54ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal on SNaN or QNaN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11aad36d9d769a99da4120ce73ccc99c0af3527223a49a97b2b3ec214df165f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: These conversions are lossy and should round according to the round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57a487e11500ec687dc552a285f537f34695314048b1d510f56a17c57ce3c31"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: This conversions is lossy and should round according to the round control \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d16cc36393337b0afe71cd56e8f2504c06c3579ceabc18362c34576a959986"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Precision exception \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c5d5391c7f3646eb264854f98bb26d311eb11b3cac89056dc15cc083f94be"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Precision exception \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83c69ec49f7d6b7075d80332f2d7d4f9622253235fb6543b47067c0a0b81582"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Precision exception \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":4623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5335e3c3aa17df98c1c9857b4a12262df6251b2a9d325637f021e2a53faff99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fill in with less bogus values \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/instructions_0f.rs"},"region":{"startLine":3258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3375c37144ca21c075111f2984e8f103a46f02ee51b95be8ec61b4a6c3441ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signaling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefc11c070a0cb9415a6ae2cf39c2d2f93c4f6f835dbb9515c4b350e1da9708f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ce07aa73ad48299b4ed3e1d87d4b4c37c5bb2e7a65f96c79aee56321a32372"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cd335b4a033aee4186553a8ff6a6ae23bf409c5faa681d8a998f19018075f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf080cb75060a56cd0d7bff261f8ff43f3862ef7a039638faca6b1a230f3d2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Signal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/cpu/sse_instr.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e13d289414250637d1d2cac29af6ebe9c5e058f23fe9ab60d970e9d0401c423"}},{"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 (68678 LoC, 149 module-visible types across 11 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":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8109dce38defa2356a4dadc0d0de54d2a3068d55e0fa05a6643a42adc1a4628c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"774e84eaf65696bacc627959839c1af1927b88e5fcbe02a78f7a8b8671c240ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"311f2b1dd969a2ef73985fc36dd91e65e3d6a6cb49a0706cd68e381199f12c7c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e22fa714af38036b109f9493501c28af262c3a9a1a2d30d80f7ec23c8ecb75e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d354b22b50c0d5d5bdcc7f04e274e6635ef06c4b51bb05c6da25ef375f742f8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b15e7c4516957eb0ce628a71875180462280b3da835590c3e3ea26dfe36c7cc0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b20e967c826ed66c63b82c92c1fe466adeb91d3667c07869b2360d69e7c3fc31"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"423c28a336735a1d8a827841c9d2af0e0b65c168fbe8f713b3bfab70ea322608"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f96799b4f9e4adee6b4ce0eb2f998eab177ea568424ee7c1374e5e966367a394"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"455c3dfde8ad07ea500841ef719e76ecbda00661d7b4a57f25b998749bf29da1"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e5b5ef8b716342f87977bc3b7c701df50cb1be2763104c50d566bb82c3304c2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75478bfb4c4fdfc5ed8a7ddd4845114b53043215d740355de301ff3228c3de53"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf7a173b41a2973967a2b781e0935c76d1a06b39c3aede47f095f9e5e8a3a1d1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fe67e1b6ddb94d2c8ade5e49450b155f6fed9c0548c70444ddd06503ff1ee1e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77d66818c64b0139e200f7480204fc0e1d77b7e04ea0f40cddc6b0f75417e878"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd858f5cc6c9a76c666f3d932c6a3411777ede472dad937a891e7948ce065241"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c9151bbf5dc0ef6c86afddac25a28a3976529e642142aa48575df413e1bbdc1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ffea189e3eca866ad0a70afa54161ac39cf62d8ce5a9661a984b2935e854e55"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d0b077c2eb53859a8e06cfe67dd1728b22f4dc5674304b9259f9ddadf9fa9f8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85e1e288395f5a33de5b41bf612c55c73fc1d9dc502e10e637d34b084fc7c9b0"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a776b9c096c35eb3fcac705c308ddf50318cfa3ec5a535ec1307defd0bd3d191"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d77a7be5b6486868577cfa4c8eb2ecc6800dcbc9ffb0d771a918416ec169030c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"334ffee6f8f1bd53beb10a056d0b2d37aafba1c620e5ec256212c27ec5ee9a40"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"194f4092b5a07e071884976b648aed4aec320ce251881ae61466708138d9d220"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4396c53e93ffb840440b2a7aaa56609c6e00b93fc23a489fd59274a6845a2d83"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee49da790bfb99c882457a01284324b621510a84faa2c360250f8ef50e817b3d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25cbbc8b1a2624988bc8c5a3014891a941401bc16d42db73ea2559ba1c4480be"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d2c2ac6048b79dd205c1218e3b7b0d152a6b867aea294737070790ae66e7dd3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"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":"83624e2a75b102d656da943ab10c203006d969612030d1669428c03d4067940e"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff13941349f2f53a138c76fa623570b50f7b9eb2fe811d0d7d0135e4b6bdbc80"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6a3fd8baee777e4192cf59f9ec765d7d452e010af5d92af60ae01b208acfe59"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2761b53a1c51c6bf6e937b76e401dd5f2572b1d230a7b4165b055b5405e578b8"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dc3a552cba43e38826ffd956f0b642806fed25936feb132743f012a547b9f1c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d773addbc517c0b8b547f885c783d01778108747e7c09b2342eeab1a3ac62c83"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a166a2d6ddfc3c83d4da84c157410b962b8a69c6da3e1a1eb27c87e207053c6"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bfa333ca749321b6eb5241721d397995e2df6e3214bfd19c375cef64a2ad33d"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82360b4d3c9face657a6d3b5f3a1e8cc54f0bdad7d80deb244cf58d33380bd0c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"658ae674a2afc4d7d5541a73bca930418954c33d3fe04cde00ed5abd05b03c81"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"967456a253522616090057a45e848d517c628e25c2836ba82cf25bc36040f612"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edcc3e9a851e0a2d612aaab62998ac8459af213ac804b5584397fef28c733b11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68ec08ec08a5d643426fa851936edfe64739a573d8c5e6b71330f072a6a1df27"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75dcd0796a24259c58c847dc57051cfc4fb54f2963ad9b0e24dc2574f90c00f5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5806b36931a80be8d9c6e533d5135b65188a4f7b8158ddca2b8ff37a6bc1740e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e20940f26888262e0ef548f0389c88f51093b0bdc97786d9b7bb1c991f0de61a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfcbe1243c659f9914d4486a17ae5235dbd0911082e75ace33eacc937b72166e"},"taxa":[{"id":"CWE-527","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-538","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3adeb5ca433f8377e0513466abe226661632e2c7a65ab03d48b79033987746ab"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"c790f76cf70ef3b7e11b2b2e046aa998549442297137ee1873617b41f8d8e165"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46eb56ca90f14ff58240ac181de64c98cab210a78b41d8e834bd882a2763a646"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"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":"a0253cdb433485d93f1259fe935cad7c5df0486a99bae72ae65dbbacb158f6f3"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"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":"b9f2934c4626fe4d4665c1b0de5a6762c65ce83a37ee54b35f45b9a42ff2ca8e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d646049eefcb7bfb780e6eef735c5b0adb6c6f2b39ea3487f1982dc67c153789"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8483834da5e4bbade3ed9904a70381e97bb2c3ce407dcfb9d5dcbe8c440fe72"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 5 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/virtio_console.js, src/virtio_net.js, src/virtio_balloon.js, src/rust/wasmgen/wasm_opcodes.rs, src/browser/filestorage.js (7 orphaned of 83 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 83 of the 109 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d656694dd26e79299d1175955e4ca82a3f9d8cc5d8f7509ceb20407eea8589a9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_net.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"984d9703bf4ad0889ef30286e38e1f2fb62f7f4e118acb901d72db19d48b7645"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_balloon.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c315f8e83956c705ae753eb1d26161ada5f94ae076b4910eac182d623a861f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rust/wasmgen/wasm_opcodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c444aca0b691dbc98a68e2c10dae032e07b76c468d33d8a35491b30d370666"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/filestorage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ace7eb1ea053afa90f7db585736ea46b779ebbabebdc16e67098c0109cce9f7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dummy_screen.js \u2194 screen.js: \u0060src/browser/dummy_screen.js\u0060 and \u0060src/browser/screen.js\u0060 change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00607082c552\u0060 Fix graphical vga mode scaling on loading states (#1576); \u006018ff2d85\u0060 concatenate strings without using arrays; \u006007270db5\u0060 inlined and removed function to_unicode() from lib.js \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/dummy_screen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6953ecfdf6c86dc00f5dd28ebd8702e180d2df128368a898935b024b1d17d35"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D43","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":"ca77df8ac0ed56a2e42b0923be81cca477f3174e98a1dc599981adac6a376eef"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69c03ba2960946eb240339f870f37746e0b823be160471c2a0b9b632684a2ad"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d061e44e46e2f1dbaf1375aa92340fc1a756e0c1343e25064a722372c3fd0efd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45f91a582858dbd0ffc12049f66eecbc4e1c51d09234380a68141659b1e4bca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0c7ce54e307a505b854147bc5d87715e4add67baa97dbecdb7c5667e5bde86"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b179a0b60cf89864758ac6f2584dcf8b12d30b842976ac5e9f1b5fd0857c2b78"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b3c0c70545c5bff6d4fd687e1b5c234f654e9f231fb05b0655ea7647e18216"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a18a6fbfa3ea7efd685ac80062416ce065838b6c37588048d067a50eb2e53"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9942e9c417ec1c6a058d0bfd16855b5b5fb0a4a88557c22c71ff8416b49f61c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeeeb6facf2a00870da05b1069bc5d919fb9ab6b74945c9a4724691c828b998"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c03112092084821eb10323780c41f92cd64c7f4713debc46d9031ab90eaa76"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c4587b5831e9d9da4b05f6bb12d9a8a817ddcc0ff07809f91bca0b3a52697"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"390d88d6001f6102702f6b23cfad17e48b5ff45ab71c42cc4b7f27dce17c2b73"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1e7e732d05c4a67097fc0353a4ced077b0b5d2338a355835a5ebf09806a485"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d59f1cfbad15f539ceecbd2a1267959a9b75d6ed6a6d9228ddb52b0dfbb39f"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6715d7ebcab0f4a8ce7cc26736268a15d5558174adc588cc6aadb0f0d66cb179"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5c49211bbe25d610a3d8f112e120c666280d4fab836e4d41be8ef759f63be7"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug.html"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f888ad680d6ad7825658074571b1743980694a2a99778554046d7811ee06259"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bce5723cde77e80d33241bff8e76fc1b869a9dd2620ead99e7f896c23c1577"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b1c3d820d9e9e32560ed3a5cf60eaf2ec10e70ebd03a3a2f15e68208c8f57a"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2e219a28af18ac9184f7b67752948b3b282a8f0b3b5f31a96f24b0de655cfe"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ca6546a0adcd1a572a1e365dae1d1d85e9bfd974a6a5d482132d14e12c3412"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb19026bc3360802c5bfe005f40b8bd0966c9328b56e182e668985c79f86b7a7"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3571cdd5aa46c0d5fded33153d6edb2058032776cd7e673b5d6b10af4e5cac30"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.theatre_screen_container\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"v86.css"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11e44ac3c13c649a1e896d3cd2b8a18af2a98329a5afc966aeb0720daab0aac"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.xterm.focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"v86.css"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"998e72f97d548195d5f23f1df2cd96216339a5ce701694bdf40022a3cacc5d36"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (an accessibility check that can read your UI \u2014 no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060on_data_http\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fetch_network.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4c85cf4c8f4bf229084720dd53fdd0aefda82a89b27c67dd7a7f20b76c968d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060readWasm\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b04197c572bb341d56666a0dd6ec43a7358599f426df148dc4e7aebf2acaf8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060allocUnsafe\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"db63adbe37a81eee876b76b207dfd8f7fef746489466533d7e1b7fde3b40fae1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"af89ef6102ed2fa4dddd6e75ebe76c9175957ebc7efb9e2c11d79b7da7eaf8bb"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060hrtime\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"90251fc97114e619be72b718eed91ebb2e3a1d9b088bbf0a74ee077ef1aaf326"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060generateNames\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0714e928a5f35085093ac3de6e3215917d41785db4748edb27c2eafc0409e02"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060applyNames\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"202a5e1eda27215a5775b42467dfb1efd92360189e96f09784641f8c82cd7af5"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060toText\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63299a2f0055c96dadb7f5384cd9b6f2c4ec2d83a3070b3e6f2267d1a6a1894"}},{"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":"M4","level":"note","message":{"text":"README/code drift: tests/Readme.md links to \u0060kvm-unit-test/\u0060, but \u0060tests/kvm-unit-test\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Readme.md"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6d1cbb04941f1f3a3ed47ed7547744b2d09fc4f21ceaa9f2f3ded82c5d823a"}},{"ruleId":"P10","level":"note","message":{"text":"No explicit versioning: No explicit version was found for the npm library declared by \u0060package.json\u0060. This check read a semver \u0060version\u0060 in package.json, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library\u0027s directory or at the repository root, or a semver release tag (or a Drupal \u00608.x-1.2\u0060 release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca16841b9022c21d19c30780490755d36b90c625012b540347d3cd3c5f1bcb"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 5396 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 95 plain JS \u2014 the untyped files are gen/generate_analyzer.js, gen/generate_interpreter.js, gen/generate_jit.js, gen/rust_ast.js, gen/util.js, gen/x86_table.js (\u002B89 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (7 clone groups): 7 duplicated blocks under the repository root have copies in at least two of the sibling directories lib, src \u2014 3 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6bcb6ada48bc3a0620f39624c9ac57f6c94d92dcdd5885c7e038d207c1cd3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (196 matched lines \u00D7 2 locations): gen/generate_analyzer.js:13 \u00B7 gen/generate_jit.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 1164 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4219509bd9afd6a9fc9ec6767fe039d184ed1fb4c02df1ca102afd04ef4ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (116 matched lines \u00D7 2 locations): src/virtio_console.js:13 \u00B7 src/virtio_net.js:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 661 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcddfc40eb9fe47390e70498de59fa77a47fda52e054f294c0a365f94d90775"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (90 lines \u00D7 2 locations): lib/9p.js:1054 \u00B7 src/browser/network.js:43 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24bbfcf2bffb66787857bb30de12e4677245b98929c7161e4a959926daaad12"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (62 identical lines \u00D7 2 files): tools/docker/debian/build-state-9p.js:3 \u00B7 tools/docker/debian/build-state-raw-disk.js:3 \u2014 these 2 files are line-for-line copies of one another \u2014 62 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/docker/debian/build-state-9p.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8724ef62d510a8b9f99df68bdb298c4c7ffd97eb0feb0afc7726a60f87cc74e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2 locations): src/browser/ansi_screen.js:71 \u00B7 src/browser/dummy_screen.js:55 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/ansi_screen.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b899915ecd712b3a9fc17c59696a5872ef07efe57a5b0b8dc6e631b07c303b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): src/virtio_balloon.js:80 \u00B7 src/virtio_net.js:93 \u2014 the two spans are one implementation copied and then locally edited \u2014 296 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_balloon.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d5dbaba9f8c86d4ebeecf79fb49f378f79ffde69deccbb199ed51fbb42769a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): gen/generate_analyzer.js:337 \u00B7 gen/generate_interpreter.js:330 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"219fd4b05dee682255dc61cc07bff9ab03de1334929a3883b644b2700c4570be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): src/browser/main.js:2942 \u00B7 src/browser/main.js:2982 \u2014 both copies are in the same file, so extract the block into one function there 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/browser/main.js"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96778ac7ba9c9337c3a4ffc72f7e24496e13e3c85a4d6011d8859881cf75499"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): gen/generate_interpreter.js:446 \u00B7 gen/generate_jit.js:530 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d96027e6f67b86be04470d0821162ad780a895a629e2b14dc70f458a51672a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): gen/generate_interpreter.js:385 \u00B7 gen/generate_jit.js:469 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"896e9e73c416dd64cc3465af806a1f5501444dc34acadffedd96b4ac02c331f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/ide.js:2309 \u00B7 src/ide.js:2440 \u2014 both copies are in the same file, so extract the block into one function there 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/ide.js"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cb91c8126d5a3eaa414b4cca1dd82278756ad28b8ba4c171f6ae92e76e9cf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/ne2k.js:675 \u00B7 src/ne2k.js:709 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"284bb8bbbcb53a954916b2554f71934ce6f973f7e9a6125941c77850e1f10e8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): lib/9p.js:933 \u00B7 lib/9p.js:1005 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d37e0efbe81ea2b0101a0f2f9e831486f8295642b220f4027b78449943dabfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/browser/speaker.js:251 \u00B7 src/browser/speaker.js:367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6215dfcedd138d681a5158dc375a5e6af2a824a5832c319f8d1a970086cdae20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/browser/starter.js:946 \u00B7 src/browser/starter.js:975 \u2014 both copies are in the same file, so extract the block into one function there 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/browser/starter.js"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb2d2f919e66d197a22f6dbb53048f0879af7e420a0c08234b4f4740c37535a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/ide.js:2257 \u00B7 src/ide.js:2403 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"909e149fa2aed351f75afab1c1556364bcb3159221b04e22dc8cdb5ef6857bd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3 locations): gen/generate_analyzer.js:448 \u00B7 gen/generate_interpreter.js:446 \u00B7 gen/generate_jit.js:530 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"386a29ab9b4fe4c32c8f1ab57cb94b0c2f51c0f5a76a5e5a5c5e26911ceeb0ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/virtio.js:1438 \u00B7 src/virtio.js:1480 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57f107f315fad7fa7804a7d550d7b4b436e1be498d38363a41e6903dd50c266"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/io.js:92 \u00B7 src/io.js:126 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/io.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60694caba36d8fe88cec16781f0539ecd991a88692bb3edefb0141849624522"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): src/ne2k.js:838 \u00B7 src/ne2k.js:924 \u00B7 src/ne2k.js:974 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3fe5c1314f7751d87abb4a50b24e7454368cc68e8ee232bd4940f9675f0eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): gen/generate_analyzer.js:420 \u00B7 gen/generate_interpreter.js:417 \u00B7 gen/generate_jit.js:501 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a62d94a6486480ee20ede7f66a30106c922cfc570ebcad9754b278958a9229"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): gen/generate_jit.js:298 \u00B7 gen/generate_jit.js:339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b2b537664d0f39e3b74438406c020423a58ac10a0c4c57ba54f0cf12e53ac9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): gen/generate_jit.js:493 \u00B7 gen/generate_jit.js:556 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"859713e4c203502158d073e3c2431b38758b8b168f8c367f20a9e29cb3d42bd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): src/ne2k.js:542 \u00B7 src/ne2k.js:950 \u00B7 src/ne2k.js:1000 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54503736244e0a014cbaa5e2262ce26b295745abd97d1beac3cc3e3231bbd99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/browser/speaker.js:807 \u00B7 src/browser/speaker.js:908 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"0772786ecb97fc609bd6a432364fd5dc10c2df55bdf9db7683eefea64c67e5fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/ne2k.js:512 \u00B7 src/ne2k.js:561 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c6ed594c8e98b41be594e63a85c83c260206b50e7a00d0ffe60a500d85367"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/sb16.js:977 \u00B7 src/sb16.js:997 \u2014 both copies are in the same file, so extract the block into one function there 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/sb16.js"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0972e4e3253b0f60dc9326d8a4fdd7dbf942588909038182e547b8a9dfef93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/browser/main.js:2138 \u00B7 src/browser/main.js:2157 \u2014 both copies are in the same file, so extract the block into one function there 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/browser/main.js"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1338f136ea262ae420f0f5f1366529f9e2b6d0a65e21de2d3a0c0c9aafc2c40e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): src/ne2k.js:753 \u00B7 src/ne2k.js:788 \u00B7 src/ne2k.js:883 \u00B7 src/ne2k.js:1023 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1ecc6ea409c505b28ec98a5959262c45fe63d2e1a0d6673d3fe641d0580b87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/buffer.js:429 \u00B7 src/buffer.js:649 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/buffer.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90c82767999f3a9b6a8a7db4a14b88de389ef8a40a87e3400e30a5f2e66cd20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/elf.js:141 \u00B7 src/elf.js:158 \u2014 both copies are in the same file, so extract the block into one function there 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/elf.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"154a16c6471e217877ce8ff51880fc170ad4ec301db12cdc9437954ccfcb279c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/io.js:196 \u00B7 src/io.js:240 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/io.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dca3d5bb4f7d84be5cecc1ab9c48dbb2b190cb2fad57b966d0f9ed47d29a9ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/io.js:354 \u00B7 src/io.js:371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/io.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fd65a650c42d8d4689348b18068545c5aecdbf65f561e3bc1fe2b5ffef090c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/ne2k.js:447 \u00B7 src/ne2k.js:483 \u2014 both copies are in the same file, so extract the block into one function there 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/ne2k.js"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c599ecebe351063fc25ee14c6cb19f0889bff6558496bc5767c04bb336fc937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/ne2k.js:596 \u00B7 src/ne2k.js:864 \u00B7 src/ne2k.js:904 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"4534d9e5b0e50a8d485c31430516bc53acbf252eb1734ac384dd4b153fc42c9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): lib/9p.js:348 \u00B7 lib/9p.js:727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"395821cdf913ec27fe990f692c5e033f4e738963989e39693e227087823e710e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8 locations): src/ne2k.js:575 \u00B7 src/ne2k.js:758 \u00B7 src/ne2k.js:793 \u00B7 src/ne2k.js:848 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da15ff48ec5405b01bd2ca92c0c1a9a47d508f5eedcfe94a5f5ccfdd5ae391a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/virtio.js:378 \u00B7 src/virtio.js:503 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6753814c091936fa9af9aeb605c9bf95b05006316e642136d6fce09329574e3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/browser/worker_bus.js:23 \u00B7 src/bus.js:17 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/worker_bus.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b27b435d88057055f626f2cd30d66a67adeb3249b86ad43b902c50110b142b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/ne2k.js:733 \u00B7 src/ne2k.js: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/ne2k.js"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"f056caa0833b0814ad5507a0b5aa27f8b60d0573aa935d511809bd45d04ce681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): gen/generate_interpreter.js:345 \u00B7 gen/generate_jit.js:429 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"8532a2aa4221987e2206a303009455c43c3f1c1139fb9b5ac41b268abbb6f52b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/browser/main.js:2276 \u00B7 src/browser/main.js:2288 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"88470c0ac1d54d6ce0b200b575e7bb0709c44da23eeeb62116f70ae2fc9b0cf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/io.js:312 \u00B7 src/io.js:326 \u2014 both copies are in the same file, so extract the block into one function there 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/io.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce0fe07c598e0aabb64f9c42cb492ea10fe3b09c021b3cb5033e0ef207e293a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/ne2k.js:1157 \u00B7 src/ne2k.js:1205 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc452f3e96461c0702e56998082c9e4a770abfe25c709cd6ef7fcdc23d0dd1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/vga.js:863 \u00B7 src/vga.js:921 \u2014 the two spans are one implementation copied and then locally edited \u2014 151 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca9c427153a8fe312c4c69527bceb8f857f01292ec8e847276938bd047896b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): lib/9p.js:214 \u00B7 lib/9p.js:945 \u00B7 lib/9p.js:1017 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9956115847f35718d74ba89a532b044532756174ae7da7d548425dcc507808f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/9p.js:898 \u00B7 lib/9p.js:985 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcc406ac82cc3186ccffe6f4b8e67b1281b1dbd859e504f581beac517f7f1f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/browser/mouse.js:73 \u00B7 src/browser/mouse.js:90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/mouse.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66621f74ce93b84b8a36da1fb4b9e88716fe32c2674cc2071d572078a7799e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/cpu.js:1620 \u00B7 src/kernel.js:217 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b35efcdf6c0e50a8fe4b0bbc36533eadef40a017b6afafa632b11be44dbf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/floppy.js:242 \u00B7 src/vga.js:124 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ce5b854ae5e3511c4205e714256e593052bb4926a333de393fb9c3ef104bd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/pci.js:54 \u00B7 src/pci.js:67 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pci.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"104a164d9f46245e006c6eeaedb89b7e9ca550a31dea6335845ee1c562252ec1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): lib/filesystem.js:323 \u00B7 src/ide.js:859 \u00B7 src/vga.js:72 \u00B7 src/vga.js:142 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4493b31a6ea127156632f120b1be09e286621041bf5db2ee3fe93e649c386a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/browser/fetch_network.js:379 \u00B7 src/browser/wisp_network.js:233 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fetch_network.js"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a889753f4bfb49158561955fd2604a38f708a3aae1ca98cf1b9379bc75a37e5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/dma.js:144 \u00B7 src/dma.js:161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dma.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a748fe3a665c1c6a104e5ae52c3686388aa44ebe68c60cff7e3a45ceccdd63d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/dma.js:175 \u00B7 src/dma.js:187 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dma.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"01796aa8dfbdd9fdfd92c2441a433f1ab515f3edadc6c006ac67cdfa11c1ff50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/ne2k.js:91 \u00B7 src/ne2k.js:148 \u00B7 src/ne2k.js:215 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"680d13fe9263b927772a96ef4d763d6d1169efb71db9c9f42e062a0d63b3d69f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/pit.js:72 \u00B7 src/rtc.js:103 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pit.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"477f3f5c2a93456bb9a714728a751c259f82224a85abbebff486369545d3900b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/sb16.js:191 \u00B7 src/sb16.js:216 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sb16.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"acca69a01aca4e1426510f79a4c94711eb5a89305c77a32d2276f7632d66c392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/sb16.js:1013 \u00B7 src/sb16.js:1041 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sb16.js"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"6494ce8ec9578a7dab89d01415973b543ac303152df9050389ec2c681e2be935"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/uart.js:334 \u00B7 src/uart.js:344 \u2014 both copies are in the same file, so extract the block into one function there 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/uart.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a67e134a604d3d9c32dc9c423b192d02d989d7736aa1e5559c75f58e7ee5023"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/vga.js:1925 \u00B7 src/vga.js:1939 \u2014 both copies are in the same file, so extract the block into one function there 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/vga.js"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a102257e3448593e8ae8e7bd352a266dda029df7b2314813262c34c2867612f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): lib/9p.js:332 \u00B7 lib/9p.js:707 \u00B7 lib/9p.js:773 \u00B7 lib/9p.js:844 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0e99385c0a68038a55befdc4a6ab3424fd488d830e129589a9609e60a1e10c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): lib/9p.js:371 \u00B7 lib/9p.js:390 \u00B7 lib/9p.js:420 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"54473e6823a25b1c0a404af71c021103a679c0dabd40c779e9eca7123e98fe67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/9p.js:555 \u00B7 lib/9p.js:572 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3e876f2c5f83cfc35649ced75533c83720c48bc373558a9122a153afd03e54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10 locations): lib/filesystem.js:1693 \u00B7 src/acpi.js:205 \u00B7 src/ide.js:2876 \u00B7 src/ne2k.js:1086 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 10 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb32230c46171e675e797b2f1fa58d3b1008f05024410abb6879a6bd3a3030ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/browser/ansi_screen.js:56 \u00B7 src/browser/screen.js:411 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/ansi_screen.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e49cf495d939ee36e297d84db00695d64fa6368369ba000afe4ef3c7e1bc3fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/browser/fake_network.js:801 \u00B7 src/browser/fake_network.js:813 \u2014 both copies are in the same file, so extract the block into one function there 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/browser/fake_network.js"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"a150aa994d016e038af4d00c929a75f6deb82edf34e12c4eecb4341cfd34fb7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/browser/fetch_network.js:45 \u00B7 src/browser/wisp_network.js:33 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fetch_network.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2162d5ef4f8cdd6b2115cafec530dbae5826b7e2d19f96aaa972d396f4fe2efd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/floppy.js:1065 \u00B7 src/floppy.js:1471 \u00B7 src/virtio_console.js:251 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e21982f8c5cb6c363ba71aa869638ce4181983add4a8dc43dbda5d2b7cd8afa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): src/ide.js:431 \u00B7 src/ide.js:441 \u00B7 src/ide.js:451 \u00B7 src/ide.js:461 \u00B7 \u002B1 more site(s) not listed \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/ide.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"f603c71ee5a26cc7db2c543c4ce4bb97b4a5ff2acf58bbc5f83198be66fa7092"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): src/ide.js:509 \u00B7 src/ide.js:519 \u00B7 src/ide.js:529 \u00B7 src/ide.js:539 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd5db0ac331abc46a3eb0591cdbabad17dd10fc88b97640203de83a8022f215"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/ide.js:1210 \u00B7 src/ide.js:1220 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d0edda3da04b61458555fda57920a312adc0cb91976cc3f4da8ce54967e70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/ide.js:1807 \u00B7 src/ide.js:1893 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8a6c26a5461c2090add05cfa4d01cb40f517d5e6b49e3a11eaafad08b7f0e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/parallel.js:88 \u00B7 src/parallel.js:101 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parallel.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41b46d019cd48968babd9d3307bec67cf762c30251af5195c262df4e53589e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/filesystem.js:545 \u00B7 lib/filesystem.js:566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df9fb3c62a2cecf439612efb31d6d5d50edccede222e5e350e45f52bbad94ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/browser/fake_network.js:309 \u00B7 src/browser/fake_network.js:424 \u00B7 src/browser/fake_network.js:1446 \u00B7 src/browser/fake_network.js:1462 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3c1f1c7fb9d29bc1cbaa6a5e679f299fd2790408f37a69619f87819f126c26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/browser/fake_network.js:401 \u00B7 src/browser/fake_network.js:1467 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"313ae35a047d00754d132a43951632d49291967e8f8d88effe4ff94131e9c13a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/browser/fake_network.js:659 \u00B7 src/browser/fake_network.js:681 \u00B7 src/browser/fake_network.js:737 \u00B7 src/browser/fake_network.js:934 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f30adb0e87f1de8f3430dadf6835e18d1dec2735c11eb75d5da7af753dbe863"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/browser/fake_network.js:840 \u00B7 src/browser/fake_network.js:898 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8483519a87ea0a0c190ecde512489d14653d5f3a68a79996bd957a210c31871a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/browser/starter.js:1082 \u00B7 src/browser/starter.js:1096 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"3813316bafe26b532549998ad139124ca37ed9f143247219aa05ebcdce449746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/browser/starter.js:1254 \u00B7 src/browser/starter.js:1276 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"112fa95a5787b951d4a71c664111cb9593dec06e8c81de3faf6b98d9b01937fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/ide.js:1847 \u00B7 src/ide.js:1910 \u2014 both copies are in the same file, so extract the block into one function there 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/ide.js"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c126839a98b5df4724f7b68e46092432a2f694ce118353a7ac5c4437c37a4e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/ide.js:1958 \u00B7 src/ide.js:2364 \u00B7 src/ide.js:2488 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"0950772968b73916eacbaf355ac0b77714a726ecda5292c2e6196afef3b594b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/ne2k.js:121 \u00B7 src/ne2k.js:254 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"956c6af94976d7bc432f0a6967fc0e999136a34d1c2befa77bd3c1d62e8f7dd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/ne2k.js:354 \u00B7 src/virtio_net.js:38 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc74e45b95c88cbae6ffe084cae63902dc8dbdd3ccf948f721ba418eae6a752"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/uart.js:123 \u00B7 src/uart.js:133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21e35e161a4313120bcd95cb6ec62658668c753fa0a3f710dc42a2e042f5b99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/browser/print_stats.js:249 \u00B7 src/browser/print_stats.js:262 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/print_stats.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f75ee495b542affb1118bb4979b01c5cd73344958090b404dc407c109f5cc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/cpu.js:271 \u00B7 src/cpu.js:282 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee549563148764234ba4715801c16bd97833eed7712dad0c21eeb88b741e679"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/marshall.js:18 \u00B7 lib/marshall.js:25 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marshall.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a30cca31ba3d08827e3baacf30383a5a7bdb02200970d9b8b999237768621ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/browser/fake_network.js:872 \u00B7 src/browser/fake_network.js:917 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"794443f89ff1a061c78e90cc33bb4056677772440df17ed72709851905e51ca6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/browser/starter.js:1546 \u00B7 src/browser/starter.js:1557 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"37564e02daa5f2b439122e84d5e34b5f3988167a61cc94432adff306f67b3c56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/cpu.js:177 \u00B7 src/cpu.js:185 \u00B7 src/cpu.js:191 \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/cpu.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77fcc9d80e17403e582849598109c136793b96403517fc52a1e6be4b7e99ce2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): src/cpu.js:659 \u00B7 src/cpu.js:666 \u00B7 src/cpu.js:675 \u00B7 src/cpu.js:683 \u00B7 \u002B1 more site(s) not listed \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/cpu.js"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddea31065d154aa42d23626992fcf2e75795309c17cdd4ce22b64cfee28a548"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/cpu.js:791 \u00B7 src/cpu.js:830 \u00B7 src/ne2k.js:79 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfffaeeef991f14f64e658eb1d80750798e6d1b17715486525ef11598a2603de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/lib.js:84 \u00B7 src/lib.js:104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"494c3910356b6d1df28e2efbea5d07a28a9ca81ee72dcac19d1e8f596a34dbbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/browser/fetch_network.js:59 \u00B7 src/browser/wisp_network.js:43 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fetch_network.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d36008f3578d3fe010ae5bcb7682295dc6ca3831bd75c11ac83499f744f1dee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8 locations): src/cpu.js:79 \u00B7 src/cpu.js:89 \u00B7 src/cpu.js:100 \u00B7 src/cpu.js:115 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"730f26adef85015bbb44b2a20a2545e367fa1bf6ee4d28c0c246ff2d22b28d30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start_emulation (cyclomatic 91, cognitive 150): start_emulation has cyclomatic complexity 91 and cognitive complexity 150; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3decd69b8354e59d3f6cd1021cbdc2667bad11c642a0e89137f380bbbc5d7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReceiveRequest (cyclomatic 72, cognitive 98): ReceiveRequest has cyclomatic complexity 72 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9811b6b29a1c986e0d277f8ec8665a1015d4a19d15f23fe76a61115da070ad99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create_instruction_test (cyclomatic 65, cognitive 93): create_instruction_test has cyclomatic complexity 65 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/nasm/create_tests.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0f488bf00ef6e7c3153f682cdb286ae615cfa980d4389577f00efc9d31acd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ata_command (cyclomatic 53, cognitive 38): ata_command has cyclomatic complexity 53 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c63b4230f6e1eac2925c734d141c2de36e90bcdc4aa021e42c90971ac2ff904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function atapi_handle (cyclomatic 50, cognitive 41): atapi_handle has cyclomatic complexity 50 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f659b76d72c8feacdea5783d1f62f27fa497d970abd6b7e1ea78d4f55a4bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continue_init (cyclomatic 47, cognitive 52): continue_init has cyclomatic complexity 47 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe5834b946335c16e0c9da8683bb1e952a567a0b7f7f1d23101a98ad824374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli_exec (cyclomatic 46, cognitive 63): cli_exec has cyclomatic complexity 46 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aedf31584f2010b351fb3ec26eed018658ff7f33d479c960ad3bfa54449d2c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function port60_write (cyclomatic 46, cognitive 51): port60_write has cyclomatic complexity 46 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ps2.js"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4ffd41e6e8b1dc0096075e980b0b94cfe5eebc8c379f0f7d10d548b060e4bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translate_mac_address (cyclomatic 42, cognitive 43): translate_mac_address has cyclomatic complexity 42 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db25a3766c95b663114a036d01ba60c819e974d3043eecb3e896aae81b67ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function set_state (cyclomatic 42, cognitive 42): set_state has cyclomatic complexity 42 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"936b2228a6b2164fda656df4889e8c74557b2aa3ce74245e55ed0cf7fa6a5da7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onload (cyclomatic 38, cognitive 44): onload has cyclomatic complexity 38 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2748478cee8e164f744ceffbd10c986b72b01c2b68e2edda5bc2e99028e98bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function port3D5_write (cyclomatic 37, cognitive 43): port3D5_write has cyclomatic complexity 37 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d920e4a8fd13852c4b8c81a88729f86e5cd0c9303c0d3b334fc2c3e6268187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function port1CF_write (cyclomatic 35, cognitive 39): port1CF_write has cyclomatic complexity 35 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"54965d2693426f9747a76035077fbc0347642829aff16b2f21621d5501f40148"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create_arith_test (cyclomatic 33, cognitive 66): create_arith_test has cyclomatic complexity 33 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/nasm/create_tests.js"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeff15b485f7ab06157baf6a371f7874203140bbc8fe3426c758384cc5a0538"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 47): (anonymous) has cyclomatic complexity 32 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f21a4945cd51a2e88bd04e08ff781b57d47a45cb24a7abb5f650d4c59bccac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function process (cyclomatic 31, cognitive 48): process has cyclomatic complexity 31 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0803f6b5b48a22c9d7e8a2afa3c75c44816a8e430d674d182a6b89e565ebc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Lock (cyclomatic 29, cognitive 46): Lock has cyclomatic complexity 29 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd06b8e5e94d11d008d0bd2841e4865541b31f706745bcc9cadea6d2cbfe7fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function init (cyclomatic 28, cognitive 43): init has cyclomatic complexity 28 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4e086adee8096fe03d98032362645a8322010635ff2711531c7ecdfc298d46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish_test (cyclomatic 26, cognitive 53): finish_test has cyclomatic complexity 26 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/nasm/run.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"451217738d9f0729fe1fb6befa17002dae896e4aa23b17d46c34c415bf228808"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gen_instruction_body_after_fixed_g (cyclomatic 26, cognitive 45): gen_instruction_body_after_fixed_g has cyclomatic complexity 26 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"81af2ff0383ea9f60fb1652c674ced47db3cc502d4f53f29d208e15376a0f315"}},{"ruleId":"R3","level":"warning","message":{"text":"src/browser/main.js: 3215 lines of code: src/browser/main.js has 3215 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91da30cccf931dac1ff01dd67d48268ae0fc2e1be546fb563d6b74ae8e6aca9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ide.js: 2548 lines of code: src/ide.js has 2548 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa4be6948dfca7ed0e0f4302ed92c526125a4557649ddc7ae7da5adfc7e1973"}},{"ruleId":"R3","level":"warning","message":{"text":"src/vga.js: 2283 lines of code: src/vga.js has 2283 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4057396cdc1b0b18c06adc3c4d3a6005f5d50def5bd16f3e5af6b6df4f0378ae"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cpu.js: 2108 lines of code: src/cpu.js has 2108 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae009eafc262a7b6f24461bafa0e109967da1bcc7fd90a19f59a1bd4d8a774b"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/filesystem.js: 1700 lines of code: lib/filesystem.js has 1700 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad4c73fd33526ac8784ab44c5340ff51b6fc0e8cf142ad3ce4b310032b05725"}},{"ruleId":"R3","level":"warning","message":{"text":"src/sb16.js: 1611 lines of code: src/sb16.js has 1611 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sb16.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ad9888b3171cc88a84381c641ffcfdfa26317b5e21dab899e5f5bde0908c8f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/browser/starter.js: 1432 lines of code: src/browser/starter.js has 1432 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7611555b1c1d8ea48ecbb5f306826666a02047567d4cdc6ce67c4ef06904818"}},{"ruleId":"R3","level":"warning","message":{"text":"src/floppy.js: 1355 lines of code: src/floppy.js has 1355 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a252a70a75761b0d80d0a69b1c88cff91b9420e7c6f40330cd002bdec93282"}},{"ruleId":"R3","level":"warning","message":{"text":"src/browser/fake_network.js: 1334 lines of code: src/browser/fake_network.js has 1334 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fake_network.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3dc62a4c9d3ee844e4fc735bcf91f0b78f95d51917bb3adeca146c0a146592"}},{"ruleId":"R3","level":"warning","message":{"text":"src/virtio.js: 1330 lines of code: src/virtio.js has 1330 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c984ff286e8188c4e04023b054c52110bb98254db8721cfd1119b702cc2299d6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ne2k.js: 1211 lines of code: src/ne2k.js has 1211 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21ecdcfe100277a908f2dcffb950eb60e242e5ffb03e808fef9a2bab8c11ca9"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/9p.js: 1026 lines of code: lib/9p.js has 1026 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f12b5eff043ff0d4eb12f9a1f11e450b5531d432ce417f3eb3a15a852cebaa"}},{"ruleId":"R3","level":"warning","message":{"text":"src/browser/speaker.js: 916 lines of code: src/browser/speaker.js has 916 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff4fe6b660f8b3394762e5b32f89f29bf753d130a82be108657c5307e9f99e3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/browser/modem.js: 855 lines of code: src/browser/modem.js has 855 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b22c5630035404215c1ec8f7f5fe8928bf5449de9dc490fda79ece2e0c39aa4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/browser/screen.js: 833 lines of code: src/browser/screen.js has 833 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cd4b20110cfdbdb2af79bd86edc84584500245e7325be797fe029a4e170a2b"}},{"ruleId":"R3","level":"warning","message":{"text":"gen/x86_table.js: 749 lines of code: gen/x86_table.js has 749 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/x86_table.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b1c66c3b663a3ab52141d3ee2c7ff5d62da222355de95022b89d178ca0edbd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ps2.js: 727 lines of code: src/ps2.js has 727 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ps2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a607208c9bac30c64b2af5a87793b327c6d22faf18f126480072b2ddf326f1ac"}},{"ruleId":"R3","level":"warning","message":{"text":"src/buffer.js: 684 lines of code: src/buffer.js has 684 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/buffer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb848e0df216e84831e99a50976f0e0218c11579641500d8d8fe07dc4b16743b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/lib.js: 673 lines of code: src/lib.js has 673 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4de5f35e035d69b0515807b919d8b104f48ce855ffee8fe7c879201dd8cc6b6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/pci.js: 503 lines of code: src/pci.js has 503 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pci.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eb99e018c46af34180fbaea5e1b4650f548922d0a60275a29d55d0c2867e0f"}},{"ruleId":"R3","level":"warning","message":{"text":"gen/generate_jit.js: 501 lines of code: gen/generate_jit.js has 501 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ccb178ef27e0d47547e02634da2f1177b64990443834b6545de9bc433ce186"}},{"ruleId":"R3","level":"warning","message":{"text":"src/browser/keyboard.js: 469 lines of code: src/browser/keyboard.js has 469 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/keyboard.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"951229f94b42b2dba684f1d3a5c4155b7a7223f4276e0df89ae354d51e0036bf"}},{"ruleId":"R3","level":"warning","message":{"text":"gen/generate_analyzer.js: 430 lines of code: gen/generate_analyzer.js has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"989d583aa413e173c8f7cec33b0c713e2ff7f933aad7dd710d7d0170590125ea"}},{"ruleId":"R3","level":"warning","message":{"text":"gen/generate_interpreter.js: 428 lines of code: gen/generate_interpreter.js has 428 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08ac9d2bc4a1fdaf42f2a25c16967020348515889faa5c952ccfdbcf6e280cd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/io.js: 417 lines of code: src/io.js has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/io.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ead1c19994617b70d6743bb2508e56ec16bcfd5886969c9a52f8e02a821ec1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"138ce58f4661ac58b1b885178046b79690eb357a025403ac6eccba5322d24841"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5620d70e301a9f1ff9e8d759492f89160095c7fe0fc09cb2bb1ff4b79e2c2df4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vga.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"352f1a01a07ba2cafdbb35873b6419cdae5acda39d1d7b5a43945d160fd4783a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cpu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f5d0627d48ca43af2ad26023e4bd3163f51c97ed9093dfa04f68c17a705a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4153116f59d576fc38e969771fbf07e4ab5e0544173d61b613eeeb49a6efaf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sb16.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1810be851566fa861ced017390f2ff49ffdc1e575ea4487201f0c0d317e5cdd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de76fd981b4232b902625c7589aad924de7549b633b7a59ec2cf71a44d41d6b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a53c4e240807628218b8f377a800f84c2f7d8d8ef7f167310571e69a4a3238"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec84609b3e3d6dc2cf0189992a3cebd6015c0fd7400d2995c7d2d17e7f42bbb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b6643689201b65f1ea85e85af3efac9ff7cbe4a9965feaf4f98967e181fa42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dee6177f6fdb50141e4e0c111ec669f3b536c928816668f59d43d21af769c8b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/speaker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"635b8d22f57d64208b484ebaa855cf0cd8ee7cbfd264c1c510578d284730a564"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3db0beec189d471609f21b94cabfbb9913d16d00c2f218d163752bc9435c15a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d652d7d031adcce15f9d0dab327df9aa16c8b0cbc2da84d4dd870b3a1b51eb68"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ps2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3c3d3d7648701739dac7141ca2c0b3fb446123fe57e691ecefca0bdc33f9c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/buffer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"430126963a06f8221b22d6beb89d05190c49a32af5e9e3b4c37c880d1a98e3e4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pci.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2587ec1566641029605e2884a269b5d1142337f996cb083bddeccd6c3fc7cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_jit.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa73ce1c20d77e245020a85f449b18e5b75f4c43bdb1a737ef591d374478829"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/keyboard.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2e1add092b51883a90010ea7ed2dbadbc4e4710be61eebd39e5b1a20da187a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99abfb62ded47f067933df7e2c2a163411db177e5f797d846b5bc33836951f05"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e1bfdfbfd76d91faee6ac02aef5bbfd642f73f921eda4b7214c053b1cd21d9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/io.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eee9daedbc6157cba0b176032d3b8f129998ea7b423dcb517ff9c8ff1c05ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1acd72f70d42c906e4a59ba82b5a3a95fb5cf404f084b70e3cac013148eb93"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dma.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbd4ddbf32f5a146d50d9ab211d28dcd93709bd88c0ce73e17803f69222928c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rtc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9232db25370bccbc200f4c8fcabc9a8ffa51101ad6b1f22d7c3c949111efc0c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vmware.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dfea23cd5f1ee1ccac8aef677e7ea397fb4c38d9ab077b6c6fe2e70ed1cdea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pit.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4389a98cc2bf99c3dd2b9b647b501318417c6bd0a1ca84189d52df6dd993be4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/serial.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8ada99ef4fdcfc9ac4bc9c1219fbf3a04b6e8faaf83b1932fee3dd198282b2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/mouse.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7610e6e2420e71b167f666c9f9ae1b0a9cc28ffae1a84d3af6702a776838a6cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5753943f843fbde91a14c32f9057b59848112c1a2443605080e7346d99eee9fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2e606a950a9575ff2d990f5c60694d83572db26972ef41045930f1604d38e7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/print_stats.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de38dcc81182011443528419f71c98d4e42cd1950e69bc1fd5c5335dcc84ad48"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/wisp_network.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38681416bfc9d501e7337801df48622d8595fa3de881263551dbeb3ccf2a57f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_net.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1ae29f01746ea30839455c203244f0d4694e19fb7b6b640a9939e5fec68275"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b74883e44350411f8bec281647eb778e305b2b83a238ffdf64d243c664f3527"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/kernel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d170ae9e14dea7c24e24eaf6d876511a36513b41b3391f6bf802d4ecd7324a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_balloon.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f829953f594e4262d06ec22a33b7bf9142b0628da5c3d57a7e26ba216a6383b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8596bcd8619bae8c952cd2224853b5be381582131875165e33d0cd2e9c80736"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/acpi.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0338d9b36356032ff67b6121316a2de15fe652e0f677e1a8e21194078be8e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parallel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5065d9af0b8bc63b06c6edc6f0f7484eca9283c635bd7d7ee336d1a86e7520c7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/ansi_screen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e6ed4a07d9cc11dc5b38facb9135bcc5ff53ad397e1d933d0a428a86e46c16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/filestorage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d8c99b20574b9649ef78332c88badc9a78c028ffffb40a8943a6d04654a10f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/network.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef649dc42ec828cdb8ded17a5f0f3401dcdf753ffce4056515b040b39e79b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/dummy_screen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97b035f69bf3c46557ea3343242627c018a2d6565cac5fd7646367d39410d27"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marshall.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bef3dd2a43efbc406ac2dd486309452c03fa931b999c1da0c21d6b3dd585566"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/docker/debian/build-state-9p.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba3eb3c2d03675adf3726530996d3fd31d336c78ecc3024b35b2f70ce5332a5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/docker/debian/build-state-raw-disk.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"196bfd3e606cf8e4d97aa04cba0fcf5b3de25bd82216672d92a94b984ae554d6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/rust_ast.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4214eaa2f26e69eff1be6c9cff7de72d688d3a925c13792179c3c175267c5b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/docker/alpine/build-state.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efeabec35cd9b6cd8d89c199d20287a5aaf015fdfb1a917428b43b6407acfa6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/worker_bus.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a011652e78c98ce05c9fbe7d93225105969c9643f3a84b670ec566cf84dceb39"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/inbrowser_network.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc11c510337b35b218b1466ad8750415adea7938a148549cb6e41a7f46c135f9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34ccfd47f5b5a4296b40ffbf19c1faca033e742846a0a77d3ca8ce457084a6a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fetch_network_harness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3c10d6ce71dd1a3343733e1286538cd14fa425e783897fb846dda6727d4bce"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7d3c9a11d72779bcd94eccf1dbffee78c15539c1e1b4a492dce478d7154823"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mkisofs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"553e97ec8679eb0103aeaede02c9039fb337920579f29447277c12cbb08681a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cjs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10d964d89abfd4d030105c5df90c7a782d1450c5c765dc3e458865bc0d1a37d"}},{"ruleId":"R6","level":"warning","message":{"text":"No typecheck script: test \u2713 \u00B7 lint \u2713 \u00B7 typecheck \u2717 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"912edc7f1fd20bf80ef68c3293e3048565115e48707dc5f9d492201598794658"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (3 application, 44 tooling, 36 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/worker_bus.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a635ecfcb82ec25200a8279f593820e9d7c24d1896dd35474bd60ec29b90ee91"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (3 application, 44 tooling, 36 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fetch_network_harness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78562489b0cf565afe66b87abbb7fc87215a9b9bb1094fbd30f849d151fe37e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (3 application, 44 tooling, 36 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/externs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39b3a1b66894415aa55d1c1ea8d2ad45b529bd734616f2eec8cf24ed7509e46"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (3 application, 44 tooling, 36 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cjs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81f8943cf4860d72d699545e8848bf158607687ffc7607ec259709625d9c4bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EINVAL\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"918cd0fb65b015d6786ead926e7da81f88ed9214e2cf03c6bc2775800c34ff4c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EPROTO\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ffaea807295106e1588c49c38164fc7622721f7db7c3a6ce24292d4df35852"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027P9_LOCK_ERROR\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d87e3d8525ddf4edbde860bbdfab86d908896bddffd5a4e6eedc10ab327037c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027P9_LOCK_GRACE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"524c28e5312a83a3b04a035a6ababd7be761be72fccecc6fcdd3759ffd1c0f2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027S_IRWXUGO\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cd24e4c1236beedcf6955c719296fdfc866dd5b8ed9909a09e0ee52c53447e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027S_IFBLK\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"687479dc770cfb0b1ecbad2ee271244067315c647190e36c24c4353e1e0a06da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027S_IFCHR\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2d7b0e4d07a3414cb050b70e3a5e63b72d73ba10b675496488dfc7b4b3619d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEBUG_SCREEN_LAYERS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/screen.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"722224c545355105c4e0a9be57d08b492d90c0c3dd37c98034abff0aac195d2c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027is_probably_iso9660_file\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4fe80883e61efd854c215da14f0cf55f98e5b81d54c2862b6a1f8a085b9d9d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027LOG_TO_FILE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eef0b5a69c2d124a8e004e2302dbd0ae35fb078478e2a535ba98476bab8cf4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CMOS_RESET_CODE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rtc.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a05f0f454450a7a3468b1b9a534d090c86b1fe6f201f9304d2db5308199baa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_DIR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba6b6526a636725250bea1e8aa67dd66178cac77582ca2ed565ad91740ba3fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_APPEND\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e72e5e56b39c2a8646955e34512449cc36d753f11e1fb031adbd679d8509027"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_EXCL\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"093ad96d68ce510d97fde91fb20e0f201dd21b40afa7996ceccec4cb174c4d8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_MOUNT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaceb530438462eb9f37f0dac697a2a208dead0aa5a7eca871874627027cd584"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_AUTH\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"828e291430a80f4cfd27f08325fa02f75079595e8ad1b5b9c77dcceb185934e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_TMP\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6576cf546c177af1fc78d235f860b1f45309e1269887cfd9d14b8f0fbf0523"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_SYMLINK\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f741d0e6f7360cdf3d92e4fb8855411a1e0be4d9155669ff4500eb0a1e4252"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_LINK\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"df39395aea04fc8938d132805cc5f1f70172adcc44d66ec6b14b1f04bc4f360a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_DEVICE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d664c2a2d599c50963c37c97e15fa3cd15595807854d0320c9c1c24965ad0010"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_NAMED_PIPE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3f7d0f60c341f3da2d844a9801bed05c368c7acea8f04dd035858d4935cebf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_SOCKET\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4671bcbc7f552700290f180dccc7a8b7fa5c0b2691daac03b334029af88e43f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_SETUID\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4763dcff1f9d5583da3346938b69ba11c06c56a44dc14a5dad5a2730d1757650"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_SETGID\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"08570d5289e965839ef3bf0f3ac52a8b2355769a5db06f16aad44691ab7f0a72"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_STAT_MODE_SETVTX\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f372784731da3e70a393d3be5fca90d805db06af86f9d953cc7f0504a88595"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_LOCK_FLAGS_BLOCK\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2dd7017747565cec97b47f42e8f10d4a44be7a443ededf6327215122cdee56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P9_LOCK_FLAGS_RECLAIM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b459769348635e39611590351952ee02621454e9f226c74ea07e66cf127e41"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027O_RDONLY\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"20107ec9e5ed66f6bea2f23c149e237182a7a12139213f8a3127a9f612593f22"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027O_WRONLY\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4157a2cc42ae4cf9bda83fd46ca6b2e5832e72e44064bcd659d5d9b60945fec6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027O_RDWR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7b5e6b68a29127d6bc39a4660b2c543a171f78d518a3b8d5a19597389a000f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027O_ACCMODE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/filesystem.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32b42617aa40942c28eee82a617f75f778196dbe5fadb8e62616098ba7fcba5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DTR_LOW_IGNORE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/modem.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"04138fc35805578fd8915e6123a5f81eb821e6f7e2090800d097df1b7be2deca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SerialRecordingAdapter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/serial.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be9245b978b1de5598ea67005b4fbd0eedbc3c808442eadc7016b5e5e76d26a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SRA_NDRV2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"264830d151b3115fc23a83b2e5c00e5c0669f176b2d566b17c21b0334341e79b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DOR_MOTEN2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9bd8c204b48d2095bffe658e95a5b83f346394800a7cb1643e764e138caf4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DOR_MOTEN3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"102f34a88a8db4447f67fd4dc97b2e19dd60d6287d571e9cb853b0071b746c81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MSR_FDD0\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9fbb73884cdc077a80c2465bbac48fb6f03740f3e6527061d09395a8ea4c5d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MSR_FDD1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe1ff4114b4702b5c8e034a433d692e127678d51f4a883e15172747fc639de6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MSR_FDD2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73347f9fd3e44482957010a1277e3e2e9857ff5d7f7fd26e8742851f49ec5fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MSR_FDD3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e5f3b42bc753ec4bf215b89414a57db1a6660847757cc668d7a4f2857cd1f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SR0_EQPMT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8bb571fd5b598f74a09a0c25951308704b20b08d6ac881080d58f69e42757c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SR2_SNS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"affc9b06df557c79a566110db777424985fa3342f236b1b05e98e59f4e8d6c2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SR2_SEH\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"19148b4b1ee91e79135f53af597d056cd4f5db3ae7276ef5687c213bd671ee5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CONFIG_PRETRK\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9a4584933724d3d7097dd35dbf4c1bd31f1c13229c8276bbe7b8437900aa79"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CONFIG_FIFOTHR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d6c9c7d946440ad23c1fdb0c7d4370cc4fbf752135cb93dcad9fc990144ba2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CONFIG_POLL\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floppy.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99d7f8960d94773488015de299c19937b3ebc186c02f90af696b53641f4c975"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATA_SR_SENS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"258fcaf47053287dcb809bd6bd9705593006237f4445f0e9e1490687494d096d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATA_SR_AERR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a50b0076001a050e4c74e07c0ce2d6d381fa34902cca5b83ece33b6a4aa7b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATA_CR_HOB\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb9d108fa40b6dfe055c75886f59b78a0650d06c3fc54ac0a9ee72c8d00b010"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_CF_UNIT_ATTN\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6954f5d200f60b94bdfd7922a2e729e56c615aea4931cf9b6380e276cdd0ac44"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_SK_NO_SENSE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf187d63a56c013f1a72de25e8ad23be01af64600584ee338126b28d4dddbc2b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_SK_RECOVERED_ERROR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9476b1a4e1e631e29a2fa9e1f2e98e9bd1993cf2f4bda599f234e34c5d7b4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_SK_MEDIUM_ERROR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c28cebe596b540b79b7984310182937fc57fb97bc13889f2515f4784926b332"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_SK_HARDWARE_ERROR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f1ff81d27e231683d6310059a42b3e94d360481c436c00f64ef52eed79755b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_SK_DATA_PROTECT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a872d387bf769d673a2d504abf4cfb2e4b798bd6ea7083e5974cbbd41c95c24d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_SK_BLANK_CHECK\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"692eaf41bcb4bb276186ac76deb869fc5f8dc552ef1dfaaf995a427da43ea788"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ATAPI_SK_ABORTED_COMMAND\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9016f1186ee746ffa7f21601ed1ee22f3ac4b4bfa95f2a18a6891a99c0fb076"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027LOG_DETAIL_ALL\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ide.js"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3189217b85b51b53c6ad3d8c2bea5573c6883ab40c68b317edaa0e59563ee6ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FILE_FLAGS_HIDDEN\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec00ac35801d96816ebe6df39a2766e1ddcd111a5681051be1794ab967cd7b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FILE_FLAGS_ASSOCIATED_FILE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08c8664136835bae31df063b92958a0952f736482c0a3edfa070809b23644b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FILE_FLAGS_HAS_EXTENDED_ATTRIBUTE_RECORD\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"379ad313e54ba77d3ebb351eedddd93fd01a2fd46fd0ff39a74d9b9ececdf928"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FILE_FLAGS_HAS_PERMISSIONS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7226ccbf3d08b74981eae6d40130794eb15d7c558627a95bfdbb7799423dd8f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FILE_FLAGS_NOT_FINAL\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/iso9660.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"db84988c82689e89537c852dc652d591e10966df65bea35aaaa0610800fe5d65"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EN0_CLDALO\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"48440cd5c0839330f4a38aacef58be2dd6c08a6816feb1681fcc25957643c321"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EN0_CLDAHI\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b49d9e65cc31eabfce78e3f1ad4fafe07685c1dda90f9a2e30d03b265af147"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EN0_NCR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b58a3767665aa37d8f8f2e2b1209be0ffa9b0ad6bd888392f7461ee61021fdd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EN0_FIFO\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8de6570113bfefef95c26dae5b1c13c9600534a9e11de97db4957460ff3a04"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EN0_CRDALO\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa7286854f19456abaae60ba701f20a11cf869ac76a68959896fa5b141d10fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EN0_CRDAHI\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b785754214cdc96824c8e75f0fa91ff5ca7658ff773a9df294fe90b2afa2e052"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ENISR_RX_ERR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460a5ff9afca3c17ddd4d108a39cd4fe1472236fdc672c3442f0bdeafd6efa5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ENISR_TX_ERR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6da520f0956c6f351eebc1f87fd9282aa46e31f88abf5cfafa42792285e1f52"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ENISR_OVER\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a62132db0c4ce1d19d74e0efdeb8fb49fc1cc02b0e487c82b73d350100c62cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ENISR_COUNTERS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c600bb12b81f87d86f9ffad40e2e8660a5fef28b847651eebbe60f4433fde3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ENISR_ALL\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ne2k.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8e4d1f96011e73aa7455eba1df1afb4289a752abaad97c5d239eadad0294bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UART_IIR_RLSI\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"63500144d7f74b4f6cbc212586b7eafc7f3b23db45dc4669bfd708a83edb224a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UART_MSR_DDCD\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2f51b4b98164c4eba874bec719ff9aa013b3ab11d67a71a4a9442e066a167d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UART_MSR_TERI\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4e734b264902925b5f9cd038321959f398fb1a373da8df2367d2e5567178e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UART_MSR_DDSR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d84b6d031e5cc8521333cfdeb425c1135b6f5183ad07929462db4ff4f7249dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UART_MSR_DCTS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uart.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1153b84895f87d1fd7f92a0d3a1403026b64ceb3a31f7e9e459e4095ef0a8d6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VIRTQ_AVAIL_BASESIZE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76d8744d0dbe6de7a184fffd31a121a05b081cbdbb504f63d2ddbe923ee01d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VIRTQ_USED_BASESIZE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfe2c84dc8e9b740b5489af557d3bf48c67d89d75c9bcecd84e7e230540a434"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VIRTQ_USED_F_NO_NOTIFY\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a767a5d032ed88766666004a2d47d6861123797a1c9a01d0a7848cbeeb568a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VIRTIO_BALLOON_F_MUST_TELL_HOST\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_balloon.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbaede5236baabe816eb9e218b40b30840eb0f75624708a278f26775177ba8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VIRTIO_BALLOON_F_DEFLATE_ON_OOM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_balloon.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c60a5d16b089d1ba8a4f4ab07afeb367f7b85b9811b3bb67f09d5af77e4e9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VIRTIO_CONSOLE_DEVICE_REMOVE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c699401f30e7c01afff1e24b60b93d3d39650a87bff0d9fd35cb623496bf50"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VIRTIO_CONSOLE_F_EMERG_WRITE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/virtio_console.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"448bed7b600283b797c9022180ea2b05d1f55d75ece7853920b350faad25e4bc"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): lib/9p.js \u2192 lib/filesystem.js \u2192 lib/9p.js (one verified cycle inside a mutually-dependent group of 27 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"964aa68a858ddf5d5f418957a060578572661101c62c9af4a0391678fd32803e"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/lib.js \u2192 src/log.js \u2192 src/lib.js"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17a21bc55f3be6678f15ee531f8d8e43678d94cdbdb3d3db6c2793adae54f95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!booted \u0026\u0026 serial_text.includes(\u0022GUI_READY\u0022)\u0060 appears character-identically in 2 files \u2014 tools/docker/debian/build-state-9p.js, tools/docker/debian/build-state-raw-disk.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/docker/debian/build-state-9p.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca03c4bcef5a8fc949b62e332c62bae2723dffcd4666b965c920d42f51439c5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.socket || this.socket.readyState !== 1\u0060 appears character-identically in 2 files \u2014 lib/9p.js, src/browser/network.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/9p.js"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbaccd1d22f54d44ff53c2ead49259b36d80c1023259a79de390204bc573c36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060booted \u0026\u0026 !saving \u0026\u0026 serial_text.includes(\u0022GUI_READY\u0022)\u0060 appears character-identically in 2 files \u2014 tools/docker/debian/build-state-9p.js, tools/docker/debian/build-state-raw-disk.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/docker/debian/build-state-9p.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef341c773caa929920013f3b410a119a6eae4f96c4880381c13248e8870faa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cols === text_mode_width \u0026\u0026 rows === text_mode_height\u0060 appears character-identically in 3 files \u2014 src/browser/ansi_screen.js, src/browser/dummy_screen.js, src/browser/screen.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/ansi_screen.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f134b7e0d10e82ae751928e5de32eafa02151084abe58d8cdabb1944653bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.masquerade === undefined || !!config.masquerade\u0060 appears character-identically in 2 files \u2014 src/browser/fetch_network.js, src/browser/wisp_network.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/fetch_network.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95e566fa1bbbc0258cd40d68df11fa643b48186a5755ae2a090ece2a04eec94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060encoding.task_switch_test || encoding.sse\u0060 appears character-identically in 2 files \u2014 gen/generate_interpreter.js, gen/generate_jit.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_interpreter.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2e3ffc605c857d70c468adb10432066265766a8095fbb1aabf4e5add154a24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first_prefix === \u0022\u0022 || first_prefix === \u00220F\u0022 || first_prefix === \u0022F2\u0022 || first_prefix === \u0022F3\u0022\u0060 appears character-identically in 3 files \u2014 gen/generate_analyzer.js, gen/generate_interpreter.js, gen/generate_jit.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2351643487f52812c6da9bb41d22dcdec4de84d581127a6ba660820d191516"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_66.length || has_f2.length || has_f3.length\u0060 appears character-identically in 3 files \u2014 gen/generate_analyzer.js, gen/generate_interpreter.js, gen/generate_jit.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e982c90cfdf477045d700b45835b32fc1afd36ea67cbcc03edcba7611764392b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060op.imm8 || op.imm8s || op.imm16 || op.imm1632 || op.imm32 || op.immaddr\u0060 appears character-identically in 3 files \u2014 gen/generate_analyzer.js, gen/generate_interpreter.js, gen/generate_jit.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b85366bc9d7966c2a511c1474e42f6c8b802ac9fa523d1c2390fed5383b61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060second_prefix === \u0022\u0022 || second_prefix === \u002266\u0022 || second_prefix === \u0022F2\u0022 || second_prefix === \u0022F3\u0022\u0060 appears character-identically in 3 files \u2014 gen/generate_analyzer.js, gen/generate_interpreter.js, gen/generate_jit.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gen/generate_analyzer.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9430c550d9d5d568235feb5f802109da6b6f2e6990597bfe078b8c82fd7aa0ab"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060image.outerHTML\u0060 is text this program did not author, and it is written into the text of an element through \u0060document.write\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":3289}}}],"partialFingerprints":{"codehealthFindingId/v1":"12febc7c4e62b2ed33d9e4a1c3a356e3163b05b5907a023193b7703b5add8a5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddc136a083d03a67d7eab8aa88dec52b11a2492ec8eb925dd3537bbaf384a5d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/main.js"},"region":{"startLine":3291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7ee6c8dd763d48ae13de4e3f9c62b428d2c59215501c52f5f367ec270f4c57"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/starter.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c957ecf37b99c55d1b31f1952a79d38242fd3d8e8465d1568a81f94c0ca2f"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-527","guid":"79b27cde-9d04-1a54-b64b-d5bb9b4a8ee7","name":"CWE-527","shortDescription":{"text":"CWE-527"},"helpUri":"https://cwe.mitre.org/data/definitions/527.html"},{"id":"CWE-538","guid":"3baa1f05-df1b-ae58-9ee0-1d790ff4a989","name":"Insertion of Sensitive Information into Externally-Accessible File or Directory","shortDescription":{"text":"Insertion of Sensitive Information into Externally-Accessible File or Directory"},"helpUri":"https://cwe.mitre.org/data/definitions/538.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":62,"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."]}]}