{"$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":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","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-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::call_taint_and_source (cyclomatic 89): DomXssVisitor::call_taint_and_source has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f62a7fd68bc9a95d48b135e25c3583b76811176fa82c02201f0cca497f88aba"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::walk_assignment_expression (cyclomatic 78): DomXssVisitor::walk_assignment_expression has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a042802547fb8ba0059b0eada70a17f52204fae97c10e89ae02517af703b309a"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::input::resolve_targets (cyclomatic 75): dalfox::cmd::scan::input::resolve_targets has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/input.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"306d6e7f168ab2a9b71402ef73d0ce594626bad149376dd94e6db6f9e01e1a94"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::gather_sink_spans_in_expression (cyclomatic 71): dalfox::scanning::js_context_verify::gather_sink_spans_in_expression has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"95527e12b28f630abb8c443cca9b1380c898063b4c41b81f2d468be09f32c62b"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::form::check_form_discovery_with (cyclomatic 68): dalfox::parameter_analysis::discovery::form::check_form_discovery_with has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c60dd260d9d71a66fb0bb4b379009765fbbbfd39cd57502196d4a377a1427c9"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::bind_declarator_identifier (cyclomatic 63): DomXssVisitor::bind_declarator_identifier has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/bindings.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc62bbc96a6367f74976e5d1e00f883190c8d471b86e4935275b2ced8329fa27"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::walk_statement (cyclomatic 54): DomXssVisitor::walk_statement has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ac8e65e4fc36341f1fa7d124c4c0606aeeecc0bd541ad25287b81cecc8af36"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::run_scan (cyclomatic 54): dalfox::cmd::scan::run_scan has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"97def516c945e06f9980f7ec92efee8e448fb76842a54b6339a5233eea38655f"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::job::runner::execute_scan (cyclomatic 48): dalfox::job::runner::execute_scan has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job/runner.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ad277967ea762687c8a57a37a83121eb8300e0e300ef0dfa74fbfcb5cea844"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::payload::js_breakout::compute_js_breakout (cyclomatic 46): dalfox::payload::js_breakout::compute_js_breakout 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/payload/js_breakout.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87a432e1048a222a38e38761a24a98fc45f470f969bb272832937f1a17115f7"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::payload::js_breakout::js_end_state (cyclomatic 45): dalfox::payload::js_breakout::js_end_state has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/js_breakout.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eaf6499b20486358160e09256d152ec50bc66c358beebef095fbd46142b2bb"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::find_source_in_expr (cyclomatic 44): DomXssVisitor::find_source_in_expr has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/bindings.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d115cb37358aca850c22557dd70cfc637d2bf9c4f4b913120640d254244f73f"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::walk_expression (cyclomatic 44): DomXssVisitor::walk_expression has cyclomatic complexity 44 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e93c29191d67fcae038db0c7ccd9cb8e58107905e93271a49b5b9ab5d9b4ca"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::main (cyclomatic 40): dalfox::main has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d49f31a9d8d7154909bf2fe36fccb1c2c2745912de87e26789c7f2eaef91b01"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::active_probe_param (cyclomatic 40): dalfox::parameter_analysis::active_probe_param has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"653d0a21ef6c9c156760e2c9f7efecfa2e2ca04c88b052c55dd3c703f4ed68a6"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::handle_member_method_sink (cyclomatic 39): DomXssVisitor::handle_member_method_sink has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"2007cac40201e870da112d1ecfac9355458e173c72124e82586b64124677cb38"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::gather_sink_spans_in_statement (cyclomatic 39): dalfox::scanning::js_context_verify::gather_sink_spans_in_statement has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ac760b470c1ad1e4a10eb4867c579680a9d1aa4da20c7055060b40001ff4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanOptionChecks::validate (cyclomatic 38): ScanOptionChecks::validate has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job/mod.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"55de63b8d47ce48157bbe0c244d333dd25266a8dccb2e1b738548cd12e21e342"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::xss_common::generate_dynamic_payloads_uncached (cyclomatic 38): dalfox::scanning::xss_common::generate_dynamic_payloads_uncached has cyclomatic complexity 38 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_common.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd23f82b43077cca0b525f2380ec2e5c01b06e862a6f0f9c8ed4f8d78136a886"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::query::check_query_discovery (cyclomatic 37): dalfox::parameter_analysis::discovery::query::check_query_discovery 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/parameter_analysis/discovery/query.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0852c5b85d83ad84b39dd241ced8243778add87286efc328fa52a48c80f04cfc"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::scan_loop::scan_host_group (cyclomatic 36): dalfox::cmd::scan::scan_loop::scan_host_group 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/cmd/scan/scan_loop.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7d2c0e6fae3ec4deab615a09e678b8abe749890222225a8e6b655d6b472de0"}},{"ruleId":"D1","level":"warning","message":{"text":"Result::results_to_markdown_with_meta (cyclomatic 35): Result::results_to_markdown_with_meta 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/scanning/result/format_markdown.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e95e216e7d5601467649955fcb0340b6e19e436c138813c8929572c8dabbd1"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_reflection::fetch_injection_response (cyclomatic 35): dalfox::scanning::check_reflection::fetch_injection_response has cyclomatic complexity 35 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b017a7ccf02574b047f4d877682f6649bd862a34900acfb81363cba306f7ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Sampler::sample (cyclomatic 34): Sampler::sample has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3ecef0f0b7a55b85172992969e8dac6f94da0743d3cb00e9dd7440f36ab61d"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist (cyclomatic 34): dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/guards.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"74789aed0d5a18b130a675c6849a73f98a09ea063c1facf083bd1079b58ca560"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::param_jobs::generate_param_jobs (cyclomatic 33): dalfox::scanning::param_jobs::generate_param_jobs has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/param_jobs.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a7a19bc6893da566f1c87556236eedc1b44c0d4871d3a84f9b2189db4aed05"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::output::render_results (cyclomatic 32): dalfox::cmd::scan::output::render_results has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/output.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d619d46bac5c06abe7fc6315240498786eda74d8666f37e72239e9bcb4d7f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::check_marker_in_expression (cyclomatic 32): dalfox::scanning::js_context_verify::check_marker_in_expression has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"4174e0375f7ce70bf16b729c4f28b32479cc19724b5cbb47db6ec7562b130a04"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::is_tainted (cyclomatic 30): DomXssVisitor::is_tainted 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/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff9d2dc70f146073cd4b9547b84fe80606bb85c61b1f9bd35a7a66616454cd2"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::xml_inject::parse_tag (cyclomatic 30): dalfox::parameter_analysis::xml_inject::parse_tag has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/xml_inject.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"59afa69d82f4160d7327bf204a8431f5cc7105e9749adab7c10ec55d79ac42e2"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::classify_dom_evidence_in_xml (cyclomatic 30): dalfox::scanning::check_dom_verification::classify_dom_evidence_in_xml has cyclomatic complexity 30 (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/scanning/check_dom_verification.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e109d1e32e50ccb0353235838841d3aa082925cf97806d2d2ca331a4f57b05"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::url_inject::build_injected_url (cyclomatic 30): dalfox::scanning::url_inject::build_injected_url has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/url_inject.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e58b729d9ced0c3e6ac8b466c5c71483b33d6e62e08ceaf08f99607e9a14bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::target_parser::postman::build_request (cyclomatic 30): dalfox::target_parser::postman::build_request has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/postman.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"857b0f372f5a1c63e8f9f01a5c872aa1827a0b52770dab96e8ab2707d7452b94"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::handle_summary_and_sink_call (cyclomatic 29): DomXssVisitor::handle_summary_and_sink_call 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/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc3ae35ef841ebe31e2695bca3bc05cb4171b6662073131122e60631a32bff"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::handle_reflect_apply (cyclomatic 29): DomXssVisitor::handle_reflect_apply 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/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba66df9b540dc26b84b2b9ede37984fa43cf19fb33ee3248cf39be270e23f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"Op::build (cyclomatic 29): Op::build 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/target_parser/openapi.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdc82a7596ccff6b92294f92f878c124c69e14b8eed9e10f0c650d8990a5b01"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::poc::render_finding_block (cyclomatic 29): dalfox::cmd::scan::poc::render_finding_block has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/poc.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"749e89ba4b5f4cfd08a9d7defbf2322ad1611024ed866ffc7603a20adfb5b44a"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::register_function_summary (cyclomatic 28): DomXssVisitor::register_function_summary has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/summaries.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acd8a9577334fab9802cd08ccd2a708178ce72910bfed1df51b32f95384dc48"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::poc::generate_poc (cyclomatic 28): dalfox::cmd::scan::poc::generate_poc has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/poc.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bd0d1a72f1299361f0e293de25f633fa69d9970b2df06b30db364cadea0ed6"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_integration::has_self_bootstrap_verification_normalized (cyclomatic 28): dalfox::scanning::ast_integration::has_self_bootstrap_verification_normalized has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc11f29148a3d2f245cdabf5dee8d9f551461e392e23ddc35e69727be52c3113"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::server::run_server (cyclomatic 28): dalfox::server::run_server has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d3f366bd63ba0f9e85700695351ad2e27ae3826a50e037ef2de687539924d5"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::context_detect::detect_injection_context_with_marker (cyclomatic 27): dalfox::parameter_analysis::mining::context_detect::detect_injection_context_with_marker has cyclomatic complexity 27 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab006a2cdcb85b7e450571a2a6b85c444f76fae44a79af1f9667374d749c5761"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_query::probe_query_candidates (cyclomatic 27): dalfox::parameter_analysis::mining::probe_query::probe_query_candidates has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_query.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"65141f90240da0a87e8df4da8fcd8dcf8092416b2ffdbed4a627658fa8c4c8f9"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_reflection::escaped_echo_is_inert (cyclomatic 27): dalfox::scanning::check_reflection::escaped_echo_is_inert has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f2ffce8864a30221ac6f8f3da9f6f55065b71e21b3f15f2958b1303073c446"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::request_render::build_request_text (cyclomatic 27): dalfox::scanning::request_render::build_request_text has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/request_render.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a442029e816f451de98816612d59e84e61e06aa0ef010b52ff6a53c43cdfb52"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::waf::bypass::mutate::multi_slash (cyclomatic 27): dalfox::waf::bypass::mutate::multi_slash has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69256cea010f9454218cbed977cedcd4a917520fd5e574977af35d43f62422a"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::analysis::preflight_and_analyze_target (cyclomatic 26): dalfox::cmd::scan::analysis::preflight_and_analyze_target 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/cmd/scan/analysis.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fa5c74e607bf7055e85bb59de671d05c77725acd26d04e9129f52fa3534b78"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_dom_phase::run_ast_dom_analysis (cyclomatic 26): dalfox::scanning::ast_dom_phase::run_ast_dom_analysis 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/scanning/ast_dom_phase.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"750304707ec71570710d913b100ea03fc3e13d878f29ccf215c9ecfcd28a02e6"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_integration::extract_js_and_script_ids_from_xml_document (cyclomatic 26): dalfox::scanning::ast_integration::extract_js_and_script_ids_from_xml_document 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/scanning/ast_integration.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9829e9382877d41c5f8a56cf465c5a345c50b8f70fd84edd620d4f7385c21ac"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::target_parser::parse_raw_http_request (cyclomatic 26): dalfox::target_parser::parse_raw_http_request 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/target_parser/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078d21d492ea6fbc19b874c404881737f0bd9568be7a6419f7e3966f9baaa89"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::utils::html::nesting_overflow_offset (cyclomatic 26): dalfox::utils::html::nesting_overflow_offset 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/utils/html.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d829dbd3fffd7a072dd5dca4bbecf047eac9eac659d77ccadbe00e7861f024"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::collect_declared_names (cyclomatic 25): DomXssVisitor::collect_declared_names has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8f15ce267baca69e9b7cd04f905c7ceb181980794f60b2f8a7d063c3fff715"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::startup::prepare_and_validate (cyclomatic 25): dalfox::cmd::scan::startup::prepare_and_validate has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/startup.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"616373502193efff8b796833fd37729136e74524a498b0a8607c905dfe338eb3"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::output::render_dry_run (cyclomatic 24): dalfox::cmd::scan::output::render_dry_run 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/cmd/scan/output.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab38035bea079ae10f41a958d04f8495974f8f32f9cf3720c9c0c795c8ec1ed"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_query::probe_bucket (cyclomatic 24): dalfox::parameter_analysis::mining::probe_query::probe_bucket 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/parameter_analysis/mining/probe_query.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8813ac7fb1809de500ccaddd1f132d60591103e75729328c32afa14ec67b28"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::static_member_is_tainted (cyclomatic 23): DomXssVisitor::static_member_is_tainted has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cfb1e6f2a3ae3c8945e4e558f30c2f4789c7162eaaf0c77ca8eaaa9befbbf2"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::handle_wrapper_invocation (cyclomatic 22): DomXssVisitor::handle_wrapper_invocation 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/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"87461490a5dc914f8033d15ec6d52a7a6c358c4cbdb15e95e3712dceb6b54c1a"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::walk_call_expression (cyclomatic 22): DomXssVisitor::walk_call_expression has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7068273dfb1417152d8dc640be35aea425dcef7eb5fc0c7aa8bf259904b7b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Result::results_to_sarif_with_meta (cyclomatic 22): Result::results_to_sarif_with_meta has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/result/format_sarif.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8090f07db0181b23cbb23569f403478678326288c5cb12c323ec05f2b557ea62"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_integration::build_dom_xss_manual_poc_hint (cyclomatic 22): dalfox::scanning::ast_integration::build_dom_xss_manual_poc_hint has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"de48c157d8eacd0893e6808b01cb2f54acec1a5dce63ab062df507bcf4ee3495"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_reflection::classify_reflection (cyclomatic 22): dalfox::scanning::check_reflection::classify_reflection has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e40d63815d0a6d5b22eb02bb7055e6f27b0719a33e49bd00f69925cb7015c1"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::xss_common::generate_adaptive_payloads (cyclomatic 22): dalfox::scanning::xss_common::generate_adaptive_payloads 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/scanning/xss_common.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ba36145d6681a26c012251a7137bd21b538bd35b9e59f3c5cce6c16dfc08c8"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::analysis::run_target_preflight (cyclomatic 21): dalfox::cmd::scan::analysis::run_target_preflight has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/analysis.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"850477f403d35f2a09f005a9ed89136233ffe617150c751c79482bb6677849f3"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::dedupe_reflection_params (cyclomatic 21): dalfox::parameter_analysis::discovery::dedupe_reflection_params has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a018aca80400ebdeaa5061c00243b965f52ce66c9555fb85df42b1d69f032b24"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::has_marker_evidence_in_doc (cyclomatic 21): dalfox::scanning::check_dom_verification::has_marker_evidence_in_doc has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4414203f2a8d86e5043d892dbd370f78ce59fc17bff067bad6bf3df967ad75"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::walk_variable_declarator (cyclomatic 20): DomXssVisitor::walk_variable_declarator 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/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd941add8d03b17dcdc73092b2d39bebe7bcd034df9afc68912fd5b886b48268"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::walk_function_scope (cyclomatic 20): DomXssVisitor::walk_function_scope has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47afaf16cb94d6aa864e379051d994bcf0b8f0ac23f4e6d6678c346e3969fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::scan_loop::run_scan_loop (cyclomatic 20): dalfox::cmd::scan::scan_loop::run_scan_loop 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/cmd/scan/scan_loop.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"191621ed142f05ca373460086f9556d9349ba86e4e3895d197ac4831b1ed1675"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::check_marker_in_statement (cyclomatic 20): dalfox::scanning::js_context_verify::check_marker_in_statement has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f4b247a4a38f167bc131e510faf50f40c72d38c292cdd832f708974b031ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::register_class_accessor_fields (cyclomatic 19): DomXssVisitor::register_class_accessor_fields 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/scanning/ast_dom_analysis/summaries.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c76d2e385586cea65d4a64e961f9d2af63b7fc77cd086c7453ec70b0f6707c"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanWorkerCtx::run_reflection_phase (cyclomatic 19): ScanWorkerCtx::run_reflection_phase 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/scanning/mod.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a763588576422073366194aadbb057557e4008907cbf353249e055a615f0ff"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::run_scanning (cyclomatic 19): dalfox::scanning::run_scanning 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/scanning/mod.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c256a0ebbd022de0baa8d3b90afdee7f5d7825a7eca239350b8fbd6a16bb20b4"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_reflection::uploaded_file_urls (cyclomatic 19): dalfox::scanning::check_reflection::uploaded_file_urls 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/scanning/check_reflection.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61c8476ceee63cd76ed7330bd1e7a8ba918f126b8606ece848e1cafe24d7151"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::xss_blind::blind_scan_forms_with (cyclomatic 19): dalfox::scanning::xss_blind::blind_scan_forms_with 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/scanning/xss_blind.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a40b1012b8c255126f855e7e23e2ee4b15a7683788491fb6c9e33c3dfaec28e"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::register_module_exports (cyclomatic 18): DomXssVisitor::register_module_exports has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7db72c2290685fe299599dfcb05d447a007cd36280869a0569a427cbc6959d"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanWorkerCtx::run_dom_phase (cyclomatic 18): ScanWorkerCtx::run_dom_phase 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/scanning/mod.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"660d795a6b4873494ded00c01bbe58e19f898522270631e8dc8c65af4a5909bf"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::validation::validate_numeric_args (cyclomatic 18): dalfox::cmd::scan::validation::validate_numeric_args has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/validation.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be43febe361d554b485c299d94023f3caf688d17f3b0e725344380f58222fce"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::analyze_parameters (cyclomatic 18): dalfox::parameter_analysis::analyze_parameters has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: dalfox::parameter_analysis::encoded_variants (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"965c53466fc32a547edfa4c501c97614e336790cf91d980fe974824c95a46a77"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::xml_inject::xml_injection_points (cyclomatic 18): dalfox::parameter_analysis::xml_inject::xml_injection_points 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/parameter_analysis/xml_inject.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba83a74387585243ddff078b1eac0ce9a0602436e455293294eb50abbdf60d"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_dom_analysis::source_nesting_exceeds_limit (cyclomatic 18): dalfox::scanning::ast_dom_analysis::source_nesting_exceeds_limit 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/scanning/ast_dom_analysis/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efac5396ea74c4a1a206bdec438cbbac0d7a0bc506509f5783199a31b9c89e4"}},{"ruleId":"D1","level":"warning","message":{"text":"DalfoxMcp::scan_with_dalfox (cyclomatic 17): DalfoxMcp::scan_with_dalfox has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"43384a0ed052a69092d83f401b6cc57033f1531c514417464e29d1b3c1827983"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::promise_kind_of_call (cyclomatic 17): DomXssVisitor::promise_kind_of_call has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/async_flow.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3fea4971725712ae42de0faae276b6f31e9dc6207fd78c4ac44c4d89258f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::propagate_mutation_taint (cyclomatic 17): DomXssVisitor::propagate_mutation_taint has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"609d7cbdd6bef6a362056058fc1087776210ee59bfdcae72bfb1e16f4a6c21d0"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::url_part_lead (cyclomatic 17): DomXssVisitor::url_part_lead 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/scanning/ast_dom_analysis/url_lead.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5b72840fa700a8b6d23658a2aed7c79af3e72d05bca889368aa32e3410899d"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::blind::arm_and_dispatch (cyclomatic 17): dalfox::cmd::scan::blind::arm_and_dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/blind.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c6e5376f23f6fe52136f355ae6346b8a3030a25f94494c78084683f250ab90"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::preflight::preflight_content_type (cyclomatic 17): dalfox::cmd::scan::preflight::preflight_content_type has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dalfox::cmd::scan::preflight::parse_waf_type (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/preflight.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff26aa5013b09c9979cf1ba49f4c7610d8d3bab0cde77c8ed897c3f5a74fafa"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_json::probe_json_body_params (cyclomatic 17): dalfox::parameter_analysis::mining::probe_json::probe_json_body_params has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_json.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5f36bbfbd6671986daec377d698a8ef8bf24a9ae1662532fa40a069b718082"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::payload::xss_csp_bypass::analyze_csp (cyclomatic 17): dalfox::payload::xss_csp_bypass::analyze_csp has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/xss_csp_bypass.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ba23efe241a65f9f99fc9b422b85f05c0f30b9f876065a2982ed445dbac15f"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::payload::xss_csp_bypass::get_csp_bypass_payloads (cyclomatic 17): dalfox::payload::xss_csp_bypass::get_csp_bypass_payloads has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/xss_csp_bypass.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4739d3729defb3dcd5b08c0cab0891407fce3ab5a92dd20fcc5db3906ecac369"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_integration::build_dom_xss_poc_url (cyclomatic 17): dalfox::scanning::ast_integration::build_dom_xss_poc_url has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"74293ec6d0bf8fef02a8147e9644a804df35a40f771061f696d764a9b36146de"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::classify_dom_evidence (cyclomatic 17): dalfox::scanning::check_dom_verification::classify_dom_evidence has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8ae7112399d3b7ff6d97f767ee401535ed987df311bfc8d8bdfdcb0e371e1d"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::check_exec_sink_candidate_for_marker (cyclomatic 17): dalfox::scanning::js_context_verify::check_exec_sink_candidate_for_marker has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f29304036528387bae2ae8b8dda9c881aecc54313af11e509fb9b3dbf9d556"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::static_member_source (cyclomatic 16): DomXssVisitor::static_member_source has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/bindings.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d41dffea66f8139cd9d8c4aef8349804dd99232c4a7b8871bb5d8f7b9212318"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::message_event_source_for_receiver (cyclomatic 16): DomXssVisitor::message_event_source_for_receiver has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/events.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8088a4ae0e5e731126e2189919a8844f46c7d0eb094f5288d3f2520e16c31b"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::collect_guards (cyclomatic 16): DomXssVisitor::collect_guards has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/guards.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"172e106cdc8fcb220ab7269d46259f46addeb53a8a0a6c97122e9bd31c5d7420"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::collect_index_guard (cyclomatic 16): DomXssVisitor::collect_index_guard has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/guards.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb76a82ae93e787fc8e14ac71ad393f6385314a088ee7780aa343ed20337bce"}},{"ruleId":"D1","level":"warning","message":{"text":"DomXssVisitor::classify_tt_create_method (cyclomatic 16): DomXssVisitor::classify_tt_create_method has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/trusted_types.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10dc7fb9af1133b49c04b1714b5fe580f7bf0144410ddb41e516367c519e109"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanWorkerCtx::scan_param (cyclomatic 16): ScanWorkerCtx::scan_param has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c13c79e40b129cdb086c8401452c58ef37b3f362b0feaa4756cd992083be00f"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanWorkerCtx::probe_param (cyclomatic 16): ScanWorkerCtx::probe_param 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/scanning/mod.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c53a853c64b4b2d910c6a6339db54f342a0e9ee86eff70c8d31007468f5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::cmd::scan::analysis::inject_marker_params (cyclomatic 16): dalfox::cmd::scan::analysis::inject_marker_params has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/analysis.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f774f1e41aeb796b7e0a7f372a0ae3482331cf90d34c563006b579ff006e8a8"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::ensure_sxss_candidate_params (cyclomatic 16): dalfox::parameter_analysis::ensure_sxss_candidate_params has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dalfox::parameter_analysis::encoded_variants (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"25786a0db52b1c26e18b42a4bef56d9243701dcceab4f87184d26b0a2f6baf68"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::path::check_path_discovery (cyclomatic 16): dalfox::parameter_analysis::discovery::path::check_path_discovery 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/parameter_analysis/discovery/path.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc83cf72ad81b68990586aa29549b17482a5c3ccd4308d07beab4f0d9539e9"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::context_detect::has_knockout_html_clause (cyclomatic 16): dalfox::parameter_analysis::mining::context_detect::has_knockout_html_clause 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/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16684232b4f9aa3bc6ea24442356168e6d2a6212070cad9a0eca1a21fa973b8"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::ast_integration::js_blocks_from_document (cyclomatic 16): dalfox::scanning::ast_integration::js_blocks_from_document 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/scanning/ast_integration.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5cdd48474ecebc9a932629c28e50f5e265f90c286ec4d66bdb8b52bd88826f"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::has_html_structural_evidence_in_doc (cyclomatic 16): dalfox::scanning::check_dom_verification::has_html_structural_evidence_in_doc 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/scanning/check_dom_verification.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"5491ff48da63b95d66080f68a74ad899887fee169760212a9a7585d3140886f6"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::scanning::url_inject::build_hpp_url (cyclomatic 16): dalfox::scanning::url_inject::build_hpp_url 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/scanning/url_inject.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"26059908101b79e9db26662f46a4984e557fe4c9cf75d803d149a610e97b7a78"}},{"ruleId":"D1","level":"warning","message":{"text":"dalfox::target_parser::openapi::render_xml (cyclomatic 16): dalfox::target_parser::openapi::render_xml has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc63802e176a59030d1b0ad53274d7ce37b61211e926bff9cbac6b30b2ba8e80"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::form::check_form_discovery_with (cognitive 202): dalfox::parameter_analysis::discovery::form::check_form_discovery_with has cognitive complexity 202 (threshold 15). Drivers by points: if/else 51 (143 pts), loops 18 (53 pts), boolean chains 6 (nesting depth added 127). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdf85d070ef60557e4313e49a7673a3c8e6540c8160c954ea0e192e96a6be56"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::input::resolve_targets (cognitive 182): dalfox::cmd::scan::input::resolve_targets has cognitive complexity 182 (threshold 15). Drivers by points: if/else 44 (103 pts), match/switch 14 (45 pts), loops 8 (26 pts), boolean chains 8 (nesting depth added 108). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/input.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"245eb5fea572ed7e7564964733caee7d3e7834fc3ca85bb4ba72bc6de5767b39"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::gather_sink_spans_in_expression (cognitive 134): dalfox::scanning::js_context_verify::gather_sink_spans_in_expression has cognitive complexity 134 (threshold 15). Drivers by points: if/else 29 (84 pts), match/switch 9 (27 pts), loops 9 (21 pts), boolean chains 2 (nesting depth added 85). 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/scanning/js_context_verify.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4387093f07ede29005577c6115190ff3177b9c2cd5eee36dc6820383f49de0"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_assignment_expression (cognitive 129): DomXssVisitor::walk_assignment_expression has cognitive complexity 129 (threshold 15). Drivers by points: if/else 44 (95 pts), boolean chains 22, match/switch 7 (10 pts), loops 1 (2 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"83019921c20dabaace2df2183e1b0e84829c3b9e722fea6d3ba60a9bb9a277c8"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::call_taint_and_source (cognitive 127): DomXssVisitor::call_taint_and_source has cognitive complexity 127 (threshold 15). Drivers by points: if/else 44 (78 pts), boolean chains 31, loops 5 (12 pts), match/switch 4 (6 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b5570c5f9d080e4b8145058760d323fb9a7d0875fa66400f3552f35982bc14"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::fetch_injection_response (cognitive 91): dalfox::scanning::check_reflection::fetch_injection_response has cognitive complexity 91 (threshold 15). Drivers by points: if/else 26 (71 pts), match/switch 3 (8 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 53). Of this number, 84 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cbba7652a2350076e0ad78180b3048450064664b949cd26db0d3bfcf1130a2"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::handle_reflect_apply (cognitive 88): DomXssVisitor::handle_reflect_apply has cognitive complexity 88 (threshold 15). Drivers by points: if/else 22 (75 pts), loops 2 (7 pts), boolean chains 6 (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee452fc25f3e0d1330fe9b9eefc133029837335d12871340a0ada6e3e27060f"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::bind_declarator_identifier (cognitive 87): DomXssVisitor::bind_declarator_identifier has cognitive complexity 87 (threshold 15). Drivers by points: if/else 48 (64 pts), boolean chains 16, match/switch 6 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/bindings.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a144af13b82802784c7fefa8afc4c265fa1c2e909ef0e70370748e4f6790234a"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::xss_common::generate_dynamic_payloads_uncached (cognitive 86): dalfox::scanning::xss_common::generate_dynamic_payloads_uncached has cognitive complexity 86 (threshold 15). Drivers by points: loops 19 (59 pts), if/else 6 (18 pts), match/switch 5 (9 pts) (nesting depth added 56). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_common.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d9df87ae556890d7e89451bc0fdc8291f512a22e2bd6a710b6d494ceb76449"}},{"ruleId":"D2","level":"warning","message":{"text":"Result::results_to_markdown_with_meta (cognitive 85): Result::results_to_markdown_with_meta has cognitive complexity 85 (threshold 15). Drivers by points: if/else 32 (71 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/result/format_markdown.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a94790d24281a45565a286a756c67a1814f0170a816a3cc9051be82633369c"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::handle_member_method_sink (cognitive 84): DomXssVisitor::handle_member_method_sink has cognitive complexity 84 (threshold 15). Drivers by points: if/else 23 (63 pts), boolean chains 15, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a96f723a4390db9298ee8b4315b2fdce0502f34ebb9cc2b57af255cd05ed3df"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::active_probe_param (cognitive 80): dalfox::parameter_analysis::active_probe_param has cognitive complexity 80 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 6 (15 pts), boolean chains 9, match/switch 3 (6 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c69c07203e93b6d4c91898066710a8629c3289a1e29ee39bf2529c998a3ed51"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::scan_loop::scan_host_group (cognitive 79): dalfox::cmd::scan::scan_loop::scan_host_group has cognitive complexity 79 (threshold 15). Drivers by points: if/else 30 (68 pts), boolean chains 9, loops 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/scan_loop.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4b82260ffb2dedaf41a6580fdbf1d4b6b6e007243b2d6a5d7c024e85043f58"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::url_inject::build_injected_url (cognitive 73): dalfox::scanning::url_inject::build_injected_url has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (60 pts), loops 3 (8 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 41). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/url_inject.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fecfba9d5b8cf4fb88c0a920930234ee2a5283e84a0806cbadfb310cd215208"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_statement (cognitive 72): DomXssVisitor::walk_statement has cognitive complexity 72 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 5 (13 pts), match/switch 5 (9 pts), boolean chains 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7b0d5fe476d4d52654793794ea573c349647de74839ec85bef0057d99e72bc"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::query::check_query_discovery (cognitive 72): dalfox::parameter_analysis::discovery::query::check_query_discovery has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (55 pts), loops 7 (12 pts), boolean chains 5 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/query.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d376c0868670f394e1fdf600c0389c641a45279e9de49f1e648ceac201e01cac"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::run_scan (cognitive 71): dalfox::cmd::scan::run_scan has cognitive complexity 71 (threshold 15). Drivers by points: if/else 33 (44 pts), boolean chains 14, match/switch 5 (8 pts), loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"626bf9b5e2caf6e9c7e9cd14250be1e7bbdd55af14b2f9b4e35244261ca7c145"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::payload::js_breakout::js_end_state (cognitive 69): dalfox::payload::js_breakout::js_end_state has cognitive complexity 69 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 10, match/switch 3 (10 pts), loops 4 (8 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/js_breakout.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc4fa4f1ba751d32d99f3177bdedfb6671ad51178cd843150769423264ff981"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::check_exec_sink_candidate_for_marker (cognitive 69): dalfox::scanning::js_context_verify::check_exec_sink_candidate_for_marker has cognitive complexity 69 (threshold 15). Drivers by points: if/else 18 (66 pts), boolean chains 2, loops 1 (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b351a8ee1bd15a710cfac39b61a8fc96e64fcfb1c515390e25fc390cc393c9ec"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_dom_phase::run_ast_dom_analysis (cognitive 65): dalfox::scanning::ast_dom_phase::run_ast_dom_analysis has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 3 (5 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_phase.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fb2c3f90666fa088a4161e1609f3d664cd9853c864a655155d2f5ac2178fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::job::runner::execute_scan (cognitive 64): dalfox::job::runner::execute_scan has cognitive complexity 64 (threshold 15). Drivers by points: if/else 27 (43 pts), boolean chains 11, match/switch 5 (7 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job/runner.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b994ae7c5ae172995fb0e92227e8a65eeaf6e7f3bb94e492d3f43ebbc2d04e"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_integration::extract_js_and_script_ids_from_xml_document (cognitive 62): dalfox::scanning::ast_integration::extract_js_and_script_ids_from_xml_document has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (44 pts), loops 4 (10 pts), boolean chains 7, match/switch 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f7b8a329c433b15f8246b7263687cfafad7bb55eaa83bffd2492b46c81e6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::param_jobs::generate_param_jobs (cognitive 62): dalfox::scanning::param_jobs::generate_param_jobs has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (42 pts), boolean chains 12, loops 3 (8 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/param_jobs.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"612098f4e39094da07c84b7d1ba79ca27f803eb147256551e39565cedb85f643"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::find_source_in_expr (cognitive 61): DomXssVisitor::find_source_in_expr has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (37 pts), match/switch 5 (12 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 37). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/scanning/ast_dom_analysis/bindings.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acbdb0c8f8e2d6dd98ec64bac8958ce884d0773170e6468838c7353e12551dc"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::xml_inject::parse_tag (cognitive 59): dalfox::parameter_analysis::xml_inject::parse_tag has cognitive complexity 59 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 8 (22 pts), boolean chains 11, match/switch 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/xml_inject.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb53a47ed5240069143de9c24ed7c0eb5cec6d69f4986398a1bf38970b26e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::process_exec_sink_expression (cognitive 59): dalfox::scanning::js_context_verify::process_exec_sink_expression has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (55 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a3bbb35fe536d414e70f98d99992e191d88d7f9ea96b401e8abd32dba6f572"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::gather_sink_spans_in_statement (cognitive 59): dalfox::scanning::js_context_verify::gather_sink_spans_in_statement has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 9 (24 pts), match/switch 2 (4 pts) (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/scanning/js_context_verify.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b2f9f2ffbd998fb4f777c545b8ffc7454bb76d519c2a80421cbee6debe9997"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::handle_summary_and_sink_call (cognitive 56): DomXssVisitor::handle_summary_and_sink_call has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 6 (15 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"b903ca344a0d773a95d8b1c6fcee27e29600175f9621d77d159f806a028f2a65"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::register_class_accessor_fields (cognitive 56): DomXssVisitor::register_class_accessor_fields has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (47 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/summaries.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e8dcca16ccf358f88d881854db54626c409de9e5f0796f890b195e79e4509f"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::analysis::preflight_and_analyze_target (cognitive 56): dalfox::cmd::scan::analysis::preflight_and_analyze_target has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (43 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/analysis.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"17996fb789ec7b3dabba9828c522931d388f7b74874649e413d4db5f1b2ad5dd"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::handle_wrapper_invocation (cognitive 51): DomXssVisitor::handle_wrapper_invocation has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 3 (11 pts), boolean chains 6 (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/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc48dc145dac347d0942a5da1084d1837a2a30483dfd7aed2453fe9005451bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_expression (cognitive 51): DomXssVisitor::walk_expression has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 7 (17 pts), match/switch 3 (8 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/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dc23f7b7004be8a4e06fea6e2f24827efaf97d647f7689515f79ad85bbb962"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::payload::js_breakout::compute_js_breakout (cognitive 50): dalfox::payload::js_breakout::compute_js_breakout has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (32 pts), match/switch 5 (12 pts), boolean chains 4, loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/js_breakout.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d431e8b4df590714e5cdcfae34249e6dc9aa41cc06e043b1aacbe049a3e797ba"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist (cognitive 49): dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 3 (11 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/guards.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2a3e27acf5f93fd21f19d96ea08207f97b7cb8d723d6b5056edd0603a2c056"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::parse_raw_http_request (cognitive 49): dalfox::target_parser::parse_raw_http_request has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb2acf58f6d30af754bbb663101ed831502cd23db1c461927681a2c57c36e18"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::utils::html::nesting_overflow_offset (cognitive 49): dalfox::utils::html::nesting_overflow_offset has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (33 pts), boolean chains 9, match/switch 2 (6 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/html.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"00835516d58b301851383f9a8355dbcf8e29c84d37a0bd695c8db513d9a8544d"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::xml_inject::xml_injection_points (cognitive 47): dalfox::parameter_analysis::xml_inject::xml_injection_points has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 4 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/xml_inject.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ce3f9153f323eb3d5389b3a36f0bbf9a44efef150195b4beb179abea075831"}},{"ruleId":"D2","level":"warning","message":{"text":"Op::build (cognitive 46): Op::build has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 5 (13 pts), boolean chains 4, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f27b98285de62786ce57c66690e0428d07e9f0a762690c593c49d30b6bc2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_query::probe_query_candidates (cognitive 46): dalfox::parameter_analysis::mining::probe_query::probe_query_candidates has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_query.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd7e73cc9dad00f0d9cb7f8a15fd68aabc10d8fd68099181a0e292a3c83d085"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::output::render_results (cognitive 45): dalfox::cmd::scan::output::render_results has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (36 pts), loops 4 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/output.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"96675dbb633378c78f4ffe437740da2cd233a78db8dad43f0c7479682dec4425"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_variable_declarator (cognitive 44): DomXssVisitor::walk_variable_declarator has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e6159c358a561db2a6548d18fc5cb3f242de6d45a0defcb7f85fd1d5570ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanWorkerCtx::run_dom_phase (cognitive 44): ScanWorkerCtx::run_dom_phase has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd63dac9c0d89619bafac7a3edf1e6c5dd7728fba40cd43073b415fca5aad454"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::output::render_dry_run (cognitive 44): dalfox::cmd::scan::output::render_dry_run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (28 pts), loops 6 (14 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/output.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5655d9f58004291c255570935b42805aee2d3d217c38ffd1e97fef3b759894e"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::postman::build_request (cognitive 44): dalfox::target_parser::postman::build_request has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 7 (12 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/postman.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8add32b4ea2a455754dcddd23ed4204e1f5e99054a4f6413040f476160f1e3"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::escaped_echo_is_inert (cognitive 43): dalfox::scanning::check_reflection::escaped_echo_is_inert has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2583c86e3465d39442424aa8b9d2935c7411ce13c5e5965fb51fcc9104e4d708"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::waf::bypass::mutate::multi_slash (cognitive 43): dalfox::waf::bypass::mutate::multi_slash has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 5 (7 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b763f83a079ff0c58c65399a220d6777fe14a76900133154088645871b6f2b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::context_detect::detect_injection_context_with_marker (cognitive 42): dalfox::parameter_analysis::mining::context_detect::detect_injection_context_with_marker has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 5 (7 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 15). Of this number, 29 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f89203e34512d798a978b45b909f3b7e7a0172339cec51560619afc308c1d22"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::analysis::run_target_preflight (cognitive 41): dalfox::cmd::scan::analysis::run_target_preflight has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 2, match/switch 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/analysis.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d5d482f2b82cc323ad6c11c2de63f15bc94e9aa7cd7902680cf8554b44fcbb"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::xss_blind::blind_scan_forms_with (cognitive 41): dalfox::scanning::xss_blind::blind_scan_forms_with has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 5 (9 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_blind.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe000e8f78fbaedeb7191431dd62d576a7773b77e7b37672da3421e6b965615"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanOptionChecks::validate (cognitive 40): ScanOptionChecks::validate has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 13, loops 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job/mod.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fde041ba90774c93a794f4a299d5a8c28c16ea993073cd27b6bcf98d730f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::input::detect_input_type (cognitive 40): dalfox::cmd::scan::input::detect_input_type has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 2 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/input.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fda61a3a6cad6674422e73963d9466fd13d062bde8da19dee4226db061b3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Sampler::sample (cognitive 39): Sampler::sample has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 6 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f55b53b3e0c24ce2fddd37acf967d27a3546ce2a22fe7949a7f0d1590638ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::xss_common::generate_adaptive_payloads (cognitive 39): dalfox::scanning::xss_common::generate_adaptive_payloads has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6 (9 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_common.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b8ec94d58e33292d9355b3e7652e7df1f33c8e1324cf7166e05fdc57bdaddb"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_query::probe_bucket (cognitive 38): dalfox::parameter_analysis::mining::probe_query::probe_bucket has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 8, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_query.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a70d062b8b6abbe5f1413fc96425aa8f9601fb93c546d8473f91e67afc903f"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::propagate_mutation_taint (cognitive 37): DomXssVisitor::propagate_mutation_taint has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"485b87afa42dc0135e91edcad2e19bc024872a537f211e1a0cdd0e37b0ae3a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::register_function_summary (cognitive 37): DomXssVisitor::register_function_summary has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 12 (15 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/scanning/ast_dom_analysis/summaries.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a3028a1eeb7563d6b2075f4f581af777825b5c9a212d05f53ab6e8ebee4581"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::analysis::inject_marker_params (cognitive 37): dalfox::cmd::scan::analysis::inject_marker_params has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/analysis.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"afca404c9bb63b9c0972f06e610cd8e15e0213cdc072892c32f2e41c484ea826"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::poc::render_finding_block (cognitive 37): dalfox::cmd::scan::poc::render_finding_block has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24 (26 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/poc.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"803f8dca84d0f7d7d2c668c4335218e28eeb64908d7a4d5aedd9fd7ca5c6a1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_dom_analysis::source_nesting_exceeds_limit (cognitive 37): dalfox::scanning::ast_dom_analysis::source_nesting_exceeds_limit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2c202b46675f03f0bd3f154fd4d08c8aa44d21d2f4a4f669491da8f63ff2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_integration::js_blocks_from_document (cognitive 37): dalfox::scanning::ast_integration::js_blocks_from_document has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 3 (4 pts), boolean chains 3 (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/scanning/ast_integration.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1256a5251292963ae2d4a3b8cfdc359eabfceec94d2c4e7409c0945d881b39"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::js_context_verify::check_marker_in_expression (cognitive 37): dalfox::scanning::js_context_verify::check_marker_in_expression has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 11, loops 2 (6 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0edf3a7a64845769d4a7cf42fa76d42f20a659d70fa89aa2cae09827dfdcafb"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_body::probe_body_params (cognitive 36): dalfox::parameter_analysis::mining::probe_body::probe_body_params has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_body.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"91193ece876d6636729da1d93c00fcb979b913835cd51da799a1e05f914b4028"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::collect_declared_names (cognitive 35): DomXssVisitor::collect_declared_names has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (11 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"0086caa79452ca81d9d4bd1cdea1b2119b1a6a6c603b79714cf0e0847950225c"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::main (cognitive 35): dalfox::main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 8 (11 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c890d2fd0d30e425efb4e88081b1c8c5911321bc59a059f874c2ad008ce1ff"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::preflight::preflight_content_type (cognitive 34): dalfox::cmd::scan::preflight::preflight_content_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 5 (12 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/preflight.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7120fada71a829524ae45481e2bd5845376017ce63b83f7eaec840187c51481"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::scan_loop::run_scan_loop (cognitive 34): dalfox::cmd::scan::scan_loop::run_scan_loop has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/scan_loop.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a44efdccea05cf2510149ec9daeecbf08d5585197d8eaf4bdc6ae1081816021"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::has_marker_evidence_in_doc (cognitive 34): dalfox::scanning::check_dom_verification::has_marker_evidence_in_doc has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db147451982bd5eb5479c66fe072dc48ff862ca5028e0032e758d384e2eb15"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::poc::generate_poc (cognitive 33): dalfox::cmd::scan::poc::generate_poc has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 3 (4 pts), boolean chains 3, loops 2 (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/poc.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f194898f0209adf929661f817cc09d7243775203ffd36fa6af305a330884e57"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::ensure_sxss_candidate_params (cognitive 33): dalfox::parameter_analysis::ensure_sxss_candidate_params has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b0c7d14a067e822156f2f5ba3bbca52253d5b025d750d25d2eeb5840318271"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::classify_dom_evidence_in_xml (cognitive 32): dalfox::scanning::check_dom_verification::classify_dom_evidence_in_xml has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 21, if/else 8 (11 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"51aba7dae70028e1832cfa9a16c1c3a33392a177fdf4f0e9dad29639e6fa49a6"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::startup::prepare_and_validate (cognitive 31): dalfox::cmd::scan::startup::prepare_and_validate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/startup.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f14eb93792f5c108df63ec334a25b6a2b0126d74a3d44378c2a3cca32ac047"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_multipart::probe_multipart_params (cognitive 31): dalfox::parameter_analysis::mining::probe_multipart::probe_multipart_params has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_multipart.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3c463da940a295de46151f8fea7efd83cbd6fb421407c871acfa026ff7adeb"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::run_scanning (cognitive 31): dalfox::scanning::run_scanning has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 3, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34d80c032a30ca277b140049f5da2f6f9d8c45a88b655af0dd5f5fc56be8c39"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanWorkerCtx::run_reflection_phase (cognitive 30): ScanWorkerCtx::run_reflection_phase has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e0f0999c5465c72dfeaf4214f4511a43f14b53a24bf5aa127a55d672c71484"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::context_detect::has_knockout_html_clause (cognitive 30): dalfox::parameter_analysis::mining::context_detect::has_knockout_html_clause has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c716980b0e1b5ddbfe96ec8951fb8f414b45ad25316297d1e18b8c7873b0f70a"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::payload::xss_csp_bypass::get_csp_bypass_payloads (cognitive 30): dalfox::payload::xss_csp_bypass::get_csp_bypass_payloads has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 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/payload/xss_csp_bypass.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e812f2ae95e0be05c75f103a4dfc52b601ec81e5bdcd3fc73486a7239549cbce"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::uploaded_file_urls (cognitive 30): dalfox::scanning::check_reflection::uploaded_file_urls has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"556af778d9a4dcaf8b055d934e6f6473543a096de78d08eea182cf10ddd9d4be"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::utils::http::send_with_retry (cognitive 30): dalfox::utils::http::send_with_retry has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/http.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"6804429b7e9f93d84233cf3dfa20417b5ab47133a9bbb4fa3e33edc187191b37"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanWorkerCtx::process_reflection_result (cognitive 29): ScanWorkerCtx::process_reflection_result has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 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":"src/scanning/mod.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ed6d76fca5d1cd2099f7f893779221a0b47bfe33bffbbbe7237f289afde684"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::blind::arm_and_dispatch (cognitive 29): dalfox::cmd::scan::blind::arm_and_dispatch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/blind.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15012a85aa08d7a2d05e0211f568cffe808c7d3f3dd43b7c808011ea30606bd"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::path::check_path_discovery (cognitive 29): dalfox::parameter_analysis::discovery::path::check_path_discovery has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/path.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"369cd6e34e86a560c8efb0ca4ebffcd942f5de57006107a8011dd7dca6c83489"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_integration::has_self_bootstrap_verification_normalized (cognitive 29): dalfox::scanning::ast_integration::has_self_bootstrap_verification_normalized has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 14 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c2522e6d0d8ac27928634a6d133d5698e53b6cc8e85fa8644147fcde691297"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::verify_sxss_dom (cognitive 29): dalfox::scanning::check_dom_verification::verify_sxss_dom has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e281792ab2504df90667af4a777a5976e909ffe13a2fae48e149daa70875822"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::promise_kind_of_call (cognitive 28): DomXssVisitor::promise_kind_of_call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/async_flow.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc543cb6521a8b1cb760c0cb72859e3f0fb5618f74b593da1e122288c8fc3042"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::job::send_reachability_probe_inner (cognitive 28): dalfox::job::send_reachability_probe_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 5 (12 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job/mod.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"94957bfca384bb1ad8667281a92ceb720543dd71ca52434a895ed6ed2148d34c"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::mining::probe_json::probe_json_body_params (cognitive 28): dalfox::parameter_analysis::mining::probe_json::probe_json_body_params has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_json.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f3cd899df1a6aed66c60f1d1399c602ae161269ff6e6d6a24f40d63ceec311"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::sxss_store_probe (cognitive 28): dalfox::scanning::check_reflection::sxss_store_probe has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be09558c2203216cd99c99a6fee50d5c7b1652f014775ac3152dcdb38ec96d8"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::resolve_apply_argument_taint_at (cognitive 27): DomXssVisitor::resolve_apply_argument_taint_at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/bound_calls.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ca0a4ee8439035f6355f472c56382ade4fd8ab89c8b7bcbcd2c184455e6914"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::handle_object_assign_sink (cognitive 27): DomXssVisitor::handle_object_assign_sink has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d00088f5d6fbf34ea283326837b21bfce5dd1da6f5f71d8c845296211e38d0"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::analyze_parameters (cognitive 27): dalfox::parameter_analysis::analyze_parameters has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"369d8b384476c35919112c8c3f978bc690721be559b8ac9f5337c07776396bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::classify_reflection (cognitive 27): dalfox::scanning::check_reflection::classify_reflection has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 6 (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/scanning/check_reflection.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13058d2459d07b572f119fff7f909983aa8d1a6836744f417ec2c1c18c99f51"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::vuln_libs::detect_vulnerable_libraries (cognitive 27): dalfox::scanning::vuln_libs::detect_vulnerable_libraries has cognitive complexity 27 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/vuln_libs.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c1c1754e71c59b50848439d1e8e90238f8e3e606bd82f53d7ecbf6d5969ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::server::run_server (cognitive 27): dalfox::server::run_server has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, match/switch 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb13ba2f833393d0d656d9fe19850826b88a2ca6bb56cb3b578d9826cad68ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_call_expression (cognitive 26): DomXssVisitor::walk_call_expression has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e95116c6424fcfb6a915173a324ec92efeb26de71111a538b1bb9d0c1a9ef14"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::register_module_exports (cognitive 26): DomXssVisitor::register_module_exports has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 5 (7 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb41b8472961e7e25de82e98242b183796067bbfc5df257a539309a91a40d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::payload::synthesis::synthesize_payloads (cognitive 26): dalfox::payload::synthesis::synthesize_payloads has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/synthesis.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac4864acecb546766cc317f79a8b403d684ece72f1d2c1adbadfa3a354d944c"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::light_verify::verify_dom_xss_light_with_client (cognitive 26): dalfox::scanning::light_verify::verify_dom_xss_light_with_client has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/light_verify.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebf816d5dfeb3d0fb0bf0ef4c5c9b53045e014aeec747706dfef747b8873b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::dedupe_reflection_params (cognitive 25): dalfox::parameter_analysis::discovery::dedupe_reflection_params has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"65189f961af2f8f333f92ab40ba103d4b46387daad7c6be34bc0a3c0d7143393"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::xss_blind::build_blind_templates (cognitive 25): dalfox::scanning::xss_blind::build_blind_templates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_blind.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c750f33a042e25439a15412d964695c4344c533578246b401d9fcb2ccfe333e5"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::openapi::parse_openapi (cognitive 25): dalfox::target_parser::openapi::parse_openapi has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47846e21b4186db015c902a34d2b27d468618da094c89ff2dc66d2823efa8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_function_scope (cognitive 24): DomXssVisitor::walk_function_scope has cognitive complexity 24 (threshold 15). Drivers by points: loops 14 (16 pts), if/else 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34244d380ca00de217ff0346ea8d99dbc039e58926f8fa8229ab8be708bacd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanWorkerCtx::probe_param (cognitive 24): ScanWorkerCtx::probe_param has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bec2aeee1cf09853729046581f883e0bb74b5830f0416b420425ca3108fbcca"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::has_html_structural_evidence_in_doc (cognitive 24): dalfox::scanning::check_dom_verification::has_html_structural_evidence_in_doc has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04aafea65d7eca9f54c52b30b0b4d0cd0f4ddc557f3c17f11843deeba55001c"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::csti::probe_confirms_csti (cognitive 24): dalfox::scanning::csti::probe_confirms_csti has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/csti.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4137547712255e1b973e362288ad1c2feb2fc544ed38d8456098ec6c0f1627f"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::request_render::build_request_text (cognitive 24): dalfox::scanning::request_render::build_request_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, match/switch 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/request_render.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"09979bcc3bbe16fad401ce3de4344aea528aeb7d1a9d2770a639a4d86b94f022"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::url_inject::build_hpp_url (cognitive 24): dalfox::scanning::url_inject::build_hpp_url has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2, match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/url_inject.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43df030c3cd4812811bffa0215ad5518ed71be3c2ca19a410fe1f80a77fdf9b"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::static_member_is_tainted (cognitive 23): DomXssVisitor::static_member_is_tainted has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"581ef5baa239df0a002d3e4e599d40d60803673f4bd1a05b8df501946da8499c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanWorkerCtx::run_hpp_phase (cognitive 23): ScanWorkerCtx::run_hpp_phase has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d163b94e84909e3a48700cacf673011e9518ba68c2d297d7a407b980e2d54fa"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_integration::build_dom_xss_poc_url (cognitive 23): dalfox::scanning::ast_integration::build_dom_xss_poc_url has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 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/scanning/ast_integration.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d045797a4d16ccd59f495e5e35e916e47aefc6bb514bec79ca8cd9f1f2f5e899"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_integration::build_dom_xss_manual_poc_hint (cognitive 23): dalfox::scanning::ast_integration::build_dom_xss_manual_poc_hint has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"964a7f00d5725863759036b52fb23f35642d02a5efddde31be44fade00e07f36"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::url_inject::multipart_fields (cognitive 23): dalfox::scanning::url_inject::multipart_fields has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/url_inject.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bb7f3a8d7f838611da8a79995a03e68daa499692a5e2620a96d055dae06d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::waf_strategy::expand_waf_payloads (cognitive 23): dalfox::scanning::waf_strategy::expand_waf_payloads has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/waf_strategy.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df95cb342c111ee68ada4903dd019ada51bdbff66fd3e3794247855f74959a2"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::content_disposition_attr (cognitive 23): dalfox::target_parser::content_disposition_attr has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (8 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/mod.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"0218e66be5a96cf2a91b842da62751d8cefa883de661575e6e6802554888e334"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::waf::bypass::mutate::find_sink_call (cognitive 23): dalfox::waf::bypass::mutate::find_sink_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dff00fa68e8e8624b23e36aaf8a75997aa6afb5c2044d5303181eba2c133ae"}},{"ruleId":"D2","level":"warning","message":{"text":"DalfoxMcp::scan_with_dalfox (cognitive 22): DalfoxMcp::scan_with_dalfox has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4eba9d0b3c71399cf6582060665de39140595b6d3e0ca94718cafcf0ceb834"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::untaint (cognitive 22): DomXssVisitor::untaint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/guards.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6696c785c833372665a188260f8f4ec2b01a2a82b64bf548c2c55ffe9d54e35"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_dom_phase::fetch_and_analyze_external_js (cognitive 22): dalfox::scanning::ast_dom_phase::fetch_and_analyze_external_js has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_phase.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a934ac5f440ace73aa7a10fd0da2345adff9ca55eb49c462de028d0e4e4cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::is_in_safe_context (cognitive 22): dalfox::scanning::check_reflection::is_in_safe_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1285126a2cb6d933a0f7baf738767e13b1a2c04dcaf052f7e3e5eb39072f2142"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::raw_reflection_inert_in_text (cognitive 22): dalfox::scanning::check_reflection::raw_reflection_inert_in_text has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff3aef5845f7c557dbab52bd2b7a096cb997f1bea06ba6d47f68a55137255d1"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::utils::term::skip_escape_sequence (cognitive 22): dalfox::utils::term::skip_escape_sequence has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/term.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f511d64a344ef0ef471f5726fee9f243dca5d075710f6624ce18f96a93557a"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::concat_parts (cognitive 21): DomXssVisitor::concat_parts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (6 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/url_lead.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"169c2172bcbd951065bc36ccd75197101c1d1357e1a5eafa2bed2b651e74e310"}},{"ruleId":"D2","level":"warning","message":{"text":"Result::results_to_sarif_with_meta (cognitive 21): Result::results_to_sarif_with_meta has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/result/format_sarif.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f872663126f6a33878f4a2a0d3642e6032d3705dc6c76e0c1e8f525cdf7960"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::output::render_only_discovery (cognitive 21): dalfox::cmd::scan::output::render_only_discovery has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/output.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e694c5983882ca118635683bce77528865907c7d9044c54b2253edaddf34f92"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::payload::xss_csp_bypass::analyze_csp (cognitive 21): dalfox::payload::xss_csp_bypass::analyze_csp has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/xss_csp_bypass.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7956f12342ee557eb5a702256055d462e77e82e7a12921c15265ad4ac307c2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::ast_integration::reflected_markup_from_document (cognitive 21): dalfox::scanning::ast_integration::reflected_markup_from_document has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7209495cf85902e92e10d1e3e7f6dfa5644d122e58ee350766056174b1639413"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanWorkerCtx::scan_param (cognitive 20): ScanWorkerCtx::scan_param has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6e27340fc76cbaa0752de8a87c1656e2f41afeed16448a5cccc32bd985a563"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::vuln_libs::judge (cognitive 20): dalfox::scanning::vuln_libs::judge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/vuln_libs.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"946c8de64f81ed7102007acc779defe4c507e37abac8b82c7a53936e78c91e68"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::postman::parse_postman (cognitive 20): dalfox::target_parser::postman::parse_postman has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/postman.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a0b694597112440e7c737967130dcf3f87f7ddd230bbb99eb120fb65acc119"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::resolve_wrapper_param_argument_taint (cognitive 19): DomXssVisitor::resolve_wrapper_param_argument_taint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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/scanning/ast_dom_analysis/bound_calls.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"802ce221f6d5ef4ec4cf3aaf6af355d2ebfc1c93bea2d849db4057166dab071c"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_destructured_event_handler_body (cognitive 19): DomXssVisitor::walk_destructured_event_handler_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (9 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/events.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fcc53ba4cc8b1e4545fb316d9081c5e08cd2783540f76545e68bfa398d84d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::register_class_method_summaries_for_name (cognitive 19): DomXssVisitor::register_class_method_summaries_for_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/summaries.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc9c83e06af95b9fbc319e53937038a0c34464e2e2b4b9e5f22ee90eae91e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::is_tainted (cognitive 19): DomXssVisitor::is_tainted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, match/switch 3 (5 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/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ed0a06f448e4098e8cf42b993d81b4fc5eefd66086892c4db225fb5bac6423"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::classify_tt_create_method (cognitive 19): DomXssVisitor::classify_tt_create_method has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 6 (8 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/trusted_types.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aade57e1e00630a8cf0d6d54c74d3e078e2e4fa34d2535da055bd1ec691fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::baseline::parse_report (cognitive 19): dalfox::cmd::scan::baseline::parse_report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/baseline.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf2c9f8f76b29e68acf72b61af94e859fc0467359bec304a1e61ec1286a0928"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::payload_has_handler_sink_text (cognitive 19): dalfox::scanning::check_dom_verification::payload_has_handler_sink_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, loops 3 (5 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/scanning/check_dom_verification.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ff53461f4a58284a76219742e8ac4da28e9de07670bee95924fd83ebc0f94c"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::xss_blind::blind_scanning_with (cognitive 19): dalfox::scanning::xss_blind::blind_scanning_with has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_blind.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b3dcc599a67f49009ba326c86f088e4c275ec7b703022d04044f2d8018cd89"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::har::parse_har (cognitive 19): dalfox::target_parser::har::parse_har has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/har.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5239a1591dd62ed28516ef815e04d6a18fc30793234a8aef00dd5b2cb3c969e8"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::waf::bypass::mutate::find_first_tag_attr_break (cognitive 19): dalfox::waf::bypass::mutate::find_first_tag_attr_break has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"45600cd1740de6275b475e6ce41ef4edc4b99d4c3d042fef25bfb47b49342b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::waf::bypass::mutate::mixed_html_entities (cognitive 19): dalfox::waf::bypass::mutate::mixed_html_entities has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcf63a0e75bd2b30d5a2f8ca6f3f098100e6ff68e69ef4ad70e40f4608936e9"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::waf::bypass::mutate::is_inside_rawtext_element (cognitive 19): dalfox::waf::bypass::mutate::is_inside_rawtext_element has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6327ac10ad4b1c3e49b9854e8adaa0d7f37a956d46bd209916036f8033efde"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::url_call_lead (cognitive 18): DomXssVisitor::url_call_lead has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/url_lead.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"85796ea49dde5cb2e00a5bd570e51cff313f226a592528469b62e8c7b589448d"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::walk_class_members (cognitive 18): DomXssVisitor::walk_class_members has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d3a1c8e2863b1fa78e880e57919c3e61b559e2a262bc5101afe13890059c28"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::session::classify (cognitive 18): dalfox::cmd::scan::session::classify has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/session.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b255459d36ae29a0f489e54b2228bdb9b77d54ff836a6d65bbe4d41a2af69c1"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_dom_verification::classify_dom_evidence (cognitive 18): dalfox::scanning::check_dom_verification::classify_dom_evidence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"add2acab3db35c9800b78cc5a2ade44ab86f7434fa00a19de1317bcc2f1f5dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::check_reflection_with_hpp_url (cognitive 18): dalfox::scanning::check_reflection::check_reflection_with_hpp_url has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":3251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4923e412313f73caa779c5cb5b281485d499ef2652b193be40619f8d8fa4b64a"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::payload_families::get_dom_payloads_for_context (cognitive 18): dalfox::scanning::payload_families::get_dom_payloads_for_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/payload_families.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ccdd24c29a395211115526ba566c5a79e6f4b35973ef814b59bfdb6ad5ec3c"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::server::cors::compile_allowed_origins (cognitive 18): dalfox::server::cors::compile_allowed_origins has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/cors.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"985f2fa5698f92157fef94b4d5afa306f94f67725e0d63a6062930d7bdb577c7"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::process_promise_callback (cognitive 17): DomXssVisitor::process_promise_callback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/async_flow.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28dd1933991e826826a310557ee5ccf534e13ea3ea5178fc920278402549811"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::collect_guards (cognitive 17): DomXssVisitor::collect_guards has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/guards.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5131625cd7cc0cbefdf8191a2cc58051e206d414a755eaac620a12f15f5ebb85"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::validation::validate_numeric_args (cognitive 17): dalfox::cmd::scan::validation::validate_numeric_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/validation.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9936c382180518b3ce87989544986108ce249f8967a4998e3852887388f8cd"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::ensure_explicit_params (cognitive 17): dalfox::parameter_analysis::ensure_explicit_params has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f915aeaa9aeb9165cfa06c9f8ba64a0092f4310586042d7d1e2608f53caeb0a4"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::openapi::render_xml (cognitive 17): dalfox::target_parser::openapi::render_xml has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), boolean chains 4, match/switch 2 (4 pts), if/else 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"4541b53e9a10079d29a52efc4b818bd648185e9372f85f66131a9a76608b9dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::utils::xml::nesting_overflow_offset (cognitive 17): dalfox::utils::xml::nesting_overflow_offset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/xml.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e47fbfabc9d627f65b235287925d6dda0bfc789c77690c26c029741b8521e0"}},{"ruleId":"D2","level":"warning","message":{"text":"DomXssVisitor::static_member_source (cognitive 16): DomXssVisitor::static_member_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/bindings.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af5a252ba377bbbe2c3f580feaa9aa6ac6b64ef554097259b1ba85031db7743"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveredSourceIndex::build (cognitive 16): RecoveredSourceIndex::build has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), boolean chains 4, if/else 2 (4 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/xml.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7f34da7148d653a1bdf141a2d3ae7bb8f9025501f9b6a7dfc6ab1313981e08"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::cmd::scan::input::apply_out_of_scope_filter (cognitive 16): dalfox::cmd::scan::input::apply_out_of_scope_filter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/input.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd5a0ed10c6f60f469c24452df929b7635e35697d1af0e12910757f13766f09"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::parameter_analysis::discovery::header::check_header_discovery (cognitive 16): dalfox::parameter_analysis::discovery::header::check_header_discovery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/header.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bda403cbfae6b1acdcbfcf36adc879dbe27316874a2aac163d345acab3c73d9"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::scanning::check_reflection::is_payload_inert_in_scripts (cognitive 16): dalfox::scanning::check_reflection::is_payload_inert_in_scripts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d5a3209c6439dc29f6dd78c79861b5be124d6513cf62c7212905f140022aac"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::target_parser::postman::substitute (cognitive 16): dalfox::target_parser::postman::substitute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/postman.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b783a9fb99d56513a703d5c8c98cbe4b4a346b61adda65fd1b862475b35edf37"}},{"ruleId":"D2","level":"warning","message":{"text":"dalfox::waf::bypass::mutate::sink_in_attr_context (cognitive 16): dalfox::waf::bypass::mutate::sink_in_attr_context has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"03316d3ce986ccca8db61930b719d460d9cbae60335cac7aef4717e1e1ece29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): src/parameter_analysis/mining/probe_body.rs:11-166 | src/parameter_analysis/mining/probe_json.rs:11-166 \u2014 These two members are variants of one another: 67 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_body.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7577446c0bb63555c0265a5bf98c15bfac4d545c1bd3bc149a08fb092cb0148f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): src/parameter_analysis/mining/probe_graphql.rs:23-97 | src/parameter_analysis/mining/probe_xml.rs:35-119 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_graphql.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c2cdeda8a747996ae7c38457d837b95577ca2720fb521f9cbc81bc2f99e012"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/scanning/check_dom_verification.rs:766-805 | src/scanning/check_dom_verification.rs:811-839 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa1d21c32b6d4c5d548454968c480ac191ee308acbe31edfa7ffe38ad420ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/scanning/check_reflection.rs:622-661 | src/scanning/check_reflection.rs:742-776 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"522de012ee6183b822c2e3905d3a7c22a9e93fcfdcf8a85ea8cbe44fe92d7e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/utils/html.rs:196-217 | src/utils/html.rs:271-295 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/html.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbef1e7643d8c118e3640cb87890d69a6e21e8bed1b496e1e6b909815a9c03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/payload/xss_html.rs:16-122 | src/payload/xss_html.rs:126-166 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/xss_html.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c21393af1ced4f86fd4e7903447098f5727e6cb75e7a739661d7fd725ddd21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/scanning/js_context_verify.rs:1079-1101 | src/scanning/js_context_verify.rs:1111-1129 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"145df0e7139e17ef82c6a279f364d7129f4cf4871515f0241cb1d62b9e68d036"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/scanning/check_reflection.rs:372-398 | src/scanning/check_reflection.rs:869-895 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"43515c0367a4ab62ff1753a4d5bb16d36c694c70d58809edf86ef041dc728f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/utils/xml.rs:616-631 | src/utils/xml.rs:633-651 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/xml.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4f3682c62a0041576180262f0a1dfc96108e3004e973c58361b4b7704bf396"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/scanning/js_context_verify.rs:432-448 | src/scanning/js_context_verify.rs:450-464 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"7102116fe4f40c0207f866a891be9f8064fd97bc71f6c5863ef5c6f0a690932f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): src/waf/bypass/mutate.rs:226-239 | src/waf/bypass/mutate.rs:261-274 | src/waf/bypass/mutate.rs:298-311 | src/waf/bypass/mutate.rs:637-653 | src/waf/bypass/mutate.rs:781-792 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b812059a9af616291e71d50709511d533ffd68689480edb6a7472ca195bf1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/waf/bypass/mutate.rs:144-161 | src/waf/bypass/mutate.rs:763-775 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2524c9489733cb1051ae22fa1327891756714c20a6dc1d41a096c3b418193e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/scanning/check_reflection.rs:476-499 | src/scanning/check_reflection.rs:1396-1418 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1487cfd49fa6365dddd752ed4eab9d01397a39164aaa7b94f053c1fa4f6d7a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/scanning/ast_dom_analysis/taint.rs:377-394 | src/scanning/ast_dom_analysis/taint.rs:407-420 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e177653c630ac6edd114764acdb4204cdb86bbd014613a25cc6a78a02121610"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/cmd/scan/output.rs:993-1003 | src/server/util.rs:181-190 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/output.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b236887bd01fc6b9172e3326b6311094a12cca3ad3d4ce69209108bd19e588"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/encoding/mod.rs:184-196 | src/encoding/mod.rs:213-224 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoding/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bc5a1d82feb28a2aaf528d2700d4240b8dddfe64fbd34df02c5684d32a9579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/parameter_analysis/mining/context_detect.rs:41-49 | src/parameter_analysis/mod.rs:453-461 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aeddde45ab42a0cf2207a98d0876eabc9d6bd804e64d3584ec7685be6ab434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/parameter_analysis/discovery/mod.rs:30-36 | src/parameter_analysis/mining/probe_response_id.rs:25-31 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e482fbd8ad0089de4e41142208711d6050a6b91d1acd00592ec6653ecf2bcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/parameter_analysis/discovery/mod.rs:39-44 | src/parameter_analysis/mining/probe_response_id.rs:35-43 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ef18979992027d5b6b5f4a93138f9ff67a91ad307c0e4a66beaa53c501bd73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/payload/remote.rs:366-370 | src/payload/xss_csp_bypass.rs:508-514 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/remote.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5693dc9038c0364443566868437af62cb630f7d311f1aaa291b490a38abb4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/scanning/js_context_verify.rs:242-245 | src/target_parser/mod.rs:176-179 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e224cfbb70fe92cb041f47c750217b224efe5a8cb14ea1169a4d2f4d707ebc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 2): src/scanning/check_dom_verification.rs:1215-1236 | src/scanning/check_reflection.rs:2911-2936 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/check_dom_verification.rs:1215\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b52767f8a9b8693a5ac1b386d260604eba161a4b69e9aeb74059aa37e7195fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/parameter_analysis/mining/probe_body.rs:142-165 | src/parameter_analysis/mining/probe_json.rs:143-166 \u2014 before extracting anything, compare \u0060src/parameter_analysis/mining/probe_body.rs\u0060 and \u0060src/parameter_analysis/mining/probe_json.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/mining/probe_body.rs:142\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_body.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"00562dd154bcc3396625aa2721b18dff82cb33d09c36b8330825297481e25d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/parameter_analysis/discovery/form.rs:467-488 | src/parameter_analysis/discovery/form.rs:544-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/form.rs:467\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8bf1ffc14f2ed920363a023b9f47602a7486b5d0270e62e9a28a73dd317872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201320 lines \u00D7 2): src/scanning/param_jobs.rs:287-306 | src/scanning/param_jobs.rs:332-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/param_jobs.rs:287\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/param_jobs.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e494b56c4a4c9d735aea6e1fb36ffd9431de04bb526c719894cca166768692f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/parameter_analysis/mining/probe_body.rs:72-89 | src/parameter_analysis/mining/probe_json.rs:75-93 \u2014 before extracting anything, compare \u0060src/parameter_analysis/mining/probe_body.rs\u0060 and \u0060src/parameter_analysis/mining/probe_json.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/mining/probe_body.rs:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parameter_analysis/mining/probe_body.rs:71\u0060 calls \u0060clone\u0060 and \u0060src/parameter_analysis/mining/probe_json.rs:73\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_body.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a231249e4844741a14c83012d4a4051c2738ad6765eb3605e29bed163f5c2bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/scanning/ast_dom_analysis/sinks.rs:949-966 | src/scanning/ast_dom_analysis/sinks.rs:1073-1091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/ast_dom_analysis/sinks.rs:949\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn handle_wrapper_invocation(\u0026mut\u0060 in one and \u0060super) fn handle_reflect_apply(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf46b79b0dbd9a96551fed41aee9d1141d5913348d6051a74e984715a8a10e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/scanning/js_context_verify.rs:859-875 | src/scanning/js_context_verify.rs:919-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/js_context_verify.rs:859\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"6554fa6ff65480358c2ae26fe1a3c89ea8cace8c67efc01a31e29235c2093451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/parameter_analysis/mining/probe_graphql.rs:63-78 | src/parameter_analysis/mining/probe_xml.rs:86-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/mining/probe_graphql.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_graphql.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb49a90de9a1d809016b3e664a5045b18c101f9a7c80e408899cac0276e265a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/payload/xss_html.rs:108-122 | src/payload/xss_html.rs:151-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/payload/xss_html.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/xss_html.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9c3d5f61435cf95b7266906b8bd2d92cadd7c2e638acb74ba7e7cd272abb89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/scanning/check_reflection.rs:220-234 | src/scanning/check_reflection.rs:876-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/check_reflection.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"138570d994d1438a4e20e9dfaee31ff70a67b6c1e604846bb86f2ec7cd1b390c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/scanning/ast_dom_analysis/sinks.rs:812-825 | src/scanning/ast_dom_analysis/sinks.rs:993-1006 | src/scanning/ast_dom_analysis/sinks.rs:1114-1127 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn handle_summary_and_sink_call(\u0026mut\u0060 in one and \u0060super) fn handle_wrapper_invocation(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"9134ed3cbc41bbba183ff13d63640a7169949896b5a761b1ced6ce0150aeab32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parameter_analysis/mining/probe_body.rs:121-134 | src/parameter_analysis/mining/probe_json.rs:122-135 \u2014 before extracting anything, compare \u0060src/parameter_analysis/mining/probe_body.rs\u0060 and \u0060src/parameter_analysis/mining/probe_json.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/mining/probe_body.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_body.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d5c04e9a14357d2eafb2828f67240f9c8c38ee0b1efe491857a293b01d9c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/server/handlers.rs:31-44 | src/server/handlers.rs:659-670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/server/handlers.rs:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/handlers.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e290db3d3f9260824ce0b6cdb0a49de2ac56625b3e1dddca57f25116a144f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201313 lines \u00D7 2): src/scanning/check_reflection.rs:2664-2669 | src/scanning/check_reflection.rs:2754-2766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f2c55c798c37216c215aa2e23b74bb5667a919e7f46af8c0be6d788d190c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/scanning/check_reflection.rs:2764-2776 | src/scanning/check_reflection.rs:3273-3284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/check_reflection.rs:2764\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffdc781299f1b90f54529499b2a7f321483e6dabe138ded9c9ec4bf91d9bb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): src/scanning/check_dom_verification.rs:1224-1235 | src/scanning/check_reflection.rs:2701-2708 | src/scanning/check_reflection.rs:2924-2935 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/check_dom_verification.rs:1224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62afe59c8f5759947ffe4d9f902ebb0462eb839b79f2e41108ec311af1dd53e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmd/scan/output.rs:301-312 | src/cmd/scan/output.rs:322-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/output.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a647df6f5508306af5798514bb5d5f9d160eb917925fe95d62b8a972e9b183ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/parameter_analysis/mining/probe_body.rs:41-51 | src/parameter_analysis/mining/probe_json.rs:50-61 \u2014 before extracting anything, compare \u0060src/parameter_analysis/mining/probe_body.rs\u0060 and \u0060src/parameter_analysis/mining/probe_json.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_body.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"70abbbc12a5a7195d5d7ca1cee7353a4441100669bf417ac5635c932e977e9a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/utils/fs.rs:73-84 | src/utils/fs.rs:122-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/utils/fs.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/fs.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1facc5ce8ec0f9239db652cd0537718983c7b102c9af640fa63dd154eb62225b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/waf/bypass/mutate.rs:68-79 | src/waf/bypass/mutate.rs:94-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/waf/bypass/mutate.rs:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc035a812d88f12a30137bbe24f2da3507a4a98f998a1a22ee0160cd9691929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/scanning/js_context_verify.rs:841-851 | src/scanning/js_context_verify.rs:863-873 | src/scanning/js_context_verify.rs:923-933 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/js_context_verify.rs:841\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/scanning/js_context_verify.rs:853\u0060 calls \u0060gather_arguments\u0060 and \u0060src/scanning/js_context_verify.rs:874\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"38397f23316ff3d7f644d7d84c916fdb5a4bd2b7654408dba3ee4d29609146db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/scanning/ast_dom_analysis/sinks.rs:719-729 | src/scanning/ast_dom_analysis/taint.rs:219-229 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/scanning/ast_dom_analysis/sinks.rs:715\u0060 calls \u0060pub\u0060, \u0060handle_summary_and_sink_call\u0060 and \u0060src/scanning/ast_dom_analysis/taint.rs:216\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c23eff7a78092fb39b797b2b042a8a46366a9973f1afe8e030d2a39e37e4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/scanning/check_dom_verification.rs:1229-1239 | src/scanning/light_verify.rs:33-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/check_dom_verification.rs:1229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2001d930d469ccb4b6567470658a43cdc25d8b940d9b6a5a882c8e423e89476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/scanning/check_reflection.rs:1521-1531 | src/scanning/check_reflection.rs:1746-1757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/check_reflection.rs:1521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f850f54cd5fa61bb9ef93d6d39b64e002eb66ebe1e6f7012b29d9d34873329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/scanning/js_context_verify.rs:609-619 | src/scanning/js_context_verify.rs:622-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/js_context_verify.rs:609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"a626d6c9c9fac92650e3634549b2a16c2291bb3ee2f71871548e96bfd9b5a10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/scanning/payload_families.rs:503-512 | src/scanning/payload_families.rs:541-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/payload_families.rs:503\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/scanning/payload_families.rs:502\u0060 calls \u0060generate_dynamic_payloads\u0060 and \u0060src/scanning/payload_families.rs:539\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/payload_families.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"256d5d36f2186da29652f0aabdee5e5f521210fc283f9b158237ce7cc571cafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/parameter_analysis/discovery/form.rs:207-215 | src/parameter_analysis/discovery/form.rs:277-286 | src/parameter_analysis/discovery/form.rs:345-353 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/form.rs:207\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfd4dbf95744a6fc1936b07e6c10b0512be8e47bbd70fb42f4217e3cab1bff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parameter_analysis/discovery/cookie.rs:35-44 | src/parameter_analysis/discovery/header.rs:118-127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/cookie.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/cookie.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"40536baeb84848ae14bf91e215ffcabf88c7f85f2ec163db32048322450427ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/parameter_analysis/mod.rs:1024-1033 | src/parameter_analysis/mod.rs:1199-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83b88ff21a825337abcbda8af2071bdff421ff283de9f5bf543266e81cf5d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/scanning/js_context_verify.rs:945-954 | src/scanning/js_context_verify.rs:963-972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2006f3f7767caabad24fae544abab6934a3dee11a69f83a7289296fa12680f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/parameter_analysis/discovery/form.rs:382-390 | src/parameter_analysis/discovery/form.rs:474-482 | src/parameter_analysis/discovery/form.rs:551-559 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/form.rs:382\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parameter_analysis/discovery/form.rs:391\u0060 calls \u0060of\u0060 and \u0060src/parameter_analysis/discovery/form.rs:483\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d74651023daa7fbfb723102c3e8217799a09e2dac41139b956f38008a8d8536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parameter_analysis/discovery/form.rs:455-463 | src/parameter_analysis/discovery/form.rs:532-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/form.rs:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"23db6dd8905055ee8265c644084e441620dee25f95dd3c98b7124e9fae083198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/scanning/ast_dom_analysis/walk.rs:113-121 | src/scanning/ast_dom_analysis/walk.rs:127-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/ast_dom_analysis/walk.rs:113\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"186b95a4b013c65b65f678e936147158dfc1707930e981b6380fad2525023cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/scanning/check_dom_verification.rs:767-775 | src/scanning/check_dom_verification.rs:812-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/scanning/check_dom_verification.rs:781\u0060 calls \u0060insert\u0060, \u0060parse_document_bounded\u0060 and \u0060src/scanning/check_dom_verification.rs:821\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f01e788e9e212131e9d2eadf497ff37ee34651b839160d1223b0a43c76ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmd/scan/startup.rs:378-385 | src/job/runner.rs:478-485 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/startup.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"94501cfda936e9ce293142d3a045da3586fe77fe7955c0a69e938196e4160314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/encoding/pipeline.rs:220-227 | src/encoding/pipeline.rs:278-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/encoding/pipeline.rs:220\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoding/pipeline.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5fd690cb262fe6f9cf1a3d5ada1c3448c3248b19d7bea6f1ef2136d04e5d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/scanning/ast_dom_analysis/taint.rs:184-190 | src/scanning/ast_dom_analysis/taint.rs:231-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/ast_dom_analysis/taint.rs:184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe27441a29c77fa66b278b50e4e99a80df1e83ce8ae5ddffd2297e9376ece6df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/scanning/js_context_verify.rs:582-589 | src/scanning/js_context_verify.rs:1393-1400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/js_context_verify.rs:582\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9dfba995cb54967fb4939107fc69fee853b6351fcbbf2b38cbce8d7abc1ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/scanning/js_context_verify.rs:839-846 | src/scanning/js_context_verify.rs:877-884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/js_context_verify.rs:839\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/js_context_verify.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eef5f3f5191ad1dac289e2568e37c1bedc2cdb9852baca6ecbe56beb800110d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/utils/xml.rs:458-465 | src/utils/xml.rs:586-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/xml.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63aa35c10ff691001e7dd83df71fbf92c5294ab53d87556c78820c6d182ba47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/waf/bypass/mutate.rs:644-653 | src/waf/bypass/mutate.rs:783-792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/waf/bypass/mutate.rs:644\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daf8b497cbf504a5cc65e7b00c93e024e7889fde9327c2e7ca164689fbc28c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/cmd/scan/input.rs:689-695 | src/cmd/scan/input.rs:1280-1286 | src/job/runner.rs:46-52 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/input.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"894dae86c50d83b4cb3f73d3dfe7f769bac453ec0bc5d4fb4edeaffff29c42a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmd/scan/analysis.rs:485-492 | src/parameter_analysis/mod.rs:1533-1540 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/analysis.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ea2bfa9cd030e7134b39112fe5d65fce666b1733978478e6526413dba1194f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parameter_analysis/discovery/form.rs:110-116 | src/scanning/xss_blind.rs:453-459 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddaf16e33a6639a6cb03ab51e235b03ec4c5cfddc930f85a40d53fb3c75f85d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parameter_analysis/mining/context_detect.rs:219-225 | src/parameter_analysis/mining/context_detect.rs:234-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/mining/context_detect.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb08143cbbc97dce457680a8095aa770315668f645ff5f94ff2e12e54a53fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/scanning/url_inject.rs:565-571 | src/scanning/xss_blind.rs:273-279 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/url_inject.rs:565\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/url_inject.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4889e014a0311098f522c37c0f03804b4a372d135a811e60d118db8da26fed65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/scanning/ast_dom_analysis/taint.rs:147-152 | src/scanning/ast_dom_analysis/taint.rs:185-190 | src/scanning/ast_dom_analysis/taint.rs:232-238 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/ast_dom_analysis/taint.rs:147\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb993fe4d6ce9e371167b48dd1250daa7b3cc81d51e914ff795f3506cafe326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parameter_analysis/discovery/form.rs:119-124 | src/scanning/xss_blind.rs:462-467 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/form.rs:119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"644e6147e62b50da984599744c40f39805bdd81c3b6714af8025676bca1d7f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 4): src/parameter_analysis/discovery/query.rs:151-160 | src/parameter_analysis/discovery/query.rs:220-225 | src/parameter_analysis/discovery/query.rs:262-264 | src/parameter_analysis/discovery/query.rs:305-307 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/query.rs:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parameter_analysis/discovery/query.rs:150\u0060 calls \u0060build_request\u0060, \u0060clone\u0060, \u0060Some\u0060 and \u0060src/parameter_analysis/discovery/query.rs:262\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/query.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"366713c72c30e7e045daf96d4c650634711a651a3a544089a9d2af29835c36de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/scanning/ast_dom_analysis/resolve.rs:47-52 | src/scanning/ast_dom_analysis/resolve.rs:135-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/resolve.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"88398c303c17a9596af35e3eb12b764ec9c160e5c4cfa77ef1e9ea7d0dbf5417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/utils/xml.rs:619-624 | src/utils/xml.rs:637-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/utils/xml.rs:619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/xml.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"86728858da9a34dc8a4a802f9ee3ea25cff287832c13db7473488a905f7226d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/oob/interactsh/mod.rs:185-189 | src/oob/interactsh/mod.rs:228-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/oob/interactsh/mod.rs:185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oob/interactsh/mod.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c84485433e8da684c989a67c0de3b9b6b2027e2c0f2f4c5a974eaaed01b888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/utils/html.rs:198-203 | src/utils/html.rs:274-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/utils/html.rs:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/html.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ee85f03b6266056048a0925bc495857110595c8f9e94b14a0a767303c4a380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parameter_analysis/mining/context_detect.rs:5-17 | src/scanning/js_context_verify.rs:1454-1461 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"688d48d76297f1a37fadbc83e78a86db0ac105b6c62dc6e16454aba6c587b437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/scanning/xss_common.rs:91-107 | src/scanning/xss_common.rs:135-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/scanning/xss_common.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_common.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ea5d6d89eb0fd56587f5ff1408fe59112dd183255d93940ff1bf089628f59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/target_parser/openapi.rs:137-150 | src/target_parser/postman.rs:109-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/target_parser/openapi.rs:137\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"478fbb00d7b83650245850736225abb69bcfa289969dc9e43ba522660b2248a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/scanning/xss_blind.rs:345-357 | src/scanning/xss_blind.rs:558-570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_blind.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb06a8b397e382ee9dfb62afb62c83fe64721a9b904555d382c43039dcfe56d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parameter_analysis/discovery/form.rs:263-274 | src/parameter_analysis/discovery/form.rs:376-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/discovery/form.rs:263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/form.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"652d742b1288649cc0b68d6fbb98c388ac31a09edc0529c6826049776e9fb264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parameter_analysis/mining/probe_graphql.rs:29-38 | src/parameter_analysis/mining/probe_xml.rs:44-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parameter_analysis/mining/probe_graphql.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parameter_analysis/mining/probe_xml.rs:56\u0060 calls \u0060xml_request_content_type\u0060 and \u0060src/parameter_analysis/mining/probe_graphql.rs:42\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/probe_graphql.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"873e50d170415d8e84855012c4ddc519f23e0f10ea8305169d5726e0f59188dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parameter_analysis/discovery/query.rs:48-57 | src/parameter_analysis/discovery/query.rs:254-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/query.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a65bed3be7656c61abaacb60999d199d9f8ddf73bd8ebb098d48a0213fb617d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/oob/interactsh/mod.rs:180-187 | src/oob/interactsh/mod.rs:285-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/oob/interactsh/mod.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oob/interactsh/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee86cd081e8bc993f22c5f1c0fcbbf24dcd09253f12e10afd1b95de3a1d0a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/waf/bypass/mutate.rs:154-161 | src/waf/bypass/mutate.rs:768-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/waf/bypass/mutate.rs:154\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d89f640b3c977f04ac0b5874e728121ff3adf108506b7f3dc72790928fd7091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/utils/xml.rs:532-537 | src/utils/xml.rs:569-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/utils/xml.rs:532\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/utils/xml.rs:575\u0060 calls \u0060get\u0060, \u0060Some\u0060, \u0060find_after\u0060 and \u0060src/utils/xml.rs:538\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/xml.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6533d035d4b60b5df4e2085cd87f4bbea48179eada4851e45daca6c6c10e43e7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/main.rs: 0.0% line coverage (0/205)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff9871993161b3fe91ef031e1f1992065b989809cdb5528904d3cc9896338"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/parameter_analysis/discovery/fragment.rs: 12.9% line coverage (4/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/fragment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba95e00e8c39dbebd8394f6b854f9d8dd4a80f5a1f86fc0c72330a59d55e120c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/mod.rs: src/cmd/scan/mod.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in dalfox::cmd::scan::run_scan at line 262. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e41733beffe7d18ee52a91b185af447e86fb3c71ba223090137936d98a36cd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_dom_analysis/sinks.rs: src/scanning/ast_dom_analysis/sinks.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in DomXssVisitor::walk_assignment_expression at line 9. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/sinks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c496226f2d66dec4e07521784ac26e65279922aca535db991edd87068181b003"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_dom_analysis/taint.rs: src/scanning/ast_dom_analysis/taint.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in DomXssVisitor::call_taint_and_source at line 42. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/taint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/taint.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7796c15c6515bcc04a7711d4aea6aa2c797dda287a87869e431fc75e794f92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/job/runner.rs: src/job/runner.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in dalfox::job::runner::execute_scan at line 360. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/job/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/job/runner.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4c9252fa3131d882cad2ebf16762550ecfe952ba6fe448527ab6560ad4bd07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/mod.rs: src/parameter_analysis/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in dalfox::parameter_analysis::active_probe_param at line 1005. 10 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mod.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c0605bbfa9b475903693d7e64ab017010d3faf70bad2f938af2356b165fee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/job/mod.rs: src/job/mod.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ScanOptionChecks::validate at line 562. 16 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/job/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job/mod.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e444976b0f4ed1de90c3b93d095a5f33418940d918a7e0c05787d1be64eedef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/input.rs: src/cmd/scan/input.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in dalfox::cmd::scan::input::resolve_targets at line 167. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/input.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd96c978afdced52fcae27b96e4f4ae30ebcd58773f6dbafa61e7eaa00d6d95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_dom_analysis/walk.rs: src/scanning/ast_dom_analysis/walk.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in DomXssVisitor::walk_statement at line 17. 9 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/walk.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/walk.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09c31a100d3e5bacb35e38953c649ba8fa2fe7416ece0b9c7ac384cd9f39b0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/discovery/form.rs: src/parameter_analysis/discovery/form.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in dalfox::parameter_analysis::discovery::form::check_form_discovery_with at line 19. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/discovery/form.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/parameter_analysis/discovery/form.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bc23aa947320a5864af5c2f4aa928a16a7cea4d99e0dd99edf15bcd8a241c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/check_reflection.rs: src/scanning/check_reflection.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in dalfox::scanning::check_reflection::fetch_injection_response at line 2732. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/check_reflection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/check_reflection.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f9c45e79cdca17f852f91aa7bb8d9ef1c6a077d2502b17b85312f4140278b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/js_context_verify.rs: src/scanning/js_context_verify.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in dalfox::scanning::js_context_verify::gather_sink_spans_in_expression at line 816. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/js_context_verify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/js_context_verify.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b15db12f0b16792c7028f179b2db1ec1956989000592cd08a05be1c3f54b04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_dom_analysis/bindings.rs: src/scanning/ast_dom_analysis/bindings.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in DomXssVisitor::bind_declarator_identifier at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/bindings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/bindings.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee13c60aeabe1851af673514ea8541afea7510a04f4a32c238459a829db0aa1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/mod.rs: src/scanning/mod.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ScanWorkerCtx::run_reflection_phase at line 1040. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/mod.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff54e818bbdfcf2b305ad83e07b6f320247d8e6bb723989614924b8224fc1cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/output.rs: src/cmd/scan/output.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in dalfox::cmd::scan::output::render_results at line 572. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/output.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/output.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dcc7ecc5f769d60e2a0a1d264bd1cc2bf339c2f66a35031ff8c20bcef0ccd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/check_dom_verification.rs: src/scanning/check_dom_verification.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in dalfox::scanning::check_dom_verification::classify_dom_evidence_in_xml at line 1029. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/check_dom_verification.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/check_dom_verification.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"811c09f3f4760d838153526d27404fe529e8ff0ecc93258f07a897883e28c01f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/analysis.rs: src/cmd/scan/analysis.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in dalfox::cmd::scan::analysis::preflight_and_analyze_target at line 322. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/analysis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/analysis.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6605c4b593cb0925cd08649c667005cfdae8cd53b4ddedd24494ef6176ad82c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/target_parser/mod.rs: src/target_parser/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in dalfox::target_parser::parse_raw_http_request at line 726. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/target_parser/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"539719b7e0858ce5550aee423b79c6585b7970a338ee8eff647723486b8379d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/url_inject.rs: src/scanning/url_inject.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in dalfox::scanning::url_inject::build_injected_url at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/url_inject.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/url_inject.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"673cad84964ff68c7b8c52466497298ebb060cc8e8d8ff4c2ffdadf199c0d52a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/mod.rs: src/mcp/mod.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DalfoxMcp::scan_with_dalfox at line 289. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/mcp/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b5503ada02934d1a73af5a0190a8f1857759ba1d673b1ec881a1a3c5897cd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/result/format_markdown.rs: src/scanning/result/format_markdown.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in Result::results_to_markdown_with_meta at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/result/format_markdown.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/result/format_markdown.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e1f8a5a526ab4b18952fdc3b5c7949639aab2d7f66787e604f0a79ac610b70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/xss_common.rs: src/scanning/xss_common.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in dalfox::scanning::xss_common::generate_dynamic_payloads_uncached at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/xss_common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/xss_common.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf3f5f6012eccd23d41c094665a261c247cb1584c132e95df7045e61fd2e466"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_integration.rs: src/scanning/ast_integration.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in dalfox::scanning::ast_integration::extract_js_and_script_ids_from_xml_document at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_integration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_integration.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbda2c01373d37ef4a2793d80e680ce90dffe6d3c5ac39f55600e2e766f037e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/scan_loop.rs: src/cmd/scan/scan_loop.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in dalfox::cmd::scan::scan_loop::scan_host_group at line 407. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/scan_loop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/scan_loop.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3afc7c96aa09b8469629e77f68d9cdf5f17e83182be9eb05ce43ded34868c29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/poc.rs: src/cmd/scan/poc.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in dalfox::cmd::scan::poc::render_finding_block at line 561. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/poc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/poc.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5b29a5728492f24b6ef214741b2d25c1d9e16003d05a046dcea0ce6449e30b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_dom_phase.rs: src/scanning/ast_dom_phase.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in dalfox::scanning::ast_dom_phase::run_ast_dom_analysis at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_phase.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_phase.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a2b3490fb75ad787b5a1a2f7c5acfa6a0571a72193591ab51dd93e3eb970b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/startup.rs: src/cmd/scan/startup.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in dalfox::cmd::scan::startup::prepare_and_validate at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/startup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/startup.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc480019ab1258a110a824294dacb6e5730bf0a9bb87d9363e5201f71ed1164e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_dom_analysis/summaries.rs: src/scanning/ast_dom_analysis/summaries.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in DomXssVisitor::register_function_summary at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/summaries.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/summaries.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1a84549b3fc2ddb113d83b81540334b2f39bbbf562373b848915a13df2c423"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server/mod.rs: src/server/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in dalfox::server::run_server at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/server/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d2b88e3855e885965f1bc163f4e052b626a7ca0dcecc84b0141ab643965c52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/preflight.rs: src/cmd/scan/preflight.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dalfox::cmd::scan::preflight::preflight_content_type at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/preflight.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/preflight.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e20a02db712df02a0add259dad5fbb4a5125ac2aefdf5c38f0457c70d00ba5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/param_jobs.rs: src/scanning/param_jobs.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in dalfox::scanning::param_jobs::generate_param_jobs at line 148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/param_jobs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/param_jobs.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf44a2fbb6a0819e7692e558daa55f65e0d5dd7bbe6d380a3f462602f72486ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/discovery/query.rs: src/parameter_analysis/discovery/query.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in dalfox::parameter_analysis::discovery::query::check_query_discovery at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/discovery/query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/parameter_analysis/discovery/query.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6d0e1ddc5a8a273f65baf2628c2bf73bfec43b8bf1c09c34e4ef330c10d90f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/payload/js_breakout.rs: src/payload/js_breakout.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in dalfox::payload::js_breakout::js_end_state at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/payload/js_breakout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/payload/js_breakout.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0990402af763a78748f74afde07d303854cfbc913e671b70c601242bdcdb41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/xss_blind.rs: src/scanning/xss_blind.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in dalfox::scanning::xss_blind::blind_scan_forms_with at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/xss_blind.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/xss_blind.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e2dd80cac363cc84657a1cb9ed6d0b445b78b5884ac0eed98838a834fef49b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/discovery/mod.rs: src/parameter_analysis/discovery/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dalfox::parameter_analysis::discovery::dedupe_reflection_params at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/discovery/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbe3ff6ff58b2755800f941e249433e239a9b58a6c42c6d9c6ea6f34c63ffd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/validation.rs: src/cmd/scan/validation.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in dalfox::cmd::scan::validation::validate_numeric_args at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/validation.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c12c6cf05fceeb6a8146bc278af4fa4d78c6e6dfd1ba65ff1b1a0ab2302569"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/ast_dom_analysis/async_flow.rs: src/scanning/ast_dom_analysis/async_flow.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DomXssVisitor::promise_kind_of_call at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/async_flow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/async_flow.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd4c2dc2b3ed7c29fa66856cec65b6c5acd6f973b533b2b6bce9b839a1b2d38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/mining/probe_query.rs: src/parameter_analysis/mining/probe_query.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in dalfox::parameter_analysis::mining::probe_query::probe_query_candidates at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/mining/probe_query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/parameter_analysis/mining/probe_query.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd1132705aacb26a7de785a7b75fc9434a222e209245bb259b972463dd0847e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/mining/context_detect.rs: src/parameter_analysis/mining/context_detect.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in dalfox::parameter_analysis::mining::context_detect::detect_injection_context_with_marker at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/mining/context_detect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8298e6e859f01d02d9c1d8c6bba892e9d89c1d3e25feb3eb03382cbec93d90d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/waf/bypass/mutate.rs: src/waf/bypass/mutate.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in dalfox::waf::bypass::mutate::multi_slash at line 660. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/waf/bypass/mutate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/waf/bypass/mutate.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"240277d31a480cd6fabd9e3b8f4eeadafcf4715e83cc411bfa97eb7c2255ed75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/payload/xss_csp_bypass.rs: src/payload/xss_csp_bypass.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dalfox::payload::xss_csp_bypass::analyze_csp at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/payload/xss_csp_bypass.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/payload/xss_csp_bypass.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10e4557c16d13af37957964b606d09baef26fe7df61330b4586d4ea5aed2af3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/result/format_sarif.rs: src/scanning/result/format_sarif.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Result::results_to_sarif_with_meta at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/result/format_sarif.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/result/format_sarif.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"123808cc842e34290601ca6274291b12ed0484db9f1aee93a5c12b73b293240f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/mining/probe_json.rs: src/parameter_analysis/mining/probe_json.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dalfox::parameter_analysis::mining::probe_json::probe_json_body_params at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/mining/probe_json.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/parameter_analysis/mining/probe_json.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12a0a359c9827cc62188300598c0d279c6401a3ff36f797cf397b60d84c2fe5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scanning/request_render.rs: src/scanning/request_render.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in dalfox::scanning::request_render::build_request_text at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/request_render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/request_render.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e416bc24f9dbae971459d6d50f5651ab32bed14ece924b3ca3c23ab3c6ffba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmd/scan/blind.rs: src/cmd/scan/blind.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dalfox::cmd::scan::blind::arm_and_dispatch at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/blind.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/blind.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd1f0761aa88ed8b6a03a5f8dcc05bd158dd71d82aebc53edb5a45156f7d76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parameter_analysis/discovery/path.rs: src/parameter_analysis/discovery/path.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dalfox::parameter_analysis::discovery::path::check_path_discovery at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/parameter_analysis/discovery/path.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/discovery/path.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc6bcdada523b0531e59409ced90d67e30018ffe8b4a6023a6e3016bb90fb19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/target_parser/postman.rs: src/target_parser/postman.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in dalfox::target_parser::postman::build_request at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/target_parser/postman.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/target_parser/postman.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54245af2841382ea221cae5ce80aa4d1ee470a909afd3436e9a002f33f7b356"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/utils/http.rs: src/utils/http.rs changed 13 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is dalfox::utils::http::send_with_retry at line 842), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scan): fetch the whole landing page when preflight\u0027s Range was honoured (#1711)\u201D; \u201Cfix: pre-3.3.0 review of features since v3.2.4 (#1686)\u201D; \u201Cfix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)\u201D; \u201Cfix: bug hunt 2026-10-09 \u2014 68 verified crash / silent-clean / hostile-input fixes (#1529)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/utils/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/utils/http.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85c9bf4ed6feeee3e035e965d8ef85d50b8866707e795b3e748c7a64f1ba8fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/server/util.rs: src/server/util.rs changed 13 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is dalfox::server::util::log at line 196), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: pre-3.3.0 review of features since v3.2.4 (#1686)\u201D; \u201Cfix(mcp): label target-derived output, bound result pages, validate blind/remote inputs (#1424)\u201D; \u201Cfix(server): anchor origin patterns, and harden the API\u0027s secret handling (#1423)\u201D; \u201Cfix(server,mcp): don\u0027t free a capacity slot while the worker runs on (#1417)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/server/util.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/util.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5602af2fe137e4ce20dc061f4632bb262d7e5dcd9f47cabbf247d2fc702f44"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/server/job_runner.rs: src/server/job_runner.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is dalfox::server::job_runner::run_scan_job at line 192), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)\u201D; \u201Cfix: bug hunt 2026-10-09 \u2014 68 verified crash / silent-clean / hostile-input fixes (#1529)\u201D; \u201Cfix(jobs): align reachability probes with CLI (#1491)\u201D; \u201Cfix(cli): honor --json on the payload summary, and config no_color on the banner (#1421)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/server/job_runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/job_runner.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cf67a8e220fb8befb4c0806dd0fe7245318c47b10cad0807df58292485fbad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/scanning/ast_dom_analysis/resolve.rs: src/scanning/ast_dom_analysis/resolve.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is DomXssVisitor::is_likely_sanitizer_name at line 154), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ast): cut DOM-XSS false positives and close recall gaps in the static analyzer (#1692)\u201D; \u201Cfix(ast): track private fields, bound callbacks, call-site defaults, and currentScript.src (#1552)\u201D; \u201Cfix(ast): walk class bodies, scope this per object, track parameter defaults and getters (#1545)\u201D; \u201Cfix(ast): track common real-world DOM-XSS shapes the taint walk missed (#1544)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/resolve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/resolve.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecccd2ce0463e2d6743c65089b123313ef20cb151fa8cc7491045ef36ae3e96"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmd/scan/state_file.rs: src/cmd/scan/state_file.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is StateFile::append at line 695), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: review pass on v3.2.4\u2192main features (OOB/session parity, confidence cap, filter fingerprint, spec import) (#1558)\u201D; \u201Cfix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)\u201D; \u201Cfix: bug hunt 2026-10-09 \u2014 68 verified crash / silent-clean / hostile-input fixes (#1529)\u201D; \u201Cfix: multi-policy CSP, quoted \u0027\u003E\u0027 in script tags, template-literal delimiter, credential-rotation resume, assigned-over parseInt (#1486)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/state_file.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/state_file.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d10a90d2c3bf751499192196e15edfe96cca30dc469ec1dd7b904847c729f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/scanning/waf_strategy.rs: src/scanning/waf_strategy.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is dalfox::scanning::waf_strategy::expand_waf_payloads at line 200), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: multi-policy CSP, quoted \u0027\u003E\u0027 in script tags, template-literal delimiter, credential-rotation resume, assigned-over parseInt (#1486)\u201D; \u201Cfix(scanner): preserve payload selection and valid WAF variants (#1490)\u201D; \u201Cfix: CSP meta/report-only precedence and WAF status misdetection (#1481)\u201D; \u201Cfix: bug-hunt batch \u2014 blind XSS request builders, batch-mining attribution, server/MCP parity, and CLI silent-clean holes (#1476)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/waf_strategy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/waf_strategy.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72dc34dc117661f8de4bed9715b18416a0bce2a2ff29b3a90223a943792e554"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/target_parser/har.rs: src/target_parser/har.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is dalfox::target_parser::har::parse_har at line 120), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)\u201D; \u201Cfix: bug hunt 2026-10-09 \u2014 68 verified crash / silent-clean / hostile-input fixes (#1529)\u201D; \u201Cfix(target_parser): drop unsendable headers on raw-http/HAR import (#1405)\u201D; \u201Cfix(scan,server): harden request construction and input validation (#1404)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/target_parser/har.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/target_parser/har.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4b3f36fe7404cfe971979d8c7e8169641c30f8e0e9fef1168965c582ff2429"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmd/scan/postprocess.rs: src/cmd/scan/postprocess.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is dalfox::cmd::scan::postprocess::result_priority at line 37), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)\u201D; \u201Cfix: bug hunt 2026-10-09 \u2014 68 verified crash / silent-clean / hostile-input fixes (#1529)\u201D; \u201Cfix: HPP form-action/pre-encoding drift and streamed AST duplicates (#1488)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/cmd/scan/postprocess.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cmd/scan/postprocess.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"707f055fd086947effe5137fc6c7c73bc227a772a6a3a2107c7049a0fa1d4965"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/payload/remote.rs: src/payload/remote.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is RemoteKind::init_with at line 225), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: bug hunt 2026-10-09 \u2014 68 verified crash / silent-clean / hostile-input fixes (#1529)\u201D; \u201Cfix: bug-hunt batch \u2014 blind XSS request builders, batch-mining attribution, server/MCP parity, and CLI silent-clean holes (#1476)\u201D; \u201Cfix(server,mcp,payload): daemon-lifecycle defects \u2014 preflight pacing, per-job remote cache, draining-job retention, MCP capacity slot (#1406)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/payload/remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/payload/remote.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6889e8194accb363d979c19b813980e818bc05b301fae0f92fbb63912d9655"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/lib.rs: src/lib.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is dalfox::with_job_scopes at line 229), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(http): honor request pacing and user-agent overrides (#1487)\u201D; \u201Cfix: six defects found reviewing the 2026-09-02 merges (#1405-#1424) (#1425)\u201D; \u201Cfix(scan): count requests that never reached the target (#1413)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b47812f117895aeb33f0bc4c77ed7938993cf23007fc3b808fbc39723328a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/scanning/ast_dom_analysis/reflected_markup.rs: src/scanning/ast_dom_analysis/reflected_markup.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is DomXssVisitor::expr_element_tag at line 261), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ast): cut DOM-XSS false positives and close recall gaps in the static analyzer (#1692)\u201D; \u201Cfix(ast): track private fields, bound callbacks, call-site defaults, and currentScript.src (#1552)\u201D; \u201Cfix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 23:41:40 \u002B09:00\u0027 --until=\u00272026-11-14 23:41:40 \u002B09:00\u0027 --full-history --no-merges -- src/scanning/ast_dom_analysis/reflected_markup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/scanning/ast_dom_analysis/reflected_markup.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa8aaed8b090cd651c77e0e92d5137702197d65295aaa60bd345031d441140"}},{"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/parameter_analysis/mod.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c2622fc2d96e143e3b64683f906e6dda1ce01deabad80310b15141af16f660"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9269d57ae2d0fdd9d36822295cd584b0a25a4bc0ab67d0b10f33f28c4e6b88"}},{"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":"6d4c9df5d9590f3bcbb57e52464c9c7a084b0eab2a68e7cea0baa0f964910c17"},"taxa":[{"id":"CWE-269","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-4","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":"8a1282a9e831c2121ffd19db29a13a85ef7271052c8245ac187afd6db985012b"},"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":"89d678b978c21e1f42fbf3dca71675041336796a67fd28322f48acceb001885c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9780d209f8568a143adccc237a62d1781acd27f42c316c38c71c718837e5ccb"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cbcb06274e0abd9e0ff768cd734ba336f0ff6e950e78aaf094428ab287a7696"},"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":"015c1fc25e7e1427bab57a098d64b56c6be45093ecde8280f20b137775ce15ca"},"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":"8f14d4555e6cd06384449b9689f8c541f49b734e10929d021020b34e009fa1e1"},"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":"169ea31fd264e76a44d7e89f44f131c92254fc15ef8ff57b72b549e23538692a"},"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":"a7e2531749705702e82b9a32127273e1dc58141eea619ca93b47a908fb7acc23"},"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":"6d651ff176d93b04a02295db432baf7513aed8e8641a56dfbb0e8f0a2ca15f58"},"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":"dc511651864497bf753d084265b56d2e8b45587611c192e699f44bf2f8d70be5"},"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":"82ace98e4526e05990ff671013fb10344d617adcb799ae3cf799e52839a43b00"},"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":"dada811c960f4834ed269278b870f1a5ab4977e6f5831cb3096e8dff16ec807e"},"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":"4f328bdf2073068571e2c07fee63aa7e574b3b3fb596ad7609eca334bee34093"},"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":"111377d79a995de5fab421ebcf41727782f47c210f5fb832bbb7a6f58a45f5ac"},"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":"a1cc6f700fbddca8d61492a41b970af1989142d6ab89b89a933528e927b67c4c"},"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":"78c624d8c3647ac0203a7204bd0b57a651b2e437d96cdb3a29e0783c71ae40c3"},"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":"75eda33f8b25a1ea9288feee482a283be79fd24b7fc7473bb3da70c10c24257e"},"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":"a448635e265e875f88c6425f75923505de8971e4d8faeb3c48fe1f58c620a04e"},"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":"87117c9514cf7f1d7cf8fde9ba24db8451b2f49ba511531656e4d3edbba00f55"},"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":"50aa042bffc9352b53c2b65c80f8d8013047efc73bf4a37c0fab3558303d74f1"},"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":"802d9984887cb0b240ca4484afb4db45cc9a86c8bf948e2653b8bd7b9792db1f"},"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":"81ccfae0b0119a73b22357f4e77125e65b7cb43044f130cbef2ea58b1b629103"},"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":"07f13397af34e74a2723b3324ded2ad75b8d28e0654fa4a003891bb5563ebed4"},"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":"66c92451ee358a00e0e636e4059e56a3648415d5cd2cbeb4baa463c8a2bd9ebf"},"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":"83af1291a0aa4fa6d1bb49a7f54d521c5cf8edacb8512c50d1998fe5a39c026a"},"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":"e8fbbe0fe37439b4c40dddd6271376f70f1bab0084abca92deec646198cc22c1"},"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":"8c8d78d3e28de950dcb5c8e8ba2a17f798919133530906a891d938d0f642c6f3"},"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":"75ad9d34a5c169960f0be44e546ceed97566e1a3df3b86e94d8abd3b84485ff7"},"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":"a642fb6a5cf9d77af0f7600f906ba5cde3eca9d686774983e2b99900719c329d"},"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":"bb2956f1d8f6d2c08f999c5f7cc1c4122571797653645540af18083d40e33231"},"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":"1c1b65bb252294d7e9917359f77c900080f759b503e4b4b467fddf7fdfa3630a"},"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":"edcd917a6ad2b7ef4a310c06a343ec61678606b83be29585cbb73985adab153a"},"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":"1aef7a5fdeafd451640133c61dfc9f026e4b42c5a3d8bef718dba9a1660b4150"},"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":"7af3b46e035bf00785128747075bba5dadbb7709aa18f52aa6353b99b0cd4502"},"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":"c435ffd6ff277d1a9d49b7f5cc0fdadd254373f2af6b7fbf0ef2cf4271ceefa0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41c4b77c1a032a260835a1bc0f0c3df63f2c4c4e8454b69994e934adba5dfaf0"},"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":"123065173cdfc7799191b93d473e17252a5358663ea0adb949f6046d3f0a67b1"},"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":"3ad48bb6d99a8ed3f9d1435901b5ce2e612bea222bdf7ba5b0bb27cf84669e7b"},"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":"276075b923f2d0fa3b21c889dcaf35e833b7915cecdf439d75c5f231b687d494"},"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":"ac92b0397759e09f45c35fc4ebcefb35a861ff589bce67fba7376da672f4da10"},"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":"373f5e18e012a63a854c240569f5fcc85c8616979f094e921dc885dda2f7e2f9"},"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":"450449d0efe6ccaea6f95fe6eaab2006a1c7505351022f09c8461ea8c8df3980"},"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":"4c6942614a02bd571a8a098dc563417a76346a73732c72ac35ba83afd9686b6a"},"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":"ca29d987cedd07af00dfea86c263d8eeb20191f8f5bc8b44da192e5e9b389fb6"},"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":"d448bf15113977fbae08ebf7a6f0b1297f44c77a3a6eb014fccf725d4d43e980"},"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":"fe9e0cb5566b71def0bcaa01a45124551e52c22921e67c1f7f669ec5c26d8272"},"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":"d6995a9d8828b982a2a21c541bfab6bfe19b6b834398e06d7c82c131d8f8c668"},"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":"6bbc9073f03deab12f69900d7d979b234be3f2e8e20521ad4a9a0f2aa03f92d7"},"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":"8c8a6140a48caeb27d0148067c31bf602c910c50317fb3412cbb8ddcb798b803"},"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":"ce458ce7aeaf228713e09e4e50b93c02676bead9de05e48c5164cf0026c62c1b"},"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":"ebc2e156c637bdda45558ae5c329d3c4b04cbc2f99be5890a85a354e812982a2"},"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":"507cb0f922db608ba16d7e33ca27c2d2da39a0f1ec44ade673828e9b07738176"},"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":"5e7be3d1751fecc9d1a4fec3696138736c486d5b5a2cff107219ba3bc0f29429"},"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":"259a4907d994a97f75ccf6bde3c035fbef1b21a8e8a51f410e54d31475a3b410"},"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":"4eaf4b55637d32801baff665649ab8f0b8f4b0b15d65d5d238891056d39f0ed6"},"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":"aaf5e47326b08bf5bdff194a70c14252f143225496845b1ef11529d2683acf5f"},"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":"6146063c71aabef167a9d5760f91a4ed5cc1756795ccfd702e6df84ccb244ebf"},"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":"a7ccbe597b7cf7531bc9ae00432f50c1974b9399ca289aac8cf703a391a69c84"},"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":"c1e1f4e515082016c9ceac8bee6031eaeba3b125c7045bcf33c9c60781b44093"},"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":"f46e058f579aec674501ec41e1afc4d37e4f9d7e3b8d78d238f0ad83ca2ec195"},"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":"a7c1ffc5a464dcca1f6df51eb1ccf4a800250ffd8083d090523aea06e1af6fbc"},"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":"d0ac09d7daf016882f8553afc4a07171715277496fdc913731922e9e6b25db14"},"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":"4d9ed998437f13b3f1aeda1c1f9a26fa941cfc91bff7936a98b908b812805fc8"},"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":"1aca84950677de65f4c52ad56dd6bcab07be34420560ab9e258c633e12e54a6f"},"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":"115c7c9edd992d7567020c83862fe86d35b1e56dc491a1ae842eaf73aa596b5e"},"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":"36cde6b9fac4280fc6b824d31bc71441e12925c1bd94b8f633bb553de28602dd"},"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":"a21768f55589b4cac015ec5a08ddc7d6c6a171ad5ac254ef282b33d383816e7a"},"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":"cbc10fe9d10a8ad35989f946268d4fc6db2b1ecd3c25188ba9c5fe1457d4bd66"},"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":"3df50d5da53eb7152b733e503638c335b7e9ce3c02d3b650d5d63248a5286c08"},"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":"25aca4a92617c586d3062913c09fe909484ee04984ccecf82bbdbef0b6294645"},"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":"d2db172b1172ebacd63755f3149c5d28d9d99c4d6931a1b5a62f1e6f854fd093"},"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":"995ae527d39fd2fe4545883b40f767933d717387592331293b56ad819b3362a2"},"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"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":"6beb1dbf722dfdeac8e49068fd6c16b05da43c9488627b3c5c02adaf3651ab03"},"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":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"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":"ac8eb79dfa01848c9591d4d3d4639a6823be4bbb96d16a40df23728da77d6f08"},"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":"d4168013b8ecf6910036b749f05ac6572bf48869b947cc50164fc911209515b3"},"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":"bf6e654aae86dc886c5a2e651d1be07a1252f28560ba57c82c6b15ac3d1f9c30"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"550b18e2fa3cb1ec96e83f2a35548bdff9f6f75bc7c9c75a4dd82dde45ae9c1a"},"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":"159b349952a4c646d2c94dd0107fc4f17d42ba11828e79bc6cce4af6d14e2bda"},"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":"ac8848694534995f6a8b3f9c391f355fe243dfa17894be3d48b2aa5b5f0bda18"},"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":"6757980a3bb8264ab7cb29af762d904316fe66bd310c1be76ea0298ec3582c2b"},"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":"c3ca1f95f762e02c6a9edff533e7353a521676330dc4413636d4ae5149777096"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44b132c54fb96ed8961cea0e106fd1cdeaea56a66e79b304b5ff8eafe62d28ea"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ba8fd7f254f7c15aa4089f3a77a0a35e422a015dfbee76650a6684830993a1c"},"properties":{"dependency":{"package":"rmcp","version":"3.8.0","advisory":"RUSTSEC-2026-0462","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"c6f7aa643357b2917971a473e3fa72aef4870baab605938999f5be423ff5e2c9"},"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":"5bfa95bb1668220c9ce324c97a027b979b3b7d1047a7dd49b94ce564ac37a3a0"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c960cf91e4a40b671a0a63b73f3a1ad21407a6c638930b1fd03a98c76a6b769a"},"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":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tests.rs \u2194 tests.rs: \u0060src/parameter_analysis/mining/tests.rs\u0060 (context parameter_analysis) and \u0060src/scanning/xss_common/tests.rs\u0060 (context scanning) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060c8f30734\u0060 refactor(args): give ScanArgs a Default so adding a flag touches one \u2026; \u00603814cf53\u0060 fix(scan): detect attribute-name slot, emit autotrigger payloads; \u0060f36de133\u0060 fix(scan): detect JS template-literal context, inject \\${\u2026} breakouts \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf982cd0fcf19b956ce6eab4b7766590fd3978d012115a031899d681ebbb8ff"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tests.rs \u2194 tests.rs: \u0060src/cmd/scan/tests.rs\u0060 (context cmd) and \u0060src/config/tests.rs\u0060 (context config) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060557cb6a0\u0060 fix(config): stop config from overriding explicitly typed CLI flags; \u2026; \u0060c8f30734\u0060 refactor(args): give ScanArgs a Default so adding a flag touches one \u2026; \u0060d4cb9b03\u0060 fix(scanning,server,waf): close 10 latent bugs found by source audit \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f09868ead7bc1537823add9341a8da0652b703ea379fe0f3283614033236d2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 job_runner.rs: \u0060src/mcp/mod.rs\u0060 and \u0060src/server/job_runner.rs\u0060 change together 93% of the time (13 of the 14 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060f57533e3\u0060 fix(jobs): align reachability probes with CLI (#1491); \u0060676f492d\u0060 fix(server,mcp): run the remote payload fetch inside the scan budget \u2026; \u00608617b5ab\u0060 fix(server,mcp): stop silently discarding proxy/callback_url and corr\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9208742a97ca40261665492bdb4846f990bfe7a358ac8178fdb5b9a24f00a9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 handlers.rs: \u0060src/mcp/mod.rs\u0060 and \u0060src/server/handlers.rs\u0060 change together 73% of the time (8 of the 11 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00601867a145\u0060 feat(server,mcp): blind OOB and session-loss parity with the CLI (#1524); \u0060f57533e3\u0060 fix(jobs): align reachability probes with CLI (#1491); \u00606a0fbcbc\u0060 fix: six defects found reviewing the 2026-09-02 merges (#1405-#1424) \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b77edfdd9e760add6ad170368cef12d3fc5815bf07e20a3ab1b5f0c1ef7f91"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tests.rs \u2194 tests.rs: \u0060src/scanning/check_dom_verification/tests.rs\u0060 and \u0060src/scanning/js_context_verify/tests.rs\u0060 change together 50% of the time (5 of the 10 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00602a0ef1a7\u0060 fix(dom-verify): false [V] on inert JS-string / data-block reflection\u2026; \u0060247cdeae\u0060 test(scanner): shared reflect(payload, Transform) fixtures \u002B DOM-evid\u2026; \u0060c797e0c5\u0060 fix(scanner): parse-DoS hardening \u002B XSS false-negative \u0026 WAF/lifecycl\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0df6b71b3d73d85ca9e2a0c16e1494ae6c7654204232aa6bdd96b9aeda6fb12"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security 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":"ad77c61b2d4d956fafb097a8679929346975eddebe761ecd0d3a7282e79ee0e0"}},{"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":"41a37f6b22f4a9144687c8c862925fd7b3896012bfbabf826622842ee6f6006d"},"taxa":[{"id":"CICD-SEC-6","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":"933d04c9ed3077a2d481245a734b27bcc94e1ddccf0ebda4695ef0e905d76b72"},"taxa":[{"id":"CICD-SEC-6","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":"f73692d7d7c72ff39537cde5f98b3f153ceef61c7b3c44b6745e24b86bb656e8"},"taxa":[{"id":"CICD-SEC-6","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":"efab2df25b99522112076b277851d3b175258d7c81da3596f8c0cb67aeeda36e"},"taxa":[{"id":"CICD-SEC-6","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":"81d0799af757bba1afbed34637d383ea39ed22bd8ff8ec5b09c5aa413595d701"},"taxa":[{"id":"CICD-SEC-6","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":"442e44de5d11c0be0d251f733c161e6d4954109d0cdec8515a7ada396a2797ee"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"812b699da45716c80f89e57d58c08ccb729cf8719831b18a19496c28ba777227"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6f1ade280814ea8cec2abbe6461dba2414f210a29d7537c57ac7c999a410d1e"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"C2","level":"note","message":{"text":"Thin authorization enforcement: Only 2 place(s) refuse an unauthorized caller \u2014 too few to demonstrate default-deny across handlers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1240e406e864a89e38d5e3fa370dee11971db94808c3db2fda9b41bf2e5b8efb"}},{"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: README.md links to \u0060docs/static/images/illust2.webp\u0060, but \u0060docs/static/images/illust2.webp\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":"README.md"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85864071a30ab325207b0475304e4f6aa1b79c8e2996b50e4173a6d35a328ea"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"S1","level":"error","message":{"text":"TLS certificate validation disabled: \u0060.danger_accept_invalid_certs(true)\u0060 is set on a TLS client, so every peer certificate is accepted \u2014 including one an attacker presents. Chain, expiry, revocation and hostname are all skipped, so an attacker on the network path can present any certificate and read or rewrite the traffic \u2014 the connection is encrypted to the attacker, not to the intended host. Remove the override so the TLS stack verifies the peer \u2014 reqwest, native-tls, rustls and openssl\u0027s \u0060SslConnector\u0060 all check the chain and hostname when nothing is set. If the server presents a self-signed or privately-issued certificate, trust THAT issuer rather than every certificate: \u0060reqwest::ClientBuilder::add_root_certificate(Certificate::from_pem(\u2026))\u0060, a rustls \u0060RootCertStore\u0060 holding its CA, or \u0060SslConnectorBuilder::set_ca_file\u0060, which keeps the chain and hostname checks on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/payload/remote.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6688a765b9d8d6edf732c4c57c0d231ad170894e1527a787448fa6e94bd08e13"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (src/server/mod.rs:357)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"Security headers incomplete: Set: Content-Security-Policy, X-Content-Type-Options. Missing: Strict-Transport-Security, X-Frame-Options \u2014 the four headers that carry the points of this card\u0027s security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each.(\u22121.0 on this card.) The server: \u0060axum::serve(\u0060 (src/server/mod.rs:357)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e9931804dbad8b1657857c9b88c05b8faeff182b6e2bb88641bd59bac687876e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!args.remote_payloads.is_empty() || !args.remote_wordlists_in_use().is_empty()\u0060 appears character-identically in 2 files \u2014 src/cmd/scan/startup.rs, src/job/runner.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd/scan/startup.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f412486c508842a2d3ff97c0ad21ba7a22a085e69c23340b8371a8c6b7d2a211"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!out.skipped.is_empty() \u0026\u0026 out.skipped.len() \u003C= super::super::MAX_SKIP_REASONS\u0060 appears character-identically in 2 files \u2014 src/target_parser/openapi/tests.rs, src/target_parser/postman/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi/tests.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadcca7900e81a1c45dc227670a1c4d999f4c70066f9c502d6794d869111fa39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[idx] == b\u0027%\u0027 \u0026\u0026 idx \u002B 2 \u003C bytes.len() \u0026\u0026 bytes[idx \u002B 1].is_ascii_hexdigit() \u0026\u0026 bytes[idx \u002B 2].is_ascii_hexdigit()\u0060 appears character-identically in 2 files \u2014 src/scanning/url_inject.rs, src/scanning/url_inject/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/url_inject.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf41b22cf61b295b8bd37870f7ee2d7eccfe6588ffe8e3dbe1bdbba52d525bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end \u003C bytes.len() \u0026\u0026 (bytes[end].is_ascii_alphanumeric() || bytes[end] == b\u0027-\u0027)\u0060 appears character-identically in 2 files \u2014 src/scanning/check_reflection.rs, src/utils/html.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_reflection.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aea40563606c493abb0480c31fa8de3a27b964d65bfeffe073c32c7c652e5fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.contains(\u0022blind\u0022) \u0026\u0026 err.contains(\u0022http\u0022)\u0060 appears character-identically in 2 files \u2014 src/job/tests.rs, src/server/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/job/tests.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c922bb8cd8d5d86df87df7804885b2eb07db1d9440ca88343dfa40b01ce34f9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003C bytes.len() \u0026\u0026 bytes[j].is_ascii_whitespace()\u0060 appears character-identically in 2 files \u2014 src/parameter_analysis/mining/context_detect.rs, src/scanning/ast_dom_analysis/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bfe27e37dca9a5b88edf25e3f245ed9aa5ed1a877f195b6b39277d0b64a9ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker.is_empty() || !text.contains(marker)\u0060 appears character-identically in 2 files \u2014 src/parameter_analysis/mining/context_detect.rs, src/scanning/js_context_verify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parameter_analysis/mining/context_detect.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e36aac2e4ced6fd2650c3ba8f84836bc89713ae82bdb7dac45de83cde0d56c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out.targets.len() \u003E= super::MAX_IMPORT_TARGETS || budget == 0\u0060 appears character-identically in 2 files \u2014 src/target_parser/openapi.rs, src/target_parser/postman.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/target_parser/openapi.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a905d26f8f9274c3870c2dcc7d025ee6e22a18bc39aa2dd69e18563e98f28350"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060param.invalid_specials.is_some() || param.valid_specials.is_some()\u0060 appears character-identically in 2 files \u2014 src/scanning/param_jobs.rs, src/scanning/payload_families.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/param_jobs.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c750f2122fd802ef0c1dd7aac45e2f770b2526eab81179662c27746c49af5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.tainted_vars.contains(name) || self.global_taints.contains(name)\u0060 appears character-identically in 3 files \u2014 src/scanning/ast_dom_analysis/sinks.rs, src/scanning/ast_dom_analysis/taint.rs, src/scanning/ast_dom_analysis/url_lead.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"688472724e6e813ef099a29e628ee3b1f3af45090409ef8817d5e57c40fd003d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.expressions.is_empty() \u0026\u0026 t.quasis.len() == 1\u0060 appears character-identically in 2 files \u2014 src/scanning/ast_dom_analysis/script_element.rs, src/scanning/ast_dom_analysis/sources.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/script_element.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a4c55804e77c80b75ae6989dbfabfef7ca39b163614852cf2794e02696ab73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target != sink \u0026\u0026 target.starts_with(\u0022on\u0022)\u0060 appears character-identically in 2 files \u2014 src/scanning/ast_dom_analysis/mod.rs, src/scanning/ast_integration.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/mod.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f597c50a4178c9ccdcbb0b6af177136fdbc05137e8cec5ce5858dcc3cb80646"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.insecure \u0026\u0026 target.url.scheme().eq_ignore_ascii_case(\u0022https\u0022)\u0060 appears character-identically in 2 files \u2014 src/mcp/mod.rs, src/server/job_runner.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ccca2e275b32d6ad58c4fdc8af06647bf7488a19429c59ec968af5454e17a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapper_name == \u0022call\u0022 || wrapper_name == \u0022apply\u0022\u0060 appears character-identically in 2 files \u2014 src/scanning/ast_dom_analysis/sinks.rs, src/scanning/ast_dom_analysis/taint.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_dom_analysis/sinks.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47cc83d8f657c6f9612b82e575ee4357b0715a105d2f11301d51e28728cc6fa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060results_to_sarif_with_meta\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/result/format_sarif.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"332cb50e4f2e94d91079ac21cdb80d919ae3fcbb23a49143b1250ca63edb119f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060results_to_toml_with_meta\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/result/format_toml.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e2521a83f46c47f237de5cd8a2e3851f534105bc6b9a754b39eb6529e09b93"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060infer_base64_json\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoding/pipeline.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf621d05c155c218aa5be9d79345d5a2ce95fb526e215c15d17e3bc3666d81cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060infer_jwt\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoding/pipeline.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fc22d01f2ff2940e72a12cd781bad77cc5204f6fdd69a506e8ff72724ffcf7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060analyze_javascript_for_dom_xss_with_html_context\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1a68d2074229020af0ea1a61351c1898d40fd9b0d52e82d372e2e51e1cf64"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060check_dom_verification_with_evidence\u0060 turns every \u0060Err\u0060 into \u0060DomVerifyEvidenceOutcome::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/check_dom_verification.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0486044ae0d1f7ed24bfa9782e3aa7b645b24486d0a4ba9f18cd20628b6b0ec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_version\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/vuln_libs.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c09ebd065d5f0da84dd1172e8667a6b4088e89fa289e810d2f44660f751fd"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060payload.contains(\u0022\u003Cimg\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060payload.contains(\u0022\u003Cimg\u0022)\u0060 also satisfies \u0060payload.contains(\u0022\u003Cim\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/waf/bypass/mutate.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"684c5a83d716dcef2e31fb70e36b1ec7b7b8a5b18e5a8cca51ecbd8bdb798e71"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060source.contains(\u0022SharedWorker.message\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060source.contains(\u0022SharedWorker.message\u0022)\u0060 also satisfies \u0060source.contains(\u0022Worker.message\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"638263381fde239f4c634c8c028354850e4702de4f253dfab4406e1ec9bfef6f"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060source.contains(\u0022SharedWorker.message\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060source.contains(\u0022SharedWorker.message\u0022)\u0060 also satisfies \u0060source.contains(\u0022Worker.message\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scanning/ast_integration.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9e693152efc892bb66d0f05784bd0a687dbb9354bdbca6eee15d14e8ce7a38"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.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-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.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":"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":"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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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":103,"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."]}]}