Public report of hahwul/dalfox, published 14 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 14 November 2026, 19:18 UTC · Survey ID cd_22326f0e1de742d785b675247c992dbc

hahwul/dalfox

Measured 14 November 2026, 19:11 UTC, at code version 6ee09db

CAI score 59out of 100 Adequate
CriticalWeakAdequateStrongExemplary
No change since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A large codebase: 135,986 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 1.1 person-years · Weakest lens: Security and Compliance, 42

Findings by how serious they are

89 critical 430 serious 40 minor

22 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 19:11 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that implements it, and today the Canine Code Analyzer is the only one that does.

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

43of 43 dimensions measured by tools.
544of 559 findings point to an exact file and line, so you can open each one in the code. The other 15 concern the repository as a whole, such as missing documentation.
43dimensions across 6 lenses, read from 135,986 lines of product code in 1 project.
Chapters

Executive summary

hahwul/dalfox falls short of our standard for production, in part because it has pipeline tools referenced by a changeable name. It scores 59 out of 100 and is rated Adequate, and 87 of its 89 critical findings are security problems.

Security and Compliance, at 42, is the weakest lens and counts most in the score. The best first step for the work it takes is recording design decisions, worth about 6 points. Restoring certificate checks would lift Security and Compliance itself, worth about 9 points. Raising Security and Compliance to 70 would lift the score to about 70.

Sixty-eight pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Thirteen secrets can leak from the build pipeline, and three pipeline steps put outside input straight into a shell command, so an attacker can run commands in the build pipeline. Pinning each tool to an exact version, limiting each secret to its own step and passing outside input through environment variables would close these risks. Switching the validation back on would fix the security check on connections or logins switched off, and the two pipeline steps that install packages without pinning their versions need the packages they install pinned to exact versions. The two sets of files in separate parts that keep changing together need that dependency made explicit.

The product code is 135,986 lines, about €160,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Security and Compliance 42 · counts for 46%Maturity 61 · counts for 25%Code Health 78 · counts for 14%Production Readiness 82 · counts for 8%Architecture 98 · counts for 4%Performance 100 · counts for 2%

If Security and Compliance rose from 42 to 70, the lowest score rated Strong, the score would rise from 59 to about 70.

Code composition: what the lines of code are
Product code 89%Tests 11%
New since the last survey: 80 findings

These 80 critical or serious findings weren't in the previous survey, on 28 October 2026.

  • Cyclomatic Complexity · dalfox::payload::js_breakout::js_end_state (cyclomatic 45) src/payload/js_breakout.rs
  • Cyclomatic Complexity · dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist (cyclomatic 34) src/scanning/ast_dom_analysis/guards.rs
  • Cyclomatic Complexity · DomXssVisitor::walk_variable_declarator (cyclomatic 20) src/scanning/ast_dom_analysis/walk.rs
  • Cyclomatic Complexity · DomXssVisitor::walk_function_scope (cyclomatic 20) src/scanning/ast_dom_analysis/walk.rs
  • Cyclomatic Complexity · ScanWorkerCtx::run_reflection_phase (cyclomatic 19) src/scanning/mod.rs
  • Cyclomatic Complexity · dalfox::scanning::check_reflection::uploaded_file_urls (cyclomatic 19) src/scanning/check_reflection.rs
  • Cyclomatic Complexity · DomXssVisitor::register_module_exports (cyclomatic 18) src/scanning/ast_dom_analysis/walk.rs
  • Cyclomatic Complexity · dalfox::cmd::scan::validation::validate_numeric_args (cyclomatic 18) src/cmd/scan/validation.rs
  • Cyclomatic Complexity · dalfox::scanning::ast_dom_analysis::source_nesting_exceeds_limit (cyclomatic 18) src/scanning/ast_dom_analysis/mod.rs
  • Cyclomatic Complexity · DomXssVisitor::url_part_lead (cyclomatic 17) src/scanning/ast_dom_analysis/url_lead.rs
  • Cyclomatic Complexity · dalfox::cmd::scan::preflight::preflight_content_type (cyclomatic 17) src/cmd/scan/preflight.rs
  • Cyclomatic Complexity · DomXssVisitor::static_member_source (cyclomatic 16) src/scanning/ast_dom_analysis/bindings.rs
  • Cyclomatic Complexity · DomXssVisitor::collect_guards (cyclomatic 16) src/scanning/ast_dom_analysis/guards.rs
  • Cyclomatic Complexity · DomXssVisitor::collect_index_guard (cyclomatic 16) src/scanning/ast_dom_analysis/guards.rs
  • Cyclomatic Complexity · dalfox::parameter_analysis::ensure_sxss_candidate_params (cyclomatic 16) src/parameter_analysis/mod.rs
  • Cognitive Complexity · dalfox::payload::js_breakout::js_end_state (cognitive 69) src/payload/js_breakout.rs
  • Cognitive Complexity · dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist (cognitive 49) src/scanning/ast_dom_analysis/guards.rs
  • Cognitive Complexity · dalfox::scanning::check_reflection::uploaded_file_urls (cognitive 30) src/scanning/check_reflection.rs
  • Cognitive Complexity · DomXssVisitor::register_module_exports (cognitive 26) src/scanning/ast_dom_analysis/walk.rs
  • Cognitive Complexity · dalfox::target_parser::content_disposition_attr (cognitive 23) src/target_parser/mod.rs
  • Cognitive Complexity · DomXssVisitor::untaint (cognitive 22) src/scanning/ast_dom_analysis/guards.rs
  • Cognitive Complexity · dalfox::scanning::ast_dom_phase::fetch_and_analyze_external_js (cognitive 22) src/scanning/ast_dom_phase.rs
  • Cognitive Complexity · DomXssVisitor::concat_parts (cognitive 21) src/scanning/ast_dom_analysis/url_lead.rs
  • Cognitive Complexity · DomXssVisitor::walk_destructured_event_handler_body (cognitive 19) src/scanning/ast_dom_analysis/events.rs
  • Cognitive Complexity · DomXssVisitor::register_class_method_summaries_for_name (cognitive 19) src/scanning/ast_dom_analysis/summaries.rs
  • Cognitive Complexity · DomXssVisitor::url_call_lead (cognitive 18) src/scanning/ast_dom_analysis/url_lead.rs
  • Cognitive Complexity · DomXssVisitor::collect_guards (cognitive 17) src/scanning/ast_dom_analysis/guards.rs
  • Cognitive Complexity · dalfox::cmd::scan::validation::validate_numeric_args (cognitive 17) src/cmd/scan/validation.rs
  • Cognitive Complexity · DomXssVisitor::static_member_source (cognitive 16) src/scanning/ast_dom_analysis/bindings.rs
  • Code Duplication · Near-duplicate member pair (67 shared lines) src/parameter_analysis/mining/probe_body.rs
  • Code Duplication · Edited copy of a member (75 corresponding lines) src/parameter_analysis/mining/probe_graphql.rs
  • Code Duplication · Edited copy of a member (29 corresponding lines) src/scanning/check_dom_verification.rs
  • Code Duplication · Edited copy of a member (35 corresponding lines) src/scanning/check_reflection.rs
  • Code Duplication · Edited copy of a member (22 corresponding lines) src/utils/html.rs
  • Code Duplication · Edited copy of a member (41 corresponding lines) src/payload/xss_html.rs
  • Code Duplication · Edited copy of a member (19 corresponding lines) src/scanning/js_context_verify.rs
  • Code Duplication · Edited copy of a member (27 corresponding lines) src/scanning/check_reflection.rs
  • Code Duplication · Edited copy of a member (16 corresponding lines) src/utils/xml.rs
  • Code Duplication · Edited copy of a member (15 corresponding lines) src/scanning/js_context_verify.rs
  • Code Duplication · Edited copies of one member (5 members, 12+ corresponding lines) src/waf/bypass/mutate.rs
  • Code Duplication · Edited copy of a member (13 corresponding lines) src/waf/bypass/mutate.rs
  • Code Duplication · Edited copy of a member (23 corresponding lines) src/scanning/check_reflection.rs
  • Code Duplication · Edited copy of a member (14 corresponding lines) src/scanning/ast_dom_analysis/taint.rs
  • Code Duplication · Edited copy of a member (10 corresponding lines) src/cmd/scan/output.rs
  • Code Duplication · Edited copy of a member (12 corresponding lines) src/encoding/mod.rs
  • Code Duplication · Edited copy of a member (9 corresponding lines) src/parameter_analysis/mining/context_detect.rs
  • Code Duplication · Edited copy of a member (7 corresponding lines) src/parameter_analysis/discovery/mod.rs
  • Code Duplication · Edited copy of a member (6 corresponding lines) src/parameter_analysis/discovery/mod.rs
  • Code Duplication · Edited copy of a member (5 corresponding lines) src/payload/remote.rs
  • Code Duplication · Edited copy of a member (4 corresponding lines) src/scanning/js_context_verify.rs
  • Code Duplication · Duplicated block (22–26 lines × 2) src/scanning/check_dom_verification.rs
  • Code Duplication · Duplicated block (24 lines × 2) src/parameter_analysis/mining/probe_body.rs
  • Code Duplication · Duplicated block (22 lines × 2) src/parameter_analysis/discovery/form.rs
  • Code Duplication · Duplicated block (18–19 lines × 2) src/scanning/ast_dom_analysis/sinks.rs
  • Code Duplication · Duplicated block (14 lines × 2) src/parameter_analysis/mining/probe_body.rs
  • Code Duplication · Duplicated block (6–13 lines × 2) src/scanning/check_reflection.rs
  • Code Duplication · Duplicated block (12–13 lines × 2) src/scanning/check_reflection.rs
  • Code Duplication · Duplicated block (8–12 lines × 3) src/scanning/check_dom_verification.rs
  • Code Duplication · Duplicated block (12 lines × 2) src/waf/bypass/mutate.rs
  • Code Duplication · Duplicated block (11 lines × 2) src/scanning/ast_dom_analysis/sinks.rs
  • Code Duplication · Duplicated block (11 lines × 2) src/scanning/js_context_verify.rs
  • Code Duplication · Duplicated block (10–11 lines × 2) src/scanning/payload_families.rs
  • Code Duplication · Duplicated block (9–10 lines × 2) src/parameter_analysis/mod.rs
  • Code Duplication · Duplicated block (9 lines × 2) src/scanning/ast_dom_analysis/walk.rs
  • Code Duplication · Duplicated block (8 lines × 2) src/cmd/scan/startup.rs
  • Code Duplication · Duplicated block (7–8 lines × 2) src/scanning/ast_dom_analysis/taint.rs
  • Code Duplication · Duplicated block (7 lines × 2) src/parameter_analysis/mining/context_detect.rs
  • Code Duplication · Duplicated block (6 lines × 3) src/scanning/ast_dom_analysis/taint.rs
  • Code Duplication · Duplicated block (6 lines × 2) src/parameter_analysis/discovery/form.rs
  • Code Duplication · Duplicated block (13 lines × 2) src/scanning/xss_common.rs
  • Code Duplication · Duplicated block (10 lines × 2) src/parameter_analysis/discovery/form.rs
  • Code Duplication · Duplicated block (7 lines × 2) src/parameter_analysis/discovery/query.rs
  • Code Duplication · Duplicated block (8 lines × 2) src/waf/bypass/mutate.rs
  • Code Coverage · Low coverage: src/main.rs src/main.rs
  • Code Coverage · Low coverage: src/parameter_analysis/discovery/fragment.rs src/parameter_analysis/discovery/fragment.rs
  • Churn × Complexity Hotspots · Hotspot: src/target_parser/postman.rs src/target_parser/postman.rs
  • Churn × Complexity Hotspots · Repeated repair: src/scanning/ast_dom_analysis/reflected_markup.rs src/scanning/ast_dom_analysis/reflected_markup.rs
  • Dependency Vulnerabilities · REDACTED
  • Change Coupling · Boundary-crossing change coupling: tests.rs ↔ tests.rs src/parameter_analysis/mining/tests.rs
  • Change Coupling · Change coupling: mod.rs ↔ handlers.rs src/mcp/mod.rs

We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 36 findings

These 36 critical or serious findings were in the previous survey, on 28 October 2026, and are gone from this one.

  • Cyclomatic Complexity · dalfox::payload::js_breakout::enclosing_js_quote (cyclomatic 48) src/payload/js_breakout.rs
  • Cyclomatic Complexity · dalfox::scanning::ast_integration::generate_dom_xss_poc (cyclomatic 20) src/scanning/ast_integration.rs
  • Cognitive Complexity · dalfox::payload::js_breakout::enclosing_js_quote (cognitive 70) src/payload/js_breakout.rs
  • Cognitive Complexity · dalfox::scanning::ast_integration::generate_dom_xss_poc (cognitive 30) src/scanning/ast_integration.rs
  • Code Duplication · Near-duplicate member pair (50 shared lines) src/parameter_analysis/mining/probe_body.rs
  • Code Duplication · Duplicated block (22–27 lines × 2) src/scanning/check_dom_verification.rs
  • Code Duplication · Duplicated block (22 lines × 2) src/parameter_analysis/discovery/form.rs
  • Code Duplication · Duplicated block (21 lines × 2) src/parameter_analysis/mining/probe_body.rs
  • Code Duplication · Duplicated block (18–19 lines × 2) src/scanning/ast_dom_analysis/sinks.rs
  • Code Duplication · Duplicated block (8–12 lines × 3) src/scanning/check_dom_verification.rs
  • Code Duplication · Duplicated block (11 lines × 2) src/scanning/js_context_verify.rs
  • Code Duplication · Duplicated block (10 lines × 2) src/target_parser/openapi.rs
  • Code Duplication · Duplicated block (8–9 lines × 3) src/scanning/ast_dom_analysis/sinks.rs
  • Code Duplication · Duplicated block (8 lines × 2) src/scanning/mod.rs
  • Code Duplication · Duplicated block (7 lines × 2) src/parameter_analysis/mining/context_detect.rs
  • Code Duplication · Duplicated block (7 lines × 2) src/scanning/ast_dom_analysis/sinks.rs
  • Code Duplication · Duplicated block (7 lines × 2) src/scanning/js_context_verify.rs
  • Code Duplication · Duplicated block (6 lines × 2) src/parameter_analysis/discovery/form.rs
  • Code Duplication · Duplicated block (6 lines × 2) src/scanning/ast_dom_analysis/sinks.rs
  • Code Duplication · Duplicated block (5 lines × 3) src/target_parser/openapi.rs
  • Code Duplication · Duplicated block (19 lines × 2) src/scanning/xss_common.rs
  • Code Duplication · Duplicated block (10 lines × 2) src/parameter_analysis/discovery/form.rs
  • Code Duplication · Duplicated block (7 lines × 2) src/parameter_analysis/discovery/query.rs
  • Code Duplication · Duplicated block (5 lines × 2) src/scanning/result/mod.rs
  • Cohesion (LCOM4) · Low cohesion: ScanArgs (LCOM4 4) src/cmd/scan/args.rs
  • Secret Scanning · Leaked secret: hardcoded-credential src/scanning/check_reflection/tests.rs
  • Churn × Complexity Hotspots · Hotspot: src/parameter_analysis/mining/probe_body.rs src/parameter_analysis/mining/probe_body.rs
  • Churn × Complexity Hotspots · Hotspot: src/waf/bypass/strategy.rs src/waf/bypass/strategy.rs
  • Churn × Complexity Hotspots · Repeated repair: src/server/handlers.rs src/server/handlers.rs
  • Churn × Complexity Hotspots · Repeated repair: src/scanning/ast_dom_analysis/mod.rs src/scanning/ast_dom_analysis/mod.rs
  • Churn × Complexity Hotspots · Repeated repair: src/server/types.rs src/server/types.rs
  • Churn × Complexity Hotspots · Repeated repair: src/server/cors.rs src/server/cors.rs
  • Dependency Vulnerabilities · Medium vulnerability: [GHSA redacted] REDACTED
  • Change Coupling · Boundary-crossing change coupling: analysis.rs ↔ tests.rs src/cmd/scan/analysis.rs
  • Change Coupling · Boundary-crossing change coupling: tests.rs ↔ tests.rs src/parameter_analysis/discovery/tests.rs
  • Change Coupling · Change coupling: tests.rs ↔ tests.rs src/parameter_analysis/discovery/tests.rs
Rebuild cost: about €160,000 · Estimate
Cost to rebuild€53,000 to €270,000, for 891 to 2,827 hours of work, about 1.1 person-years for 1 to 3 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 59. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 135,986 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.rs.
Raises the score by about 6 points · Low effort · ADR Quality
2
Stop accepting every TLS certificate: delete `danger_accept_invalid_certs(true)` / `SslVerifyMode::NONE` / the rustls verifier that returns `ServerCertVerified::assertion()` unconditionally, and trust a self-signed or private server by adding its CA as a root (`add_root_certificate`, a rustls `RootCertStore`) — never by switching verification off.
Raises the score by about 9 points · Medium effort · Web-Security Posture
3
Name the access rules — roles and permissions declared once (an enum Role/Permission, actix-web-grants #[protect(…)], axum-login's permission_required!, a casbin or oso policy) and consulted where access is checked, so the rule set is reviewable and testable on its own.
Raises the score by about 9 points · Medium effort · Access Controls

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €160,000 to build again, about 1.1 person-years of work. Its weakest lens is Security and Compliance, at 42 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.1 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 5% to 11% on every change. The history of the code shows how much it changes: about 112,450 lines over the last 90 days, which is about 456,047 lines a year. At that pace, the extra work comes to an estimated 53.7 to 322.2 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

132 modules, with 254 dependencies between them. 2 loops run through 13 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 92 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 utils.shimmer2 scanning.tech_detect3 waf4 waf.bypass.types5 target_parser6 parameter_analysis7 scanning.result8 oob9 scanning.ast_dom_analysis10 server.types11 cmd.scan.args12 scanning.ast_integration13 cmd.scan.input14 cmd.scan.session15 cmd.scan.state_file16 job.spec17 parameter_analysis.mining18 parameter_analysis.mining.probe_body19 parameter_analysis.mining.probe_dictionary20 parameter_analysis.mining.probe_graphql21 parameter_analysis.mining.probe_json22 parameter_analysis.mining.probe_multipart23 parameter_analysis.mining.probe_query24 parameter_analysis.mining.probe_response_id25 parameter_analysis.mining.probe_xml26 scanning.ast_dom_phase27 scanning.check_dom_verification28 scanning.param_jobs29 cmd.scan30 cmd.scan.preflight31 job32 scanning.check_reflection33 cmd.scan.analysis34 cmd.scan.output35 cmd.scan.scan_loop36 job.runner37 mcp38 scanning39 scanning.payload_families40 server.handlers
1 utils.shimmer
2 scanning.tech_detect1
3 waf11
4 waf.bypass.types1
5 target_parser11112
6 parameter_analysis1111
7 scanning.result13
8 oob2
9 scanning.ast_dom_analysis1
10 server.types112
11 cmd.scan.args21
12 scanning.ast_integration111
13 cmd.scan.input211
14 cmd.scan.session212
15 cmd.scan.state_file223
16 job.spec11
17 parameter_analysis.mining1111
18 parameter_analysis.mining.probe_body1111
19 parameter_analysis.mining.probe_dictionary1111
20 parameter_analysis.mining.probe_graphql1111
21 parameter_analysis.mining.probe_json1111
22 parameter_analysis.mining.probe_multipart1111
23 parameter_analysis.mining.probe_query1221
24 parameter_analysis.mining.probe_response_id1111
25 parameter_analysis.mining.probe_xml1111
26 scanning.ast_dom_phase1111
27 scanning.check_dom_verification111
28 scanning.param_jobs1111
29 cmd.scan11111
30 cmd.scan.preflight13111
31 job1512
32 scanning.check_reflection1211
33 cmd.scan.analysis112211
34 cmd.scan.output1112
35 cmd.scan.scan_loop222131
36 job.runner1315
37 mcp211
38 scanning224212
39 scanning.payload_families2111
40 server.handlers1111
Uses a module listed above itPart of a loopThe module itself
1 utils.shimmer2 scanning.tech_detect3 waf4 waf.bypass.types5 target_parser6 parameter_analysis7 scanning.result8 oob9 scanning.ast_dom_analysis10 server.types11 cmd.scan.args12 scanning.ast_integration13 cmd.scan.input14 cmd.scan.session15 cmd.scan.state_file16 job.spec17 parameter_analysis.mining18 parameter_analysis.mining.probe_body19 parameter_analysis.mining.probe_dictionary20 parameter_analysis.mining.probe_graphql21 parameter_analysis.mining.probe_json22 parameter_analysis.mining.probe_multipart23 parameter_analysis.mining.probe_query24 parameter_analysis.mining.probe_response_id25 parameter_analysis.mining.probe_xml26 scanning.ast_dom_phase27 scanning.check_dom_verification28 scanning.param_jobs29 cmd.scan30 cmd.scan.preflight31 job32 scanning.check_reflection33 cmd.scan.analysis34 cmd.scan.output35 cmd.scan.scan_loop36 job.runner37 mcp38 scanning39 scanning.payload_families40 server.handlersutils.shimmer1scanning.tech_detect2waf3waf.bypass.types4target_parser5parameter_analysis6scanning.result7oob8scanning.ast_dom_analysis9server.types10cmd.scan.args11scanning.ast_integration12cmd.scan.input13cmd.scan.session14cmd.scan.state_file15job.spec16parameter_analysis.mining17parameter_analysis.mining.probe_body18parameter_analysis.mining.probe_dictionary19parameter_analysis.mining.probe_graphql20parameter_analysis.mining.probe_json21parameter_analysis.mining.probe_multipart22parameter_analysis.mining.probe_query23parameter_analysis.mining.probe_response_id24parameter_analysis.mining.probe_xml25scanning.ast_dom_phase26scanning.check_dom_verification27scanning.param_jobs28cmd.scan29cmd.scan.preflight30job31scanning.check_reflection32cmd.scan.analysis33cmd.scan.output34cmd.scan.scan_loop35job.runner36mcp37scanning38scanning.payload_families39server.handlers40111111112111113211122111121121222311111111111111111111111111122111111111111111111111111113111151212111122111112222131131521122421221111111+92 more modules (most-connected shown)

At a glance — Code Health · 78% · Adequate · gated by D1, D2 ·

At a glance — Architecture · 98% · Exemplary ·

At a glance — Maturity · 61% · Adequate · gated by M2 ·

At a glance — Readiness · 82% · Strong ·

At a glance — Security · 42% · Weak · gated by D29, C2, S1 ·

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A05:2025 — Injection87High / Critical
A03:2025 — Software Supply Chain Failures13Medium
A02:2025 — Security Misconfiguration3Medium

Roadmap

Top priorities: Stop accepting every TLS certificate: delete `danger_accept_invalid_certs(true)` / `SslVerifyMode::NONE` / the rustls verifier that returns `ServerCertVerified::assertion()` unconditionally, and trust a self-signed or private server by adding its CA as a root (`add_root_certificate`, a rustls `RootCertStore`) — never by switching verification off; Name the access rules — roles and permissions declared once (an enum Role/Permission, actix-web-grants #[protect(…)], axum-login's permission_required!, a casbin or oso policy) and consulted where access is checked, so the rule set is reviewable and testable on its own; Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.rs.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.rs.+6.1 ptsLowADR Quality
Stop accepting every TLS certificate: delete `danger_accept_invalid_certs(true)` / `SslVerifyMode::NONE` / the rustls verifier that returns `ServerCertVerified::assertion()` unconditionally, and trust a self-signed or private server by adding its CA as a root (`add_root_certificate`, a rustls `RootCertStore`) — never by switching verification off.+9.4 ptsMediumWeb-Security Posture
Name the access rules — roles and permissions declared once (an enum Role/Permission, actix-web-grants #[protect(…)], axum-login's permission_required!, a casbin or oso policy) and consulted where access is checked, so the rule set is reviewable and testable on its own.+9.1 ptsMediumAccess Controls
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+4.9 ptsMediumArchitecture documentation
Resolve the 12 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2), REDACTED.+3.3 ptsMediumStatic Analysis (SAST)
Resolve the 5 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED.+1.3 ptsLowSupply-chain Provenance & Signing
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED.+1.2 ptsLowStatic Analysis (SAST)
Bring the 160 bodies over 15 down to 15 or less in Cognitive Complexity — start with dalfox::parameter_analysis::discovery::form::check_form_discovery_with (cognitive 202), dalfox::cmd::scan::input::resolve_targets (cognitive 182), dalfox::scanning::js_context_verify::gather_sink_spans_in_expression (cognitive 134).+2.0 ptsHighCognitive Complexity

File quality

Per-file score 0–10 — a quality signature. Of 103 files carrying findings, judged against the Production bar: 10% slop · 68% mixed · 22% near-clean.

FileScoreBandWorst signal
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
src/mcp/mod.rs5.5MixedCyclomatic Complexity: DalfoxMcp::scan_with_dalfox (cyclomatic 17)
src/main.rs5.8MixedCyclomatic Complexity: dalfox::main (cyclomatic 40)
src/parameter_analysis/mod.rs6.0MixedExplicit Debt: TodoComment
REDACTED6.3MixedIaC & Container Security: Medium IaC: REDACTED
src/scanning/ast_dom_analysis/sinks.rs7.0MixedCyclomatic Complexity: DomXssVisitor::walk_assignment_expression (cyclomatic 78)
src/scanning/js_context_verify.rs7.0MixedCyclomatic Complexity: dalfox::scanning::js_context_verify::gather_sink_spans_in_expression (cyclomatic 71)

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 89

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 430

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 40

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 22

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 43 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.

Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.

What we checked — 43 dimensions across the health lenses
D1D2D4D6D8D12D13D14D15D17D20D28D29D30D31D34D35D36D37D43D44AX10AX3AX4AX9C2M1M2M3M4P1P10P2P3P4P6P7PF3S1X1X14X21X30

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 544 of 559 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic

Every finding is locatable in findings.md. Run 01a1db78-edaa-7d0a-bbca-749f077fdce6.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D4 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 63 duplicated block group(s) on this row were found in the languages this pass could tokenize, and they do NOT cover all of this repository's production source: .rs (135,986 lines, 95% of production source) went unread, because no language model this pass could load exposed a clone-unit token stream for those file kinds. Duplication in that source is UNMEASURED — its absence from the count above is a gap in this analyzer's language coverage, not a finding that the code is free of duplication.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 129 test files), but it was not re-run: its build outgrew the 6 GB scratch ceiling (6.274 GB measured) and was stopped; its suite was not run. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (55 contributor(s) across 3300 commit(s) sampled, automation and bot accounts excluded). One of them holds 93% of the history; the other 54 hold 0.1% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D26 Project Cohesion — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `(repository root)` (135986 LoC, 184 module-visible types across 21 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
  • D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. User interface: 3 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. Boot: the service booted and answers HTTP at http://127.0.0.1:6664, but serves no HTML page — nothing for the accessibility crawl.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X13 Undrained process stream — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X17 Uncapped recursion over a caller-supplied document — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X19 Unrestored process-global state — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X22 Contradicted release guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Java, TypeScript/JavaScript, Python, Dart, Ruby, Scala, Kotlin and PHP source only, and no C# was loaded, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X23 Unguarded diagnostic materialisation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, F#, Python, Dart, Ruby, Scala, Kotlin and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, F#, Python, Dart, Ruby, Scala, Kotlin or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X24 Document value interpolated into markup unescaped — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Scala, Ruby and Python source only, and no C# was loaded and no JavaScript/TypeScript, Java, Scala, Ruby or Python was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X25 Inert configuration knob — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Erlang, Python, Dart and Ruby source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Erlang, Python, Dart or Ruby was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go and JavaScript/TypeScript source only, and no C# was loaded and no PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go, JavaScript or TypeScript was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations: 3 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity3.0 / 10Weak✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

Maturity: Documented → Verified → Prevented · effective 3.0 / 10 · rule-coverage 100% · ceiling Prevented

107 function(s) exceeded the cyclomatic complexity threshold of 15; the worst was DomXssVisitor::call_taint_and_source at 89. A further 6 function(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being dalfox::parameter_analysis::encoded_variants at 23 — they are counted neither in the figure above nor in this dimension's score. 3 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: src/waf/bypass/strategy.rs (dalfox::waf::bypass::strategy::get_bypass_strategy at 21), src/waf/mod.rs (WafType::fmt at 21), src/scanning/tech_detect.rs (TechType::fmt at 19). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

dalfox::cmd::scan::input::resolve_targets (cyclomatic 75) · ×70src/cmd/scan/input.rs:167
DomXssVisitor::call_taint_and_source (cyclomatic 89) · ×27src/scanning/ast_dom_analysis/taint.rs:42
ScanWorkerCtx::run_reflection_phase (cyclomatic 19) · ×4src/scanning/mod.rs:1040
Result::results_to_markdown_with_meta (cyclomatic 35) · ×2src/scanning/result/format_markdown.rs:95
ScanOptionChecks::validate (cyclomatic 38)src/job/mod.rs:562

+ 3 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 6 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with DomXssVisitor::call_taint_and_source (cyclomatic 89), DomXssVisitor::walk_assignment_expression (cyclomatic 78), dalfox::cmd::scan::input::resolve_targets (cyclomatic 75). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 6 together lifts Cyclomatic Complexity from 3.0 to about 4.1/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

Maturity: Documented → Verified → Prevented · effective 2.0 / 10 · rule-coverage 100% · ceiling Prevented

160 function(s) exceeded the cognitive complexity threshold of 15; the worst was dalfox::parameter_analysis::discovery::form::check_form_discovery_with at 202.

dalfox::parameter_analysis::discovery::form::check_form_discovery_with (cognitive 202) · ×113src/parameter_analysis/discovery/form.rs:19
DomXssVisitor::walk_assignment_expression (cognitive 129) · ×34src/scanning/ast_dom_analysis/sinks.rs:9
ScanWorkerCtx::run_dom_phase (cognitive 44) · ×6src/scanning/mod.rs:1591
Result::results_to_markdown_with_meta (cognitive 85) · ×2src/scanning/result/format_markdown.rs:95
Op::build (cognitive 46)src/target_parser/openapi.rs:379

+ 4 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 160 bodies over 15 down to 15 or less in Cognitive Complexity — start with dalfox::parameter_analysis::discovery::form::check_form_discovery_with (cognitive 202), dalfox::cmd::scan::input::resolve_targets (cognitive 182), dalfox::scanning::js_context_verify::gather_sink_spans_in_expression (cognitive 134). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 160 together lifts Cognitive Complexity from 2.0 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication9.4 / 10Stronggated by 84 serious findings✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.4 / 10 · rule-coverage 100% · ceiling Verified

63 duplicated block group(s) detected. 1.4 % of the production lines (1,921 of 135,986) are in a reported copy. A further 21 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. Measured on part of this repository only: .rs (95% of production source) was not exposed to the token comparison, so duplication there is unmeasured and is not in this count.

Duplicated block (8 lines × 2) · ×9src/cmd/scan/startup.rs:378
Duplicated block (10 lines × 2) · ×5src/parameter_analysis/discovery/cookie.rs:35
Duplicated block (6 lines × 2) · ×5src/parameter_analysis/discovery/form.rs:119
Duplicated block (7 lines × 2) · ×4src/parameter_analysis/discovery/form.rs:110
Duplicated block (12 lines × 2) · ×3src/cmd/scan/output.rs:301

+ 50 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 9 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with js_context_verify.rs (2), startup.rs, pipeline.rs. — One of this dimension's main actionable groups (9 warning-level).
  2. Resolve the 5 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with cookie.rs, js_context_verify.rs, mutate.rs. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 5 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with xml.rs (2), form.rs, resolve.rs. — One of this dimension's main actionable groups (5 warning-level).

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D6 · Cohesion (LCOM4)10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 38 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D8 · Code Coverage10.0 / 10Stronggated by 2 serious findings✓ Tool-verified

What it measures: How much of the code is actually exercised by tests.

Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

Line coverage 93.0% — 2 file(s) below 50%. Measured from the Rust suite (repository root: `cargo test --workspace` instrumented over 184 production file(s), 15 test binaries and 1 doc-test binaries).

Low coverage: src/main.rs · ×2src/main.rs:1

What to do

  1. Resolve the 2 Low coverage finding(s) in Code Coverage — start with main.rs, fragment.rs. — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.

D12 · Dependency Hygiene9.7 9.4 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.4 / 10 · rule-coverage 97% · ceiling Verified

7 outdated, 0 yanked direct Cargo dependencies. 34 of 35 direct crates were graded against crates.io (0 not published there, 1 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.

Outdated: clap · ×7

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 348 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.1 / 10Stronggated by 57 serious findings✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented → Verified → Prevented · effective 9.1 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: src/cmd/scan/mod.rs (26×54=1404); src/scanning/ast_dom_analysis/sinks.rs (17×78=1326); src/scanning/ast_dom_analysis/taint.rs (14×89=1246) Repeated repair below the complexity floor: src/utils/http.rs (10 of 13 changes were fixes); src/server/util.rs (8 of 13 changes were fixes); src/server/job_runner.rs (7 of 12 changes were fixes)

Hotspot: src/cmd/scan/mod.rs · ×46src/cmd/scan/mod.rs:262
Repeated repair: src/utils/http.rs · ×11src/utils/http.rs:842

What to do

  1. Resolve the 46 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (8), sinks.rs, taint.rs. — One of this dimension's main actionable groups (46 warning-level).
  2. Resolve the 11 Repeated repair finding(s) in Churn × Complexity Hotspots — start with http.rs, util.rs, job_runner.rs. — One of this dimension's main actionable groups (11 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

D17 · Explicit Debt10.0 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

1 deducted task-comment markers across 135986 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoCommentsrc/parameter_analysis/mod.rs:495

What to do

  1. Resolve the 1 TodoComment finding(s) in Explicit Debt — start with mod.rs. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs foundsrc/main.rs:1

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.rs. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)0.3 / 10Critical✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented → Verified → Prevented · effective 0.3 / 10 · rule-coverage 100% · ceiling Documented

87 finding(s): 0 critical, 86 high, 1 medium, 0 low. 67 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 2 file(s) — `src/parameter_analysis/tests.rs` (line 2617), `src/server/tests.rs` (line 6494) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 4 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 2 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 12 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (12 issue-level).
  2. Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
  3. No action in Static Analysis (SAST) — all 67 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (67 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities9.8 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

2 finding(s): 0 critical, 0 high, 1 medium, 0 low.

REDACTED
REDACTED

What to do

  1. Resolve the 1 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.

D31 · IaC & Container Security9.7 / 10Stronggated by 3 serious findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Documented

3 finding(s): 0 critical, 0 high, 3 medium, 0 low.

REDACTED

What to do

  1. Resolve the 3 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).

Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

Every significant source file has living knowledge — recently and meaningfully worked. Counted over 190 of the 202 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

D35 · Change Coupling9.7 / 10Adequategated by 2 critical findings✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: mod.rs↔job_runner.rs 93%; mod.rs↔handlers.rs 73%; tests.rs↔tests.rs 55%

Boundary-crossing change coupling: tests.rs ↔ tests.rs · ×2src/parameter_analysis/mining/tests.rs:1
Change coupling: mod.rs ↔ job_runner.rs · ×3src/mcp/mod.rs:1

What to do

  1. Resolve the 2 Boundary-crossing change coupling finding(s) in Change Coupling — start with tests.rs (2). — One of this dimension's main actionable groups (2 issue-level).
  2. Resolve the 3 Change coupling finding(s) in Change Coupling — start with mod.rs (2), tests.rs. — One of this dimension's main actionable groups (3 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

D36 · Supply-chain Provenance & Signing5.0 / 10Adequate✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

Maturity: Documented → Verified → Prevented · effective 5.0 / 10 · rule-coverage 100% · ceiling Documented

2/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 1 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 5 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (5 warning-level).
  2. Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.

Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

A vulnerability-disclosure policy (.github/SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition9.7 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

C2 · Access Controls3.3 / 10Weak✓ Tool-verified

Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.

Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.

  • Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
  • Only 2 place(s) refuse an unauthorized caller — too few to demonstrate default-deny across handlers.

What to do

  • Name the access rules — roles and permissions declared once (an enum Role/Permission, actix-web-grants #[protect(…)], axum-login's permission_required!, a casbin or oso policy) and consulted where access is checked, so the rule set is reviewable and testable on its own.
  • Enforce authorization at every handler — a guard on each route, or a global authentication guard/middleware with explicit public opt-outs, so protected-by-default is demonstrable.
M1 · Documentation (README)6.7 / 10Adequate✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

M4 · Documentation accuracy8.0 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

  • README.md links to `docs/static/images/illust2.webp`, but `docs/static/images/illust2.webp` 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' 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. — README.md:114

What to do

  • Reconcile the README with reality: README.md links to `docs/static/images/illust2.webp`, but `docs/static/images/illust2.webp` does not exist.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P2 · Observability8.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

P3 · Security & performance tooling7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

What to do

  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

P7 · Outbound HTTP resilience10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.

Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

S1 · Web-Security Posture3.0 / 10Weak✓ Tool-verified

Other · Security — Read from this repository's Rust source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves HTTP itself (`axum::serve(` (src/server/mod.rs:357)), so its Rust source was also read for the server controls: TLS served or HSTS set, security response headers, cookie flags and inbound validation — each credited where its Rust spelling appears in production source, not proven on every route. A Rocket 0.5 application is credited the headers Rocket's default `Shield` sends unless it attaches its own, and its cookie jar's SameSite=Strict default; a session middleware its default cookie flags.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.

  • `.danger_accept_invalid_certs(true)` is set on a TLS client, so every peer certificate is accepted — 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 — the connection is encrypted to the attacker, not to the intended host. Remove the override so the TLS stack verifies the peer — reqwest, native-tls, rustls and openssl's `SslConnector` 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: `reqwest::ClientBuilder::add_root_certificate(Certificate::from_pem(…))`, a rustls `RootCertStore` holding its CA, or `SslConnectorBuilder::set_ca_file`, which keeps the chain and hostname checks on. — src/payload/remote.rs:304
  • This repository starts an HTTP server and nothing in its Rust source or committed `Rocket.toml` secures the transport: no TLS served (actix-web `bind_rustls`/`bind_openssl`, axum-server `bind_rustls` with a `RustlsConfig`, tonic `ServerTlsConfig`, a `TlsAcceptor`, Rocket's `[default.tls]`), no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: `axum::serve(` (src/server/mod.rs:357).
  • Set: Content-Security-Policy, X-Content-Type-Options. Missing: Strict-Transport-Security, X-Frame-Options — the four headers that carry the points of this card's security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each.(−1.0 on this card.) The server: `axum::serve(` (src/server/mod.rs:357).

What to do

  • Stop accepting every TLS certificate: delete `danger_accept_invalid_certs(true)` / `SslVerifyMode::NONE` / the rustls verifier that returns `ServerCertVerified::assertion()` unconditionally, and trust a self-signed or private server by adding its CA as a root (`add_root_certificate`, a rustls `RootCertStore`) — never by switching verification off.
  • Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only.
  • Add Strict-Transport-Security, X-Frame-Options beside the headers the Rust server already sets.
X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health78%Adequate — gated by D1, D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture98%ExemplarySolid.
Maturity61%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness82%StrongSolid.
Security42%Weak — gated by D29, C2, S1Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance100%ExemplaryStrongest area.
Unscored — 4 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • X10 Duplicated predicate — 14 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 7 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X9 Subsumed condition operand — 3 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 70 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives — Frontend below the scale floor (18 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC2 Forms & labels — Frontend below the scale floor (18 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC3 Page structure — Frontend below the scale floor (18 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC4 Keyboard semantics — Frontend below the scale floor (18 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC5 ARIA correctness — Frontend below the scale floor (18 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC6 Visual & motion safety — Frontend below the scale floor (18 DOM element(s) < 25) — too little surface to assess accessibility.
  • AX1 Captive dependencies — Not applicable: Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
  • AX2 Stateful singletons — Not applicable: Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — The runtime tier booted this repository's service, but the service booted and answers HTTP at http://127.0.0.1:6664, but serves no HTML page — nothing for the accessibility crawl. This repository also has a user interface (3 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates) that the booted service does not serve, and this scan has no strategy that reaches it — so no WCAG success criterion was verified in a rendered page on this run. That is a gap in OUR tooling, not a finding about your application: nothing here says the interface is inaccessible. The static accessibility checks still ran.
  • AXS1 Runtime exposed surface — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~16679 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D21 Naming Consistency — N/A — too few peers to establish a naming convention (5900 declarations, no unit with a dominant convention).
  • D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D3 God Classes — Most of this repository's production source (.cr, .rs) was not read by god-class detection, so class size was not assessed for the languages that are the product — whatever else this pass did read is not this repository's class size. Not scored — this is a gap in the analyzer, not a verdict about this repository.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D5 Coupling — Not applicable — this Cargo build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (11 value object(s))
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage data present for 184 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • X12 Unreachable branch — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X13 Undrained process stream — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X17 Uncapped recursion over a caller-supplied document — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X19 Unrestored process-global state — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X2 Cancellation propagation — no C# was loaded; this repository's Rust was read, and no request in it can be cancelled by a caller — a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X23 Unguarded diagnostic materialisation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X24 Document value interpolated into markup unescaped — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X25 Inert configuration knob — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X26 Unsynchronised callback handoff — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. Rust's compiler refuses the unsynchronised version: a collection shared between a callback's thread and the waiting body must be `Sync`, which a `Vec`, `VecDeque` or `HashMap` is only behind a `Mutex`/`RwLock`, so the race this check looks for cannot be written in safe Rust. Not a gap in the analyzer and not a finding about your code.
  • X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Rust was read, and it logs through none: the `log` crate's macros take one finished message (as log4net does in C#; its `kv` values are an opt-in its backends mostly drop), `println!`/`eprintln!` are not loggers, or it makes no log call outside its tests and examples at all. Calls through `tracing` (`tracing::info!`, or `info!` imported from it) would be judged.
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 89 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 42 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Boundary-crossing change coupling · ×2
  • Boundary-crossing change coupling: tests.rs ↔ tests.rs src/parameter_analysis/mining/tests.rs:1 — `src/parameter_analysis/mining/tests.rs` (context parameter_analysis) and `src/scanning/xss_common/tests.rs` (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 — 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) — 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't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `c8f30734` refactor(args): give ScanArgs a Default so adding a flag touches one …; `3814cf53` fix(scan): detect attribute-name slot, emit autotrigger payloads; `f36de133` fix(scan): detect JS template-literal context, inject \${…} breakouts — run `git show` on any of them.
  • Boundary-crossing change coupling: tests.rs ↔ tests.rs src/cmd/scan/tests.rs:1 — `src/cmd/scan/tests.rs` (context cmd) and `src/config/tests.rs` (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 — 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) — 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't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `557cb6a0` fix(config): stop config from overriding explicitly typed CLI flags; …; `c8f30734` refactor(args): give ScanArgs a Default so adding a flag touches one …; `d4cb9b03` fix(scanning,server,waf): close 10 latent bugs found by source audit … — run `git show` on any of them.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
S1 · Web-Security Posture · TLS certificate validation disabled · ×1
  • TLS certificate validation disabled src/payload/remote.rs:304 — `.danger_accept_invalid_certs(true)` is set on a TLS client, so every peer certificate is accepted — 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 — the connection is encrypted to the attacker, not to the intended host. Remove the override so the TLS stack verifies the peer — reqwest, native-tls, rustls and openssl's `SslConnector` 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: `reqwest::ClientBuilder::add_root_certificate(Certificate::from_pem(…))`, a rustls `RootCertStore` holding its CA, or `SslConnectorBuilder::set_ca_file`, which keeps the chain and hostname checks on.
Serious — 430 finding(s)
D2 · Cognitive Complexity · dalfox · ×113
  • dalfox::parameter_analysis::discovery::form::check_form_discovery_with (cognitive 202) src/parameter_analysis/discovery/form.rs:19 — 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.
  • dalfox::cmd::scan::input::resolve_targets (cognitive 182) src/cmd/scan/input.rs:167 — 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.
  • dalfox::scanning::js_context_verify::gather_sink_spans_in_expression (cognitive 134) src/scanning/js_context_verify.rs:816 — 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 — 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's 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.
  • dalfox::scanning::check_reflection::fetch_injection_response (cognitive 91) src/scanning/check_reflection.rs:2732 — 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's 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.
  • dalfox::scanning::xss_common::generate_dynamic_payloads_uncached (cognitive 86) src/scanning/xss_common.rs:65 — 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 — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • dalfox::parameter_analysis::active_probe_param (cognitive 80) src/parameter_analysis/mod.rs:1005 — 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 — 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's 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.
  • dalfox::cmd::scan::scan_loop::scan_host_group (cognitive 79) src/cmd/scan/scan_loop.rs:407 — 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.
  • dalfox::scanning::url_inject::build_injected_url (cognitive 73) src/scanning/url_inject.rs:199 — 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 — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • dalfox::parameter_analysis::discovery::query::check_query_discovery (cognitive 72) src/parameter_analysis/discovery/query.rs:31 — 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.
  • dalfox::cmd::scan::run_scan (cognitive 71) src/cmd/scan/mod.rs:262 — 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.
  • dalfox::payload::js_breakout::js_end_state (cognitive 69) src/payload/js_breakout.rs:229 — 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.
  • dalfox::scanning::js_context_verify::check_exec_sink_candidate_for_marker (cognitive 69) src/scanning/js_context_verify.rs:1364 — 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 — 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's 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.
  • dalfox::scanning::ast_dom_phase::run_ast_dom_analysis (cognitive 65) src/scanning/ast_dom_phase.rs:33 — 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.
  • dalfox::job::runner::execute_scan (cognitive 64) src/job/runner.rs:360 — 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.
  • dalfox::scanning::ast_integration::extract_js_and_script_ids_from_xml_document (cognitive 62) src/scanning/ast_integration.rs:165 — 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.
  • dalfox::scanning::param_jobs::generate_param_jobs (cognitive 62) src/scanning/param_jobs.rs:148 — 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.
  • dalfox::parameter_analysis::xml_inject::parse_tag (cognitive 59) src/parameter_analysis/xml_inject.rs:196 — 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.
  • dalfox::scanning::js_context_verify::process_exec_sink_expression (cognitive 59) src/scanning/js_context_verify.rs:556 — 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 — 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's 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.
  • dalfox::scanning::js_context_verify::gather_sink_spans_in_statement (cognitive 59) src/scanning/js_context_verify.rs:651 — 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 — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • dalfox::cmd::scan::analysis::preflight_and_analyze_target (cognitive 56) src/cmd/scan/analysis.rs:322 — 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 — 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's 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.
  • dalfox::payload::js_breakout::compute_js_breakout (cognitive 50) src/payload/js_breakout.rs:69 — 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.
  • dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist (cognitive 49) src/scanning/ast_dom_analysis/guards.rs:56 — 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.
  • dalfox::target_parser::parse_raw_http_request (cognitive 49) src/target_parser/mod.rs:726 — 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 — 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's 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.
  • dalfox::utils::html::nesting_overflow_offset (cognitive 49) src/utils/html.rs:413 — 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.
  • dalfox::parameter_analysis::xml_inject::xml_injection_points (cognitive 47) src/parameter_analysis/xml_inject.rs:42 — 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.
  • + 88 more in this group — see findings.md.
D1 · Cyclomatic Complexity · dalfox · ×70
  • dalfox::cmd::scan::input::resolve_targets (cyclomatic 75) src/cmd/scan/input.rs:167 — 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.
  • dalfox::scanning::js_context_verify::gather_sink_spans_in_expression (cyclomatic 71) src/scanning/js_context_verify.rs:816 — 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.
  • dalfox::parameter_analysis::discovery::form::check_form_discovery_with (cyclomatic 68) src/parameter_analysis/discovery/form.rs:19 — 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.
  • dalfox::cmd::scan::run_scan (cyclomatic 54) src/cmd/scan/mod.rs:262 — 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.
  • dalfox::job::runner::execute_scan (cyclomatic 48) src/job/runner.rs:360 — 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.
  • dalfox::payload::js_breakout::compute_js_breakout (cyclomatic 46) src/payload/js_breakout.rs:69 — 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.
  • dalfox::payload::js_breakout::js_end_state (cyclomatic 45) src/payload/js_breakout.rs:229 — 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.
  • dalfox::main (cyclomatic 40) src/main.rs:198 — 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 — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • dalfox::parameter_analysis::active_probe_param (cyclomatic 40) src/parameter_analysis/mod.rs:1005 — 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.
  • dalfox::scanning::js_context_verify::gather_sink_spans_in_statement (cyclomatic 39) src/scanning/js_context_verify.rs:651 — 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.
  • dalfox::scanning::xss_common::generate_dynamic_payloads_uncached (cyclomatic 38) src/scanning/xss_common.rs:65 — 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.
  • dalfox::parameter_analysis::discovery::query::check_query_discovery (cyclomatic 37) src/parameter_analysis/discovery/query.rs:31 — 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.
  • dalfox::cmd::scan::scan_loop::scan_host_group (cyclomatic 36) src/cmd/scan/scan_loop.rs:407 — 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.
  • dalfox::scanning::check_reflection::fetch_injection_response (cyclomatic 35) src/scanning/check_reflection.rs:2732 — dalfox::scanning::check_reflection::fetch_injection_response has cyclomatic complexity 35 (threshold 15). Of this number, 31 points are the body's 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.
  • dalfox::scanning::ast_dom_analysis::guards::regex_is_strict_allowlist (cyclomatic 34) src/scanning/ast_dom_analysis/guards.rs:56 — 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.
  • dalfox::scanning::param_jobs::generate_param_jobs (cyclomatic 33) src/scanning/param_jobs.rs:148 — 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.
  • dalfox::cmd::scan::output::render_results (cyclomatic 32) src/cmd/scan/output.rs:572 — 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.
  • dalfox::scanning::js_context_verify::check_marker_in_expression (cyclomatic 32) src/scanning/js_context_verify.rs:1272 — 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.
  • dalfox::parameter_analysis::xml_inject::parse_tag (cyclomatic 30) src/parameter_analysis/xml_inject.rs:196 — 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.
  • dalfox::scanning::check_dom_verification::classify_dom_evidence_in_xml (cyclomatic 30) src/scanning/check_dom_verification.rs:1029 — 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.
  • dalfox::scanning::url_inject::build_injected_url (cyclomatic 30) src/scanning/url_inject.rs:199 — 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.
  • dalfox::target_parser::postman::build_request (cyclomatic 30) src/target_parser/postman.rs:206 — 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.
  • dalfox::cmd::scan::poc::render_finding_block (cyclomatic 29) src/cmd/scan/poc.rs:561 — 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.
  • dalfox::cmd::scan::poc::generate_poc (cyclomatic 28) src/cmd/scan/poc.rs:42 — dalfox::cmd::scan::poc::generate_poc has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body's 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.
  • dalfox::scanning::ast_integration::has_self_bootstrap_verification_normalized (cyclomatic 28) src/scanning/ast_integration.rs:1050 — 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.
  • + 45 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Hotspot · ×46
  • Hotspot: src/cmd/scan/mod.rs src/cmd/scan/mod.rs:262 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/ast_dom_analysis/sinks.rs src/scanning/ast_dom_analysis/sinks.rs:9 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_dom_analysis/sinks.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/ast_dom_analysis/taint.rs src/scanning/ast_dom_analysis/taint.rs:42 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_dom_analysis/taint.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/job/runner.rs src/job/runner.rs:360 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/job/runner.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/parameter_analysis/mod.rs src/parameter_analysis/mod.rs:1005 — 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 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/parameter_analysis/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/job/mod.rs src/job/mod.rs:562 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/job/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/cmd/scan/input.rs src/cmd/scan/input.rs:167 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/input.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/ast_dom_analysis/walk.rs src/scanning/ast_dom_analysis/walk.rs:17 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_dom_analysis/walk.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/parameter_analysis/discovery/form.rs src/parameter_analysis/discovery/form.rs:19 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/parameter_analysis/discovery/form.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/check_reflection.rs src/scanning/check_reflection.rs:2732 — 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 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/check_reflection.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/js_context_verify.rs src/scanning/js_context_verify.rs:816 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/js_context_verify.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/ast_dom_analysis/bindings.rs src/scanning/ast_dom_analysis/bindings.rs:15 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_dom_analysis/bindings.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/mod.rs src/scanning/mod.rs:1040 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/cmd/scan/output.rs src/cmd/scan/output.rs:572 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/output.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/check_dom_verification.rs src/scanning/check_dom_verification.rs:1029 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/check_dom_verification.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/cmd/scan/analysis.rs src/cmd/scan/analysis.rs:322 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/analysis.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/target_parser/mod.rs src/target_parser/mod.rs:726 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/target_parser/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/url_inject.rs src/scanning/url_inject.rs:199 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/url_inject.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/mcp/mod.rs src/mcp/mod.rs:289 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/mcp/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/result/format_markdown.rs src/scanning/result/format_markdown.rs:95 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/result/format_markdown.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/xss_common.rs src/scanning/xss_common.rs:65 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/xss_common.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/ast_integration.rs src/scanning/ast_integration.rs:165 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_integration.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/cmd/scan/scan_loop.rs src/cmd/scan/scan_loop.rs:407 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/scan_loop.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/cmd/scan/poc.rs src/cmd/scan/poc.rs:561 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/poc.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/scanning/ast_dom_phase.rs src/scanning/ast_dom_phase.rs:33 — 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_dom_phase.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • + 21 more in this group — see findings.md.
D2 · Cognitive Complexity · DomXssVisitor · ×34
  • DomXssVisitor::walk_assignment_expression (cognitive 129) src/scanning/ast_dom_analysis/sinks.rs:9 — 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.
  • DomXssVisitor::call_taint_and_source (cognitive 127) src/scanning/ast_dom_analysis/taint.rs:42 — 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.
  • DomXssVisitor::handle_reflect_apply (cognitive 88) src/scanning/ast_dom_analysis/sinks.rs:1059 — 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 — 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's 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.
  • DomXssVisitor::bind_declarator_identifier (cognitive 87) src/scanning/ast_dom_analysis/bindings.rs:15 — 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.
  • DomXssVisitor::handle_member_method_sink (cognitive 84) src/scanning/ast_dom_analysis/sinks.rs:552 — 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 — 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's 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.
  • DomXssVisitor::walk_statement (cognitive 72) src/scanning/ast_dom_analysis/walk.rs:17 — 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.
  • DomXssVisitor::find_source_in_expr (cognitive 61) src/scanning/ast_dom_analysis/bindings.rs:354 — 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 — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • DomXssVisitor::handle_summary_and_sink_call (cognitive 56) src/scanning/ast_dom_analysis/sinks.rs:715 — 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.
  • DomXssVisitor::register_class_accessor_fields (cognitive 56) src/scanning/ast_dom_analysis/summaries.rs:602 — 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.
  • DomXssVisitor::handle_wrapper_invocation (cognitive 51) src/scanning/ast_dom_analysis/sinks.rs:938 — 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 — 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's 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.
  • DomXssVisitor::walk_expression (cognitive 51) src/scanning/ast_dom_analysis/walk.rs:622 — 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.
  • DomXssVisitor::walk_variable_declarator (cognitive 44) src/scanning/ast_dom_analysis/walk.rs:530 — 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 — 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's 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.
  • DomXssVisitor::propagate_mutation_taint (cognitive 37) src/scanning/ast_dom_analysis/sinks.rs:866 — 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 — 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's 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.
  • DomXssVisitor::register_function_summary (cognitive 37) src/scanning/ast_dom_analysis/summaries.rs:98 — 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.
  • DomXssVisitor::collect_declared_names (cognitive 35) src/scanning/ast_dom_analysis/walk.rs:995 — 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.
  • DomXssVisitor::promise_kind_of_call (cognitive 28) src/scanning/ast_dom_analysis/async_flow.rs:193 — 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.
  • DomXssVisitor::resolve_apply_argument_taint_at (cognitive 27) src/scanning/ast_dom_analysis/bound_calls.rs:93 — 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.
  • DomXssVisitor::handle_object_assign_sink (cognitive 27) src/scanning/ast_dom_analysis/sinks.rs:1418 — 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.
  • DomXssVisitor::walk_call_expression (cognitive 26) src/scanning/ast_dom_analysis/sinks.rs:1540 — 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 — checks laid out side by side rather than stacked — 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.
  • DomXssVisitor::register_module_exports (cognitive 26) src/scanning/ast_dom_analysis/walk.rs:398 — 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.
  • DomXssVisitor::walk_function_scope (cognitive 24) src/scanning/ast_dom_analysis/walk.rs:838 — 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.
  • DomXssVisitor::static_member_is_tainted (cognitive 23) src/scanning/ast_dom_analysis/taint.rs:684 — 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 — 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.
  • DomXssVisitor::untaint (cognitive 22) src/scanning/ast_dom_analysis/guards.rs:440 — 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.
  • DomXssVisitor::concat_parts (cognitive 21) src/scanning/ast_dom_analysis/url_lead.rs:152 — 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.
  • DomXssVisitor::resolve_wrapper_param_argument_taint (cognitive 19) src/scanning/ast_dom_analysis/bound_calls.rs:179 — 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.
  • + 9 more in this group — see findings.md.
D1 · Cyclomatic Complexity · DomXssVisitor · ×27
  • DomXssVisitor::call_taint_and_source (cyclomatic 89) src/scanning/ast_dom_analysis/taint.rs:42 — 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.
  • DomXssVisitor::walk_assignment_expression (cyclomatic 78) src/scanning/ast_dom_analysis/sinks.rs:9 — 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.
  • DomXssVisitor::bind_declarator_identifier (cyclomatic 63) src/scanning/ast_dom_analysis/bindings.rs:15 — 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.
  • DomXssVisitor::walk_statement (cyclomatic 54) src/scanning/ast_dom_analysis/walk.rs:17 — 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.
  • DomXssVisitor::find_source_in_expr (cyclomatic 44) src/scanning/ast_dom_analysis/bindings.rs:354 — 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.
  • DomXssVisitor::walk_expression (cyclomatic 44) src/scanning/ast_dom_analysis/walk.rs:622 — 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.
  • DomXssVisitor::handle_member_method_sink (cyclomatic 39) src/scanning/ast_dom_analysis/sinks.rs:552 — 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.
  • DomXssVisitor::is_tainted (cyclomatic 30) src/scanning/ast_dom_analysis/taint.rs:840 — 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 — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • DomXssVisitor::handle_summary_and_sink_call (cyclomatic 29) src/scanning/ast_dom_analysis/sinks.rs:715 — 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.
  • DomXssVisitor::handle_reflect_apply (cyclomatic 29) src/scanning/ast_dom_analysis/sinks.rs:1059 — 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.
  • DomXssVisitor::register_function_summary (cyclomatic 28) src/scanning/ast_dom_analysis/summaries.rs:98 — 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.
  • DomXssVisitor::collect_declared_names (cyclomatic 25) src/scanning/ast_dom_analysis/walk.rs:995 — 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.
  • DomXssVisitor::static_member_is_tainted (cyclomatic 23) src/scanning/ast_dom_analysis/taint.rs:684 — 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.
  • DomXssVisitor::handle_wrapper_invocation (cyclomatic 22) src/scanning/ast_dom_analysis/sinks.rs:938 — 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.
  • DomXssVisitor::walk_call_expression (cyclomatic 22) src/scanning/ast_dom_analysis/sinks.rs:1540 — 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.
  • DomXssVisitor::walk_variable_declarator (cyclomatic 20) src/scanning/ast_dom_analysis/walk.rs:530 — 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.
  • DomXssVisitor::walk_function_scope (cyclomatic 20) src/scanning/ast_dom_analysis/walk.rs:838 — 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.
  • DomXssVisitor::register_class_accessor_fields (cyclomatic 19) src/scanning/ast_dom_analysis/summaries.rs:602 — 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.
  • DomXssVisitor::register_module_exports (cyclomatic 18) src/scanning/ast_dom_analysis/walk.rs:398 — 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 — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • DomXssVisitor::promise_kind_of_call (cyclomatic 17) src/scanning/ast_dom_analysis/async_flow.rs:193 — 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.
  • DomXssVisitor::propagate_mutation_taint (cyclomatic 17) src/scanning/ast_dom_analysis/sinks.rs:866 — 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.
  • DomXssVisitor::url_part_lead (cyclomatic 17) src/scanning/ast_dom_analysis/url_lead.rs:199 — 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 — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • DomXssVisitor::static_member_source (cyclomatic 16) src/scanning/ast_dom_analysis/bindings.rs:563 — 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.
  • DomXssVisitor::message_event_source_for_receiver (cyclomatic 16) src/scanning/ast_dom_analysis/events.rs:165 — 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 — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • DomXssVisitor::collect_guards (cyclomatic 16) src/scanning/ast_dom_analysis/guards.rs:162 — 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 — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • + 2 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Repeated repair · ×11
  • Repeated repair: src/utils/http.rs src/utils/http.rs:842 — 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's 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 × complexity hotspot — 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: “fix(scan): fetch the whole landing page when preflight's Range was honoured (#1711)”; “fix: pre-3.3.0 review of features since v3.2.4 (#1686)”; “fix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)”; “fix: bug hunt 2026-10-09 — 68 verified crash / silent-clean / hostile-input fixes (#1529)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/utils/http.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/server/util.rs src/server/util.rs:196 — 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's 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 × complexity hotspot — 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: “fix: pre-3.3.0 review of features since v3.2.4 (#1686)”; “fix(mcp): label target-derived output, bound result pages, validate blind/remote inputs (#1424)”; “fix(server): anchor origin patterns, and harden the API's secret handling (#1423)”; “fix(server,mcp): don't free a capacity slot while the worker runs on (#1417)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/server/util.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/server/job_runner.rs src/server/job_runner.rs:192 — 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's 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 × complexity hotspot — 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: “fix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)”; “fix: bug hunt 2026-10-09 — 68 verified crash / silent-clean / hostile-input fixes (#1529)”; “fix(jobs): align reachability probes with CLI (#1491)”; “fix(cli): honor --json on the payload summary, and config no_color on the banner (#1421)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/server/job_runner.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/scanning/ast_dom_analysis/resolve.rs src/scanning/ast_dom_analysis/resolve.rs:154 — 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's 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 × complexity hotspot — 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: “fix(ast): cut DOM-XSS false positives and close recall gaps in the static analyzer (#1692)”; “fix(ast): track private fields, bound callbacks, call-site defaults, and currentScript.src (#1552)”; “fix(ast): walk class bodies, scope this per object, track parameter defaults and getters (#1545)”; “fix(ast): track common real-world DOM-XSS shapes the taint walk missed (#1544)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_dom_analysis/resolve.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/cmd/scan/state_file.rs src/cmd/scan/state_file.rs:695 — 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's 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 × complexity hotspot — 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: “fix: review pass on v3.2.4→main features (OOB/session parity, confidence cap, filter fingerprint, spec import) (#1558)”; “fix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)”; “fix: bug hunt 2026-10-09 — 68 verified crash / silent-clean / hostile-input fixes (#1529)”; “fix: multi-policy CSP, quoted '>' in script tags, template-literal delimiter, credential-rotation resume, assigned-over parseInt (#1486)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/state_file.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/scanning/waf_strategy.rs src/scanning/waf_strategy.rs:200 — 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's 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 × complexity hotspot — 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: “fix: multi-policy CSP, quoted '>' in script tags, template-literal delimiter, credential-rotation resume, assigned-over parseInt (#1486)”; “fix(scanner): preserve payload selection and valid WAF variants (#1490)”; “fix: CSP meta/report-only precedence and WAF status misdetection (#1481)”; “fix: bug-hunt batch — blind XSS request builders, batch-mining attribution, server/MCP parity, and CLI silent-clean holes (#1476)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/waf_strategy.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/target_parser/har.rs src/target_parser/har.rs:120 — 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's 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 × complexity hotspot — 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: “fix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)”; “fix: bug hunt 2026-10-09 — 68 verified crash / silent-clean / hostile-input fixes (#1529)”; “fix(target_parser): drop unsendable headers on raw-http/HAR import (#1405)”; “fix(scan,server): harden request construction and input validation (#1404)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/target_parser/har.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/cmd/scan/postprocess.rs src/cmd/scan/postprocess.rs:37 — 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's 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 × complexity hotspot — 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: “fix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)”; “fix: bug hunt 2026-10-09 — 68 verified crash / silent-clean / hostile-input fixes (#1529)”; “fix: HPP form-action/pre-encoding drift and streamed AST duplicates (#1488)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/cmd/scan/postprocess.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/payload/remote.rs src/payload/remote.rs:225 — 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's 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 × complexity hotspot — 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: “fix: bug hunt 2026-10-09 — 68 verified crash / silent-clean / hostile-input fixes (#1529)”; “fix: bug-hunt batch — blind XSS request builders, batch-mining attribution, server/MCP parity, and CLI silent-clean holes (#1476)”; “fix(server,mcp,payload): daemon-lifecycle defects — preflight pacing, per-job remote cache, draining-job retention, MCP capacity slot (#1406)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/payload/remote.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/lib.rs src/lib.rs:229 — 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's 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 × complexity hotspot — 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: “fix(http): honor request pacing and user-agent overrides (#1487)”; “fix: six defects found reviewing the 2026-09-02 merges (#1405-#1424) (#1425)”; “fix(scan): count requests that never reached the target (#1413)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/scanning/ast_dom_analysis/reflected_markup.rs src/scanning/ast_dom_analysis/reflected_markup.rs:261 — 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's 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 × complexity hotspot — 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: “fix(ast): cut DOM-XSS false positives and close recall gaps in the static analyzer (#1692)”; “fix(ast): track private fields, bound callbacks, call-site defaults, and currentScript.src (#1552)”; “fix: multi-round bug hunt (limit accounting, silent-clean holes, cancellation, spec import, AST FPs) (#1530)”. 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 `git log --since='2026-08-16 23:41:40 +09:00' --until='2026-11-14 23:41:40 +09:00' --full-history --no-merges -- src/scanning/ast_dom_analysis/reflected_markup.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×9
  • Duplicated block (8 lines × 2) src/cmd/scan/startup.rs:378 — src/cmd/scan/startup.rs:378-385 | src/job/runner.rs:478-485 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) src/encoding/pipeline.rs:220 — src/encoding/pipeline.rs:220-227 | src/encoding/pipeline.rs:278-285 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/encoding/pipeline.rs:220` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — 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' 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 — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's 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.
  • Duplicated block (8 lines × 2) src/scanning/js_context_verify.rs:582 — src/scanning/js_context_verify.rs:582-589 | src/scanning/js_context_verify.rs:1393-1400 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/js_context_verify.rs:582` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) src/scanning/js_context_verify.rs:839 — src/scanning/js_context_verify.rs:839-846 | src/scanning/js_context_verify.rs:877-884 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/js_context_verify.rs:839` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) src/utils/xml.rs:458 — src/utils/xml.rs:458-465 | src/utils/xml.rs:586-593 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) src/cmd/scan/analysis.rs:485 — src/cmd/scan/analysis.rs:485-492 | src/parameter_analysis/mod.rs:1533-1540 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) src/parameter_analysis/mining/context_detect.rs:5 — src/parameter_analysis/mining/context_detect.rs:5-17 | src/scanning/js_context_verify.rs:1454-1461 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) src/oob/interactsh/mod.rs:180 — src/oob/interactsh/mod.rs:180-187 | src/oob/interactsh/mod.rs:285-292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/oob/interactsh/mod.rs:180` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) src/waf/bypass/mutate.rs:154 — src/waf/bypass/mutate.rs:154-161 | src/waf/bypass/mutate.rs:768-775 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/waf/bypass/mutate.rs:154` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D2 · Cognitive Complexity · ScanWorkerCtx · ×6
  • ScanWorkerCtx::run_dom_phase (cognitive 44) src/scanning/mod.rs:1591 — 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.
  • ScanWorkerCtx::run_reflection_phase (cognitive 30) src/scanning/mod.rs:1040 — 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.
  • ScanWorkerCtx::process_reflection_result (cognitive 29) src/scanning/mod.rs:1324 — 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.
  • ScanWorkerCtx::probe_param (cognitive 24) src/scanning/mod.rs:898 — 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.
  • ScanWorkerCtx::run_hpp_phase (cognitive 23) src/scanning/mod.rs:1821 — 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.
  • ScanWorkerCtx::scan_param (cognitive 20) src/scanning/mod.rs:710 — 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 — checks laid out side by side rather than stacked — 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.
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×5
  • Duplicated block (10 lines × 2) src/parameter_analysis/discovery/cookie.rs:35 — src/parameter_analysis/discovery/cookie.rs:35-44 | src/parameter_analysis/discovery/header.rs:118-127 — 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 — a file they already depend on, or a new one alongside them — 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 `src/parameter_analysis/discovery/cookie.rs:35` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) src/scanning/js_context_verify.rs:945 — src/scanning/js_context_verify.rs:945-954 | src/scanning/js_context_verify.rs:963-972 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) src/waf/bypass/mutate.rs:644 — src/waf/bypass/mutate.rs:644-653 | src/waf/bypass/mutate.rs:783-792 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/waf/bypass/mutate.rs:644` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) src/parameter_analysis/discovery/form.rs:263 — src/parameter_analysis/discovery/form.rs:263-274 | src/parameter_analysis/discovery/form.rs:376-385 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/parameter_analysis/discovery/form.rs:263` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (10 lines × 2) src/parameter_analysis/mining/probe_graphql.rs:29 — src/parameter_analysis/mining/probe_graphql.rs:29-38 | src/parameter_analysis/mining/probe_xml.rs:44-53 — 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 — a file they already depend on, or a new one alongside them — 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 `src/parameter_analysis/mining/probe_graphql.rs:29` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/parameter_analysis/mining/probe_xml.rs:56` calls `xml_request_content_type` and `src/parameter_analysis/mining/probe_graphql.rs:42` does not — 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×5
  • Duplicated block (6 lines × 2) src/parameter_analysis/discovery/form.rs:119 — src/parameter_analysis/discovery/form.rs:119-124 | src/scanning/xss_blind.rs:462-467 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/parameter_analysis/discovery/form.rs:119` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) src/scanning/ast_dom_analysis/resolve.rs:47 — src/scanning/ast_dom_analysis/resolve.rs:47-52 | src/scanning/ast_dom_analysis/resolve.rs:135-140 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) src/utils/xml.rs:619 — src/utils/xml.rs:619-624 | src/utils/xml.rs:637-642 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/utils/xml.rs:619` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) src/utils/html.rs:198 — src/utils/html.rs:198-203 | src/utils/html.rs:274-279 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/utils/html.rs:198` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) src/utils/xml.rs:532 — src/utils/xml.rs:532-537 | src/utils/xml.rs:569-574 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/utils/xml.rs:532` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/utils/xml.rs:575` calls `get`, `Some`, `find_after` and `src/utils/xml.rs:538` does not — 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.
D1 · Cyclomatic Complexity · ScanWorkerCtx · ×4
  • ScanWorkerCtx::run_reflection_phase (cyclomatic 19) src/scanning/mod.rs:1040 — 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.
  • ScanWorkerCtx::run_dom_phase (cyclomatic 18) src/scanning/mod.rs:1591 — 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.
  • ScanWorkerCtx::scan_param (cyclomatic 16) src/scanning/mod.rs:710 — 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.
  • ScanWorkerCtx::probe_param (cyclomatic 16) src/scanning/mod.rs:898 — 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.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×4
  • Duplicated block (7 lines × 2) src/parameter_analysis/discovery/form.rs:110 — src/parameter_analysis/discovery/form.rs:110-116 | src/scanning/xss_blind.rs:453-459 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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.
  • Duplicated block (7 lines × 2) src/parameter_analysis/mining/context_detect.rs:219 — src/parameter_analysis/mining/context_detect.rs:219-225 | src/parameter_analysis/mining/context_detect.rs:234-240 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/parameter_analysis/mining/context_detect.rs:219` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) src/scanning/url_inject.rs:565 — src/scanning/url_inject.rs:565-571 | src/scanning/xss_blind.rs:273-279 — 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 — a file they already depend on, or a new one alongside them — 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 `src/scanning/url_inject.rs:565` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) src/parameter_analysis/discovery/query.rs:48 — src/parameter_analysis/discovery/query.rs:48-57 | src/parameter_analysis/discovery/query.rs:254-260 — both copies are in the same file, so extract the block into one function there and call it from each site — 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.
D31 · IaC & Container Security · Medium IaC · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×3
  • Change coupling: mod.rs ↔ job_runner.rs src/mcp/mod.rs:1 — `src/mcp/mod.rs` and `src/server/job_runner.rs` 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 — 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 — 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 — the registration is the link, and it is meant not to be an import — 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 `f57533e3` fix(jobs): align reachability probes with CLI (#1491); `676f492d` fix(server,mcp): run the remote payload fetch inside the scan budget …; `8617b5ab` fix(server,mcp): stop silently discarding proxy/callback_url and corr… — run `git show` on any of them.
  • Change coupling: mod.rs ↔ handlers.rs src/mcp/mod.rs:1 — `src/mcp/mod.rs` and `src/server/handlers.rs` 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 — 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 — 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 — the registration is the link, and it is meant not to be an import — 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 `1867a145` feat(server,mcp): blind OOB and session-loss parity with the CLI (#1524); `f57533e3` fix(jobs): align reachability probes with CLI (#1491); `6a0fbcbc` fix: six defects found reviewing the 2026-09-02 merges (#1405-#1424) … — run `git show` on any of them.
  • Change coupling: tests.rs ↔ tests.rs src/scanning/check_dom_verification/tests.rs:1 — `src/scanning/check_dom_verification/tests.rs` and `src/scanning/js_context_verify/tests.rs` 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 — 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 — 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 — the registration is the link, and it is meant not to be an import — 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 `2a0ef1a7` fix(dom-verify): false [V] on inert JS-string / data-block reflection…; `247cdeae` test(scanner): shared reflect(payload, Transform) fixtures + DOM-evid…; `c797e0c5` fix(scanner): parse-DoS hardening + XSS false-negative & WAF/lifecycl… — run `git show` on any of them.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×3
  • Duplicated block (12 lines × 2) src/cmd/scan/output.rs:301 — src/cmd/scan/output.rs:301-312 | src/cmd/scan/output.rs:322-333 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) src/utils/fs.rs:73 — src/utils/fs.rs:73-84 | src/utils/fs.rs:122-133 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/utils/fs.rs:73` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
  • Duplicated block (12 lines × 2) src/waf/bypass/mutate.rs:68 — src/waf/bypass/mutate.rs:68-79 | src/waf/bypass/mutate.rs:94-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/waf/bypass/mutate.rs:68` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×3
  • Duplicated block (11 lines × 2) src/scanning/ast_dom_analysis/sinks.rs:719 — src/scanning/ast_dom_analysis/sinks.rs:719-729 | src/scanning/ast_dom_analysis/taint.rs:219-229 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/scanning/ast_dom_analysis/sinks.rs:715` calls `pub`, `handle_summary_and_sink_call` and `src/scanning/ast_dom_analysis/taint.rs:216` does not — 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.
  • Duplicated block (11 lines × 2) src/scanning/check_reflection.rs:1521 — src/scanning/check_reflection.rs:1521-1531 | src/scanning/check_reflection.rs:1746-1757 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/check_reflection.rs:1521` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) src/scanning/js_context_verify.rs:609 — src/scanning/js_context_verify.rs:609-619 | src/scanning/js_context_verify.rs:622-632 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/js_context_verify.rs:609` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×3
  • Duplicated block (9 lines × 2) src/parameter_analysis/discovery/form.rs:455 — src/parameter_analysis/discovery/form.rs:455-463 | src/parameter_analysis/discovery/form.rs:532-540 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/parameter_analysis/discovery/form.rs:455` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) src/scanning/ast_dom_analysis/walk.rs:113 — src/scanning/ast_dom_analysis/walk.rs:113-121 | src/scanning/ast_dom_analysis/walk.rs:127-135 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/ast_dom_analysis/walk.rs:113` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) src/scanning/check_dom_verification.rs:767 — src/scanning/check_dom_verification.rs:767-775 | src/scanning/check_dom_verification.rs:812-820 — both copies are in the same file, so extract the block into one function there and call it from each site — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/scanning/check_dom_verification.rs:781` calls `insert`, `parse_document_bounded` and `src/scanning/check_dom_verification.rs:821` does not — 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.
D1 · Cyclomatic Complexity · Result · ×2
  • Result::results_to_markdown_with_meta (cyclomatic 35) src/scanning/result/format_markdown.rs:95 — 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.
  • Result::results_to_sarif_with_meta (cyclomatic 22) src/scanning/result/format_sarif.rs:24 — 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.
D2 · Cognitive Complexity · Result · ×2
  • Result::results_to_markdown_with_meta (cognitive 85) src/scanning/result/format_markdown.rs:95 — 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 — 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's 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.
  • Result::results_to_sarif_with_meta (cognitive 21) src/scanning/result/format_sarif.rs:24 — 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 — checks laid out side by side rather than stacked — 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.
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (18–19 lines × 2) · ×2
  • Duplicated block (18–19 lines × 2) src/parameter_analysis/mining/probe_body.rs:72 — src/parameter_analysis/mining/probe_body.rs:72-89 | src/parameter_analysis/mining/probe_json.rs:75-93 — before extracting anything, compare `src/parameter_analysis/mining/probe_body.rs` and `src/parameter_analysis/mining/probe_json.rs` 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 — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/parameter_analysis/mining/probe_body.rs:72` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/parameter_analysis/mining/probe_body.rs:71` calls `clone` and `src/parameter_analysis/mining/probe_json.rs:73` does not — 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.
  • Duplicated block (18–19 lines × 2) src/scanning/ast_dom_analysis/sinks.rs:949 — src/scanning/ast_dom_analysis/sinks.rs:949-966 | src/scanning/ast_dom_analysis/sinks.rs:1073-1091 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/ast_dom_analysis/sinks.rs:949` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 `self` to `super) fn handle_wrapper_invocation(&mut` in one and `super) fn handle_reflect_apply(&mut` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — 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.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×2
  • Duplicated block (15–16 lines × 2) src/parameter_analysis/mining/probe_graphql.rs:63 — src/parameter_analysis/mining/probe_graphql.rs:63-78 | src/parameter_analysis/mining/probe_xml.rs:86-100 — 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 — a file they already depend on, or a new one alongside them — 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 `src/parameter_analysis/mining/probe_graphql.rs:63` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (15–16 lines × 2) src/payload/xss_html.rs:108 — src/payload/xss_html.rs:108-122 | src/payload/xss_html.rs:151-166 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/payload/xss_html.rs:108` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×2
  • Duplicated block (14 lines × 2) src/parameter_analysis/mining/probe_body.rs:121 — src/parameter_analysis/mining/probe_body.rs:121-134 | src/parameter_analysis/mining/probe_json.rs:122-135 — before extracting anything, compare `src/parameter_analysis/mining/probe_body.rs` and `src/parameter_analysis/mining/probe_json.rs` 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 — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/parameter_analysis/mining/probe_body.rs:121` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) src/target_parser/openapi.rs:137 — src/target_parser/openapi.rs:137-150 | src/target_parser/postman.rs:109-122 — 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 — a file they already depend on, or a new one alongside them — 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 `src/target_parser/openapi.rs:137` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×2
  • Duplicated block (13 lines × 2) src/scanning/xss_common.rs:91 — src/scanning/xss_common.rs:91-107 | src/scanning/xss_common.rs:135-147 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/xss_common.rs:91` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) src/scanning/xss_blind.rs:345 — src/scanning/xss_blind.rs:345-357 | src/scanning/xss_blind.rs:558-570 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D8 · Code Coverage · Low coverage · ×2
  • Low coverage: src/main.rs src/main.rs:1 — 0.0% line coverage (0/205).
  • Low coverage: src/parameter_analysis/discovery/fragment.rs src/parameter_analysis/discovery/fragment.rs:1 — 12.9% line coverage (4/31).
D1 · Cyclomatic Complexity · ScanOptionChecks · ×1
  • ScanOptionChecks::validate (cyclomatic 38) src/job/mod.rs:562 — 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.
D1 · Cyclomatic Complexity · Sampler · ×1
  • Sampler::sample (cyclomatic 34) src/target_parser/openapi.rs:228 — 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 — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Op · ×1
  • Op::build (cyclomatic 29) src/target_parser/openapi.rs:379 — 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.
D1 · Cyclomatic Complexity · DalfoxMcp · ×1
  • DalfoxMcp::scan_with_dalfox (cyclomatic 17) src/mcp/mod.rs:289 — 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.
D17 · Explicit Debt · TodoComment · ×1
  • TodoComment src/parameter_analysis/mod.rs:495 — /// TODO: — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D2 · Cognitive Complexity · Op · ×1
  • Op::build (cognitive 46) src/target_parser/openapi.rs:379 — 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.
D2 · Cognitive Complexity · ScanOptionChecks · ×1
  • ScanOptionChecks::validate (cognitive 40) src/job/mod.rs:562 — 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 — checks laid out side by side rather than stacked — 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.
D2 · Cognitive Complexity · Sampler · ×1
  • Sampler::sample (cognitive 39) src/target_parser/openapi.rs:228 — 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.
D2 · Cognitive Complexity · DalfoxMcp · ×1
  • DalfoxMcp::scan_with_dalfox (cognitive 22) src/mcp/mod.rs:289 — 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.
D2 · Cognitive Complexity · RecoveredSourceIndex · ×1
  • RecoveredSourceIndex::build (cognitive 16) src/utils/xml.rs:67 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Medium vulnerability · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (67 shared lines) · ×1
  • Near-duplicate member pair (67 shared lines) src/parameter_analysis/mining/probe_body.rs:11 — src/parameter_analysis/mining/probe_body.rs:11-166 | src/parameter_analysis/mining/probe_json.rs:11-166 — 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' grain — 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.
D4 · Code Duplication · Edited copy of a member (75 corresponding lines) · ×1
  • Edited copy of a member (75 corresponding lines) src/parameter_analysis/mining/probe_graphql.rs:23 — src/parameter_analysis/mining/probe_graphql.rs:23-97 | src/parameter_analysis/mining/probe_xml.rs:35-119 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) src/scanning/check_dom_verification.rs:766 — src/scanning/check_dom_verification.rs:766-805 | src/scanning/check_dom_verification.rs:811-839 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (35 corresponding lines) · ×1
  • Edited copy of a member (35 corresponding lines) src/scanning/check_reflection.rs:622 — src/scanning/check_reflection.rs:622-661 | src/scanning/check_reflection.rs:742-776 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) src/utils/html.rs:196 — src/utils/html.rs:196-217 | src/utils/html.rs:271-295 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (41 corresponding lines) · ×1
  • Edited copy of a member (41 corresponding lines) src/payload/xss_html.rs:16 — src/payload/xss_html.rs:16-122 | src/payload/xss_html.rs:126-166 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) src/scanning/js_context_verify.rs:1079 — src/scanning/js_context_verify.rs:1079-1101 | src/scanning/js_context_verify.rs:1111-1129 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) src/scanning/check_reflection.rs:372 — src/scanning/check_reflection.rs:372-398 | src/scanning/check_reflection.rs:869-895 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×1
  • Edited copy of a member (16 corresponding lines) src/utils/xml.rs:616 — src/utils/xml.rs:616-631 | src/utils/xml.rs:633-651 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×1
  • Edited copy of a member (15 corresponding lines) src/scanning/js_context_verify.rs:432 — src/scanning/js_context_verify.rs:432-448 | src/scanning/js_context_verify.rs:450-464 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 12+ corresponding lines) src/waf/bypass/mutate.rs:226 — 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 — 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' 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.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×1
  • Edited copy of a member (13 corresponding lines) src/waf/bypass/mutate.rs:144 — src/waf/bypass/mutate.rs:144-161 | src/waf/bypass/mutate.rs:763-775 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) src/scanning/check_reflection.rs:476 — src/scanning/check_reflection.rs:476-499 | src/scanning/check_reflection.rs:1396-1418 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) src/scanning/ast_dom_analysis/taint.rs:377 — src/scanning/ast_dom_analysis/taint.rs:377-394 | src/scanning/ast_dom_analysis/taint.rs:407-420 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×1
  • Edited copy of a member (10 corresponding lines) src/cmd/scan/output.rs:993 — src/cmd/scan/output.rs:993-1003 | src/server/util.rs:181-190 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) src/encoding/mod.rs:184 — src/encoding/mod.rs:184-196 | src/encoding/mod.rs:213-224 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×1
  • Edited copy of a member (9 corresponding lines) src/parameter_analysis/mining/context_detect.rs:41 — src/parameter_analysis/mining/context_detect.rs:41-49 | src/parameter_analysis/mod.rs:453-461 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×1
  • Edited copy of a member (7 corresponding lines) src/parameter_analysis/discovery/mod.rs:30 — src/parameter_analysis/discovery/mod.rs:30-36 | src/parameter_analysis/mining/probe_response_id.rs:25-31 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) src/parameter_analysis/discovery/mod.rs:39 — src/parameter_analysis/discovery/mod.rs:39-44 | src/parameter_analysis/mining/probe_response_id.rs:35-43 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (5 corresponding lines) · ×1
  • Edited copy of a member (5 corresponding lines) src/payload/remote.rs:366 — src/payload/remote.rs:366-370 | src/payload/xss_csp_bypass.rs:508-514 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×1
  • Edited copy of a member (4 corresponding lines) src/scanning/js_context_verify.rs:242 — src/scanning/js_context_verify.rs:242-245 | src/target_parser/mod.rs:176-179 — 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 — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (22–26 lines × 2) · ×1
  • Duplicated block (22–26 lines × 2) src/scanning/check_dom_verification.rs:1215 — src/scanning/check_dom_verification.rs:1215-1236 | src/scanning/check_reflection.rs:2911-2936 — 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 — a file they already depend on, or a new one alongside them — 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 `src/scanning/check_dom_verification.rs:1215` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) src/parameter_analysis/mining/probe_body.rs:142 — src/parameter_analysis/mining/probe_body.rs:142-165 | src/parameter_analysis/mining/probe_json.rs:143-166 — before extracting anything, compare `src/parameter_analysis/mining/probe_body.rs` and `src/parameter_analysis/mining/probe_json.rs` 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 — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `src/parameter_analysis/mining/probe_body.rs:142` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) src/parameter_analysis/discovery/form.rs:467 — src/parameter_analysis/discovery/form.rs:467-488 | src/parameter_analysis/discovery/form.rs:544-565 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/parameter_analysis/discovery/form.rs:467` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (12–20 lines × 2) · ×1
  • Duplicated block (12–20 lines × 2) src/scanning/param_jobs.rs:287 — src/scanning/param_jobs.rs:287-306 | src/scanning/param_jobs.rs:332-343 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/param_jobs.rs:287` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) src/scanning/js_context_verify.rs:859 — src/scanning/js_context_verify.rs:859-875 | src/scanning/js_context_verify.rs:919-935 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/js_context_verify.rs:859` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1
  • Duplicated block (15 lines × 2) src/scanning/check_reflection.rs:220 — src/scanning/check_reflection.rs:220-234 | src/scanning/check_reflection.rs:876-890 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/check_reflection.rs:220` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1
  • Duplicated block (14 lines × 3) src/scanning/ast_dom_analysis/sinks.rs:812 — 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 — 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 — 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 `self` to `super) fn handle_summary_and_sink_call(&mut` in one and `super) fn handle_wrapper_invocation(&mut` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — 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.
D4 · Code Duplication · Duplicated block (12–14 lines × 2) · ×1
  • Duplicated block (12–14 lines × 2) src/server/handlers.rs:31 — src/server/handlers.rs:31-44 | src/server/handlers.rs:659-670 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/server/handlers.rs:31` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6–13 lines × 2) · ×1
  • Duplicated block (6–13 lines × 2) src/scanning/check_reflection.rs:2664 — src/scanning/check_reflection.rs:2664-2669 | src/scanning/check_reflection.rs:2754-2766 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (12–13 lines × 2) · ×1
  • Duplicated block (12–13 lines × 2) src/scanning/check_reflection.rs:2764 — src/scanning/check_reflection.rs:2764-2776 | src/scanning/check_reflection.rs:3273-3284 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/check_reflection.rs:2764` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8–12 lines × 3) · ×1
  • Duplicated block (8–12 lines × 3) src/scanning/check_dom_verification.rs:1224 — src/scanning/check_dom_verification.rs:1224-1235 | src/scanning/check_reflection.rs:2701-2708 | src/scanning/check_reflection.rs:2924-2935 — there are 3 copies across 2 file(s) — 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 `src/scanning/check_dom_verification.rs:1224` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×1
  • Duplicated block (11–12 lines × 2) src/parameter_analysis/mining/probe_body.rs:41 — src/parameter_analysis/mining/probe_body.rs:41-51 | src/parameter_analysis/mining/probe_json.rs:50-61 — before extracting anything, compare `src/parameter_analysis/mining/probe_body.rs` and `src/parameter_analysis/mining/probe_json.rs` 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 — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1
  • Duplicated block (11 lines × 3) src/scanning/js_context_verify.rs:841 — src/scanning/js_context_verify.rs:841-851 | src/scanning/js_context_verify.rs:863-873 | src/scanning/js_context_verify.rs:923-933 — 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 — 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 `src/scanning/js_context_verify.rs:841` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/scanning/js_context_verify.rs:853` calls `gather_arguments` and `src/scanning/js_context_verify.rs:874` does not — 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.
D4 · Code Duplication · Duplicated block (8–11 lines × 2) · ×1
  • Duplicated block (8–11 lines × 2) src/scanning/check_dom_verification.rs:1229 — src/scanning/check_dom_verification.rs:1229-1239 | src/scanning/light_verify.rs:33-40 — 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 — a file they already depend on, or a new one alongside them — 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 `src/scanning/check_dom_verification.rs:1229` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1
  • Duplicated block (10–11 lines × 2) src/scanning/payload_families.rs:503 — src/scanning/payload_families.rs:503-512 | src/scanning/payload_families.rs:541-551 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/payload_families.rs:503` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/scanning/payload_families.rs:502` calls `generate_dynamic_payloads` and `src/scanning/payload_families.rs:539` does not — 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.
D4 · Code Duplication · Duplicated block (9–10 lines × 3) · ×1
  • Duplicated block (9–10 lines × 3) src/parameter_analysis/discovery/form.rs:207 — src/parameter_analysis/discovery/form.rs:207-215 | src/parameter_analysis/discovery/form.rs:277-286 | src/parameter_analysis/discovery/form.rs:345-353 — 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 — 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 `src/parameter_analysis/discovery/form.rs:207` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1
  • Duplicated block (9–10 lines × 2) src/parameter_analysis/mod.rs:1024 — src/parameter_analysis/mod.rs:1024-1033 | src/parameter_analysis/mod.rs:1199-1207 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1
  • Duplicated block (9 lines × 3) src/parameter_analysis/discovery/form.rs:382 — src/parameter_analysis/discovery/form.rs:382-390 | src/parameter_analysis/discovery/form.rs:474-482 | src/parameter_analysis/discovery/form.rs:551-559 — 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 — 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 `src/parameter_analysis/discovery/form.rs:382` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/parameter_analysis/discovery/form.rs:391` calls `of` and `src/parameter_analysis/discovery/form.rs:483` does not — 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.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) src/scanning/ast_dom_analysis/taint.rs:184 — src/scanning/ast_dom_analysis/taint.rs:184-190 | src/scanning/ast_dom_analysis/taint.rs:231-238 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/scanning/ast_dom_analysis/taint.rs:184` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×1
  • Duplicated block (7 lines × 3) src/cmd/scan/input.rs:689 — src/cmd/scan/input.rs:689-695 | src/cmd/scan/input.rs:1280-1286 | src/job/runner.rs:46-52 — there are 3 copies across 2 file(s) — 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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) src/scanning/ast_dom_analysis/taint.rs:147 — 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 — 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 — 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 `src/scanning/ast_dom_analysis/taint.rs:147` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (3–6 lines × 4) · ×1
  • Duplicated block (3–6 lines × 4) src/parameter_analysis/discovery/query.rs:151 — 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 — 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 — 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 `src/parameter_analysis/discovery/query.rs:151` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/parameter_analysis/discovery/query.rs:150` calls `build_request`, `clone`, `Some` and `src/parameter_analysis/discovery/query.rs:262` does not — 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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) src/oob/interactsh/mod.rs:185 — src/oob/interactsh/mod.rs:185-189 | src/oob/interactsh/mod.rs:228-232 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/oob/interactsh/mod.rs:185` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
P12 · CI test-gate honesty · Coverage collected but not gated · ×1
  • Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's 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's CI files AND its coverage configuration — 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 — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
Minor — 33 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×14
  • Duplicated predicate src/cmd/scan/startup.rs:378 — `!args.remote_payloads.is_empty() || !args.remote_wordlists_in_use().is_empty()` appears character-identically in 2 files — src/cmd/scan/startup.rs, src/job/runner.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/target_parser/openapi/tests.rs:647 — `!out.skipped.is_empty() && out.skipped.len() <= super::super::MAX_SKIP_REASONS` appears character-identically in 2 files — src/target_parser/openapi/tests.rs, src/target_parser/postman/tests.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/scanning/url_inject.rs:40 — `bytes[idx] == b'%' && idx + 2 < bytes.len() && bytes[idx + 1].is_ascii_hexdigit() && bytes[idx + 2].is_ascii_hexdigit()` appears character-identically in 2 files — src/scanning/url_inject.rs, src/scanning/url_inject/tests.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/scanning/check_reflection.rs:1369 — `end < bytes.len() && (bytes[end].is_ascii_alphanumeric() || bytes[end] == b'-')` appears character-identically in 2 files — src/scanning/check_reflection.rs, src/utils/html.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/job/tests.rs:1176 — `err.contains("blind") && err.contains("http")` appears character-identically in 2 files — src/job/tests.rs, src/server/tests.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/parameter_analysis/mining/context_detect.rs:418 — `j < bytes.len() && bytes[j].is_ascii_whitespace()` appears character-identically in 2 files — src/parameter_analysis/mining/context_detect.rs, src/scanning/ast_dom_analysis/mod.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/parameter_analysis/mining/context_detect.rs:329 — `marker.is_empty() || !text.contains(marker)` appears character-identically in 2 files — src/parameter_analysis/mining/context_detect.rs, src/scanning/js_context_verify.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/target_parser/openapi.rs:100 — `out.targets.len() >= super::MAX_IMPORT_TARGETS || budget == 0` appears character-identically in 2 files — src/target_parser/openapi.rs, src/target_parser/postman.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/scanning/param_jobs.rs:204 — `param.invalid_specials.is_some() || param.valid_specials.is_some()` appears character-identically in 2 files — src/scanning/param_jobs.rs, src/scanning/payload_families.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/scanning/ast_dom_analysis/sinks.rs:205 — `self.tainted_vars.contains(name) || self.global_taints.contains(name)` appears character-identically in 3 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/scanning/ast_dom_analysis/script_element.rs:31 — `t.expressions.is_empty() && t.quasis.len() == 1` appears character-identically in 2 files — src/scanning/ast_dom_analysis/script_element.rs, src/scanning/ast_dom_analysis/sources.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/scanning/ast_dom_analysis/mod.rs:770 — `target != sink && target.starts_with("on")` appears character-identically in 2 files — src/scanning/ast_dom_analysis/mod.rs, src/scanning/ast_integration.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/mcp/mod.rs:176 — `target.insecure && target.url.scheme().eq_ignore_ascii_case("https")` appears character-identically in 2 files — src/mcp/mod.rs, src/server/job_runner.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/scanning/ast_dom_analysis/sinks.rs:944 — `wrapper_name == "call" || wrapper_name == "apply"` appears character-identically in 2 files — src/scanning/ast_dom_analysis/sinks.rs, src/scanning/ast_dom_analysis/taint.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X7 · Silent fallback defaults · Silent fallback default on Err · ×7
  • Silent fallback default on Err src/scanning/result/format_sarif.rs:193 — `results_to_sarif_with_meta` turns every `Err` into `"{}".to_string()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.
  • Silent fallback default on Err src/scanning/result/format_toml.rs:35 — `results_to_toml_with_meta` turns every `Err` into `"".to_string()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.
  • Silent fallback default on Err src/encoding/pipeline.rs:219 — `infer_base64_json` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.
  • Silent fallback default on Err src/encoding/pipeline.rs:277 — `infer_jwt` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.
  • Silent fallback default on Err src/scanning/ast_integration.rs:1214 — `analyze_javascript_for_dom_xss_with_html_context` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.
  • Silent fallback default on Err src/scanning/check_dom_verification.rs:1561 — `check_dom_verification_with_evidence` turns every `Err` into `DomVerifyEvidenceOutcome::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.
  • Silent fallback default on Err src/scanning/vuln_libs.rs:427 — `parse_version` turns every `Err` into `0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.
X9 · Subsumed condition operand · Subsumed condition operand · ×3
  • Subsumed condition operand src/waf/bypass/mutate.rs:411 — `payload.contains("<img")` can never decide this `||` — every value satisfying `payload.contains("<img")` also satisfies `payload.contains("<im")`, so the `||` 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.
  • Subsumed condition operand src/scanning/ast_integration.rs:954 — `source.contains("SharedWorker.message")` can never decide this `||` — every value satisfying `source.contains("SharedWorker.message")` also satisfies `source.contains("Worker.message")`, so the `||` 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.
  • Subsumed condition operand src/scanning/ast_integration.rs:1158 — `source.contains("SharedWorker.message")` can never decide this `||` — every value satisfying `source.contains("SharedWorker.message")` also satisfies `source.contains("Worker.message")`, so the `||` 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.
C2 · Access Controls · No named authorization policies · ×1
  • No named authorization policies — Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
C2 · Access Controls · Thin authorization enforcement · ×1
  • Thin authorization enforcement — Only 2 place(s) refuse an unauthorized caller — too few to demonstrate default-deny across handlers.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found src/main.rs:1 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` 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 (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — 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 `docs/adr/`. ADRs are expected here because `src/main.rs` makes this repository a deployable product (line 1).
D30 · Dependency Vulnerabilities · Medium CVE · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.
M4 · Documentation accuracy · README/code drift · ×1
  • README/code drift README.md:114 — README.md links to `docs/static/images/illust2.webp`, but `docs/static/images/illust2.webp` 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' 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.
S1 · Web-Security Posture · No app-layer HTTPS enforcement detected · ×1
  • No app-layer HTTPS enforcement detected — This repository starts an HTTP server and nothing in its Rust source or committed `Rocket.toml` secures the transport: no TLS served (actix-web `bind_rustls`/`bind_openssl`, axum-server `bind_rustls` with a `RustlsConfig`, tonic `ServerTlsConfig`, a `TlsAcceptor`, Rocket's `[default.tls]`), no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: `axum::serve(` (src/server/mod.rs:357).
S1 · Web-Security Posture · Security headers incomplete · ×1
  • Security headers incomplete — Set: Content-Security-Policy, X-Content-Type-Options. Missing: Strict-Transport-Security, X-Frame-Options — the four headers that carry the points of this card's security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each.(−1.0 on this card.) The server: `axum::serve(` (src/server/mod.rs:357).
Minor — 7 finding(s)
D12 · Dependency Hygiene · Outdated · ×7
  • Outdated: clap — `clap` is locked at 4.6.3 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.0"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
  • Outdated: clap_complete — `clap_complete` is locked at 4.6.9 but 4.6.11 is the current stable release on crates.io, and it already satisfies the `"4"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap_complete` and commit the updated REDACTED.
  • Outdated: clap_mangen — `clap_mangen` is locked at 0.3.1 but 0.3.3 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap_mangen` and commit the updated REDACTED.
  • Outdated: rmcp — `rmcp` is locked at 3.8.0 but 3.10.0 is the current stable release on crates.io, and it already satisfies the `"3.0.1"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p rmcp` and commit the updated REDACTED.
  • Outdated: serde-saphyr — `serde-saphyr` is locked at 2.0.0 but 2.1.1 is the current stable release on crates.io, and it already satisfies the `"2.0"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde-saphyr` and commit the updated REDACTED.
  • Outdated: toml — `toml` is locked at 1.2.0+spec-1.1.0 but 1.2.1+spec-1.1.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p toml` and commit the updated REDACTED.
  • Outdated: uuid — `uuid` is locked at 1.29.0 but 1.29.2 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p uuid` and commit the updated REDACTED.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-85c5fc37bbe34489814c4fd63259e992/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-85c5fc37bbe34489814c4fd63259e992/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude .cargo --exclude docs --exclude packaging --exclude scripts/fixtures --exclude skills --exclude snap --exclude tests/fixtures --exclude tests/functional/mock_cases .87artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .2artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .3artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1db78-edaa-7d0a-bbca-749f077fdce6 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md