Public report of x-nas/WinsockPacketEditor, published 16 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 reportMeasured 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, 16 November 2026, 18:10 UTC · Survey ID cd_b96bf11cdb9f44a789b34a67e72dc554
x-nas/WinsockPacketEditor
Measured 16 November 2026, 18:09 UTC, at code version 14ff12f
Code coverage is not measured: Suite not runnable in-image.
Test reliability is not measured: No test run produced results.
Boundary Type-Coupling is not measured: Bounded contexts not declared.
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
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: 100,065 lines of product code in 7 projects, tests not counted · Estimated rebuild effort: about 8.1 person-years · Weakest lens: Security and Compliance, 18.4
Findings by how serious they are
68 critical803 serious70 minor
6 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
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 18:09 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 ▸
69of 69 dimensions measured by tools.
929of 941 findings point to an exact file and line, so you can open each one in the code. The other 12 concern the repository as a whole, such as missing documentation.
69dimensions across 6 lenses, read from 100,065 lines of product code in 7 projects.
x-nas/WinsockPacketEditor falls short of our standard for production, in part because we found no access checks on the code's endpoints or handlers. It scores 29.3 out of 100 and is rated Weak, and six of its 68 critical findings are security problems.
Security and Compliance, at 18.4, is the weakest lens and counts most in the score. The best first steps are adding access checks and hashing passwords properly, each worth about 8.1 points. Raising Security and Compliance to 70 would lift the score to about 39.4.
Three known security holes in the packages the code depends on can be used by attackers. One weakness in the code could be used by an attacker, and fifty-four errors are caught and ignored, so failures can go unnoticed. Updating the vulnerable packages, fixing the weaknesses the scanner points to and handling or logging the ignored errors would close these risks. Loading the key from a secret store instead of the code would fix the encryption key written into the code, and hashing passwords with a password-hashing function such as Argon2, bcrypt or PBKDF2 would deal with the place where passwords are scrambled with a fast general-purpose hash. The seven data fields that are written but never read need removing.
The product code is 100,065 lines, about €1,200,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 forThe 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.
If Security and Compliance rose from 18.4 to 70, the lowest score rated Strong, the score would rise from 29.3 to about 39.4.
Code composition: what the lines of code are
Business logic 57%Supporting code 33%Tests 10%Generated by tools 0%
Rebuild cost: about €1,200,000 · Estimate
Cost to rebuild
€380,000 to €2,000,000, for 6,301 to 20,759 hours of work, about 8.1 person-years for 4 to 16 engineers
Difficulty of the problem
High, 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.7 at a score of 29. 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.
Size
Large: 100,065 lines of product code
Comment lines
The estimate prices 92,544 lines. Comment lines count towards the size of 100,065 lines but aren't priced as work.
What it is not
Not 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.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler.
Raises the score by about 8.1 points · Medium effort · Access Controls
2
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`.
(A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `REDACTED:1339`.
Resolve the 7 WriteOnlyPrivateField finding(s) in Explicit Debt — start with WpeCore.cs (4), ShellLink.cs (3).
Raises the score by about 2.1 points · Low effort · Explicit Debt
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 €1,200,000 to build again, about 8.1 person-years of work. Its weakest lens is Security and Compliance, at 18.4 (Critical). 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
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler. Of all the actions in this report, it raises the score most for the work it takes: about 8.1 points for medium effort. 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 4.9 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 8% to 18% on every change. The history of the code shows how much it changes: about 159,055 lines over the last 90 days, which is about 645,056 lines a year. At that pace, the extra work comes to an estimated 126.7 to 760 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 — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
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.
36 modules, with 18 dependencies between them. Every module uses only modules listed above it, so there are no loops.
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.
WinsockPacketEditor.Ipc uses WinsockPacketEditor, so a change to WinsockPacketEditor can break WinsockPacketEditor.Ipc, while a change to WinsockPacketEditor.Ipc can't break WinsockPacketEditor.
Position
Below the diagonal: WinsockPacketEditor.Ipc uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.Mcp uses WinsockPacketEditor, so a change to WinsockPacketEditor can break WinsockPacketEditor.Mcp, while a change to WinsockPacketEditor.Mcp can't break WinsockPacketEditor.
Position
Below the diagonal: WinsockPacketEditor.Mcp uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src uses WinsockPacketEditor.WebUI.src.diff, so a change to WinsockPacketEditor.WebUI.src.diff can break WinsockPacketEditor.WebUI.src, while a change to WinsockPacketEditor.WebUI.src can't break WinsockPacketEditor.WebUI.src.diff.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src uses WinsockPacketEditor.WebUI.src.i18n.langs, so a change to WinsockPacketEditor.WebUI.src.i18n.langs can break WinsockPacketEditor.WebUI.src, while a change to WinsockPacketEditor.WebUI.src can't break WinsockPacketEditor.WebUI.src.i18n.langs.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src uses WinsockPacketEditor.WebUI.src.usePick, so a change to WinsockPacketEditor.WebUI.src.usePick can break WinsockPacketEditor.WebUI.src, while a change to WinsockPacketEditor.WebUI.src can't break WinsockPacketEditor.WebUI.src.usePick.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src uses WinsockPacketEditor.WebUI.src.useSort, so a change to WinsockPacketEditor.WebUI.src.useSort can break WinsockPacketEditor.WebUI.src, while a change to WinsockPacketEditor.WebUI.src can't break WinsockPacketEditor.WebUI.src.useSort.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.components.decoder uses WinsockPacketEditor.WebUI.src.components.menu, so a change to WinsockPacketEditor.WebUI.src.components.menu can break WinsockPacketEditor.WebUI.src.components.decoder, while a change to WinsockPacketEditor.WebUI.src.components.decoder can't break WinsockPacketEditor.WebUI.src.components.menu.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.components.decoder uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.components.proxy uses WinsockPacketEditor.WebUI.src.components.proxy.pages, so a change to WinsockPacketEditor.WebUI.src.components.proxy.pages can break WinsockPacketEditor.WebUI.src.components.proxy, while a change to WinsockPacketEditor.WebUI.src.components.proxy can't break WinsockPacketEditor.WebUI.src.components.proxy.pages.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.components.proxy uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.i18n uses WinsockPacketEditor.WebUI.src.i18n.langs, so a change to WinsockPacketEditor.WebUI.src.i18n.langs can break WinsockPacketEditor.WebUI.src.i18n, while a change to WinsockPacketEditor.WebUI.src.i18n can't break WinsockPacketEditor.WebUI.src.i18n.langs.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.i18n uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.stores uses WinsockPacketEditor.WebUI.src.bridge.types, so a change to WinsockPacketEditor.WebUI.src.bridge.types can break WinsockPacketEditor.WebUI.src.stores, while a change to WinsockPacketEditor.WebUI.src.stores can't break WinsockPacketEditor.WebUI.src.bridge.types.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.stores uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.stores uses WinsockPacketEditor.WebUI.src.stores.inject, so a change to WinsockPacketEditor.WebUI.src.stores.inject can break WinsockPacketEditor.WebUI.src.stores, while a change to WinsockPacketEditor.WebUI.src.stores can't break WinsockPacketEditor.WebUI.src.stores.inject.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.stores uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.stores uses WinsockPacketEditor.WebUI.src.stores.packets, so a change to WinsockPacketEditor.WebUI.src.stores.packets can break WinsockPacketEditor.WebUI.src.stores, while a change to WinsockPacketEditor.WebUI.src.stores can't break WinsockPacketEditor.WebUI.src.stores.packets.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.stores uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.stores uses WinsockPacketEditor.WebUI.src.stores.theme, so a change to WinsockPacketEditor.WebUI.src.stores.theme can break WinsockPacketEditor.WebUI.src.stores, while a change to WinsockPacketEditor.WebUI.src.stores can't break WinsockPacketEditor.WebUI.src.stores.theme.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.stores uses a module listed above it, which is the healthy direction.
WinsockPacketEditor.WebUI.src.stores uses WinsockPacketEditor.WebUI.src.stores.toast, so a change to WinsockPacketEditor.WebUI.src.stores.toast can break WinsockPacketEditor.WebUI.src.stores, while a change to WinsockPacketEditor.WebUI.src.stores can't break WinsockPacketEditor.WebUI.src.stores.toast.
Position
Below the diagonal: WinsockPacketEditor.WebUI.src.stores uses a module listed above it, which is the healthy direction.
WPEHybrid uses WinsockPacketEditor, so a change to WinsockPacketEditor can break WPEHybrid, while a change to WPEHybrid can't break WinsockPacketEditor.
Position
Below the diagonal: WPEHybrid uses a module listed above it, which is the healthy direction.
WPEHybrid uses WinsockPacketEditor.Ipc, so a change to WinsockPacketEditor.Ipc can break WPEHybrid, while a change to WPEHybrid can't break WinsockPacketEditor.Ipc.
Position
Below the diagonal: WPEHybrid uses a module listed above it, which is the healthy direction.
WPEHybrid uses WinsockPacketEditor.Mcp, so a change to WinsockPacketEditor.Mcp can break WPEHybrid, while a change to WPEHybrid can't break WinsockPacketEditor.Mcp.
Position
Below the diagonal: WPEHybrid uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 47.6 · Weak · gated by D1, D2, R3 ·
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 category
Findings
Severity
A05:2025 — Injection
23
High / Critical
A03:2025 — Software Supply Chain Failures
4
High / Critical
Roadmap
Top priorities: Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler; Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `REDACTED:1339`; Resolve the 14 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED (3), REDACTED (3).
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler.
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `REDACTED:1339`.
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 — 68
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 — 803
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 — 70
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 6
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 69 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 — 69 dimensions across the health lenses
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
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, 929 of 941 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.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
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.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
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.
D8 Code Coverage — 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. Coverage NOT MEASURED: the test suite could not be built/run in-image (commonly external-service dependencies — a database, a broker — we won't provision). To have it measured, make the suite runnable without them. For context only, test code is ≈ 9% of production LoC (5,830 test / 61,737 production) — a rough proxy, NOT a coverage measurement, so it is excluded from the score. You can widen what we reach: optional: make the suite runnable without a database, broker or other service we do not provision, and real coverage is measured on the next scan.
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 reliability NOT MEASURED: the test run produced no results for any test tier, so no test ever ran and flakiness could not be exercised. The cause could not be attributed, so it is excluded from the score rather than read as an absence of tests.
D12 Dependency Hygiene — 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. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
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 (3 contributor(s) across 1065 commit(s) sampled, automation and bot accounts excluded). One of them holds 97% of the history; the other 2 hold 1.5% 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.
D19 Documentation Quality — 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. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming 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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
D21 Naming 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D21 Naming 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — 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. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
D23 Boundary Type-Coupling — 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. Large codebase (61,737 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can 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 — 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. D24 compares a comment's words with the identifiers, literals and constructs of the code it annotates, using English function-word and rationale lexicons. Comments in another script or language were left unread rather than counted as clean.
D27 Navigability — 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. Tracing effort is measured over resolved call sites, and all 3128 sampled here came from .cs files. This repository's .ts source is a material share of its production lines and contributed none, so the score above is a verdict about the part that was read. Not a finding that the unread half navigates well — it is unmeasured.
D30 Dependency Vulnerabilities — measured, with a gap in what it reached — 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. `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan. 2 of 3 declared ecosystem(s) (npm,osv) WERE scanned and every vulnerability they reported is included in this result; nuget was not, so this dimension's score covers less than the dependency surface this repository declares, and nothing here is evidence that nuget is free of known-vulnerable dependencies.
D32 Data Compliance (PII/GDPR) — 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. `WinsockPacketEditor/Mcp/McpAgentGateway.cs`, `WinsockPacketEditor/WebUI/src/i18n/base.ts` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AXB2 Runtime readiness — 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. `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. (rule: no-root-manifest). The renderer reported: the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
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. Render strategy: boot via DevServer (dev). the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
IC1 Incompleteness & stubs — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
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.
R10 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. 37 further occurrence(s) are not listed individually; the score already reflects all 77.
X1 Async correctness — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X12 Unreachable branch — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X13 Undrained process stream — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X14 Bypassable address classification — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X16 Unfloored truncation loop — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X17 Uncapped recursion over a caller-supplied document — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X18 Disposal-pattern correctness — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X2 Cancellation propagation — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X2 Cancellation propagation — 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. 227 further occurrence(s) are not listed individually; the score already reflects all 267.
X22 Contradicted release guard — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X25 Inert configuration knob — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X27 Collection changed while being enumerated — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X28 Index access outside its own emptiness guard — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X29 Per-element action decided by a fixed element — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X3 Exception handling — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X3 Exception handling — 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. 30 further occurrence(s) are not listed individually; the score already reflects all 70.
X30 Support guard that admits what it rejects — 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. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
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.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
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.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
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.
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.
D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment — a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
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.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
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.
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 Dockerfile (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.
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.
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.
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.
80 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ShellForm.RegisterMethods at 596. A further 10 method(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 CodecEngine.AppliesTo at 29 — they are counted neither in the figure above nor in this dimension's score.
+ 74 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 240 down to 240 or less in Cyclomatic Complexity — start with ShellForm.RegisterMethods (cyclomatic 596). — Refactoring it lifts Cyclomatic Complexity from 3.6 to about 4.7/10.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 123 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 3 bodies over 120 down to 120 or less in Cognitive Complexity — start with ShellForm.RegisterMethods (cognitive 662), ShellForm.HandleMcpShellActionAsync (cognitive 321), RobotExecute.Robot_Body (cognitive 244). — 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 3 together lifts Cognitive Complexity from 2.0 to about 4.1/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.7 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 22 MethodTooLong finding(s) in God Classes — start with REDACTED (12), ShellForm.cs (2), L10nEn.cs. — One of this dimension's main actionable groups (22 warning-level).
Resolve the 20 TooManyMethods finding(s) in God Classes — start with REDACTED (13), McpAgentGateway.cs, ShellForm.cs. — One of this dimension's main actionable groups (20 warning-level).
Resolve the 5 FileTooLong finding(s) in God Classes — start with REDACTED, ShellForm.cs, McpAgentGateway.cs. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D4 · Code Duplication4.2 / 10Weak✓ 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.
74 duplicated block group(s) detected. 14.5 % of the production lines (8,932 of 61,737) are in a reported copy. A further 109 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.
Edited copy of a member (12 corresponding lines) · ×5WinsockPacketEditor/Mcp/McpAgentGateway.cs:471
Edited copy of a member (4 corresponding lines) · ×5WinsockPacketEditor/Mcp/McpAgentGateway.cs:633
Edited copy of a member (14 corresponding lines) · ×5REDACTED:1682
+ 105 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 8 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with ShellForm.cs (4), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with REDACTED (3), WS2_32.cs (2), ShellForm.cs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 5 Edited copy of a member (12 corresponding lines) finding(s) in Code Duplication — start with McpAgentGateway.cs (3), ProtocolDecoder.cs, RobotExecute.cs. — 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.
Do you agree with this assessment?
D5 · Coupling8.9 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
Off the main sequence: WinsockPacketEditorWinsockPacketEditor/WinsockPacketEditor.csproj:1
What to do
Resolve the 1 Off the main sequence finding(s) in Coupling — start with WinsockPacketEditor.csproj. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with ProxySession.cs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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.
0 of 182 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 30 direct `PackageReference`(s), and 149 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution.
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.
Resolve the 16 Hotspot finding(s) in Churn × Complexity Hotspots — start with ShellForm.cs, REDACTED, McpAgentGateway.cs. — One of this dimension's main actionable groups (16 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with FireWallSetting.vue. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 54 EmptyCatchBlock finding(s) in Explicit Debt — start with ShellForm.cs (14), MihomoKernel.cs (7), REDACTED (5). — One of this dimension's main actionable groups (54 issue-level).
Resolve the 7 WriteOnlyPrivateField finding(s) in Explicit Debt — start with WpeCore.cs (4), ShellLink.cs (3). — One of this dimension's main actionable groups (7 issue-level).
Resolve the 1 NoWarnInCsproj finding(s) in Explicit Debt — start with WPEHookTest.csproj. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the solution is laid out in a sensible, conventional structure.
Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.
5 projects, 119 source files, 64535 hand-written lines of code (60147 production / 4388 test — the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), plus 87 generated (machine-written code — designer, scaffolded and tool-emitted files — excluded from quality), 4 inter-project edges.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 2 documentation facets pass in full; short on: F2 example. 10 document(s) read across 6 unit(s).
Documentation: no build, run or usage exampleREADME.md:1
What to do
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
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.
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with WPELauncher.csproj. — 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.
1 of 7 projects flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesionWinsockPacketEditor/WinsockPacketEditor.csproj:1
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with WinsockPacketEditor.csproj. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
63 % of calls cross a namespace and 0 % go through an interface, but 96 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: large — vertical-slice locality expected. Measured over the .cs source only — this repository's .ts was not sampled for call sites, so this score covers part of the tree, not all of it.
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.
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).
23 finding(s): 0 critical, 1 high, 22 medium, 0 low. semgrep hit a parse error in 3 file(s) — `WinsockPacketEditor/App_Data/base-mihomo.yaml`, `WinsockPacketEditor/Mcp/McpAgentGateway.cs` (line 812), `WinsockPacketEditor/WebUI/src/i18n/base.ts` (lines 29–1838) — 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.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
What to do
Resolve the 14 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED (3), REDACTED (3). — One of this dimension's main actionable groups (14 warning-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
4 finding(s): 0 critical, 3 high, 1 medium, 0 low. Partial dependency scan: 2 of 3 declared ecosystem(s) were scanned (npm,osv), and the findings above are real and complete for them. nuget was not scanned (nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan), so this is not the whole dependency surface and the result is reported at reduced confidence.
REDACTED
REDACTED
What to do
Resolve the 3 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 82 of the 110 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
Resolve the 1 Change coupling finding(s) in Change Coupling — start with InjectData.vue. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 8 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.
Other · Architecture — Whether any singleton service captures a scoped/transient dependency — a silent lifetime/threading bug.
Method: Roslyn scan: DI registrations parsed from AddSingleton/Scoped/Transient; each singleton checked for captured shorter-lifetime dependencies. Exhaustive, deterministic.
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.
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.
Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.
Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.
`IPConnectionFilter` is not registered, but `Proxy` creates it and keeps it in the static `ipFilter`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (Name; e.g. `Name` at line 17). — WinsockPacketEditor/ClassObject/IPConnectionFilter.cs:7
`ProcessInfo` is not registered, but `Proxy` creates it and keeps it in the static `lstSelectProcessName`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsCheck, _ICO, _ProcessName, _ProcessID, _ModuleName, _ProcessPath; e.g. `_IsCheck` at line 17). — WinsockPacketEditor/ClassObject/ProcessInfo.cs:5
`ProxyUDP` is not registered, but `Proxy` creates it and keeps it in the static `List.cdProxyUDP`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (LastActivityTime, IsActive, ClientSocket; e.g. `LastActivityTime` at line 30). — WinsockPacketEditor/ClassObject/ProxyUDP.cs:7
`WhiteListInfo` is not registered, but `Proxy` creates it and keeps it in the static `lstWhiteList`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IPAddress, _StartIP, _EndIP, _IPLocation, _EffectCount, _IsExpiry; e.g. `_IPAddress` at line 18). — WinsockPacketEditor/ClassObject/WhiteListInfo.cs:6
`BlackListInfo` is not registered, but `Proxy` creates it and keeps it in the static `lstBlackList`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IPAddress, _StartIP, _EndIP, _IPLocation, _EffectCount, _IsExpiry; e.g. `_IPAddress` at line 18). — WinsockPacketEditor/ClassObject/BlackListInfo.cs:6
`ProxyInfo` is not registered, but `Queue` creates it and keeps it in the static `qProxyInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_ProxyTime, _PacketSocket, _TheologyID, _PacketType, _ClientAddr, _ClientLocation; e.g. `_ProxyTime` at line 30). — WinsockPacketEditor/ClassObject/ProxyInfo.cs:5
`AccountInfo` is not registered, but `Account` creates it and keeps it in the static `lstAccountInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsCheck, _AID, _IsEnable, _UserName, _Password, _AIPInfo; e.g. `_IsCheck` at line 18). — WinsockPacketEditor/ClassObject/AccountInfo.cs:6
`MapLocal` is not registered, but `Mapping` creates it and keeps it in the static `lstMapLocal`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _ProtocolType, _Host, _Port, _RemotePath, _LocalPath; e.g. `_IsEnable` at line 20). — WinsockPacketEditor/ClassObject/MapLocal.cs:5
`MapRemote` is not registered, but `Mapping` creates it and keeps it in the static `lstMapRemote`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsCheck, _IsEnable, _ProtocolTypeFrom, _HostFrom, _PortFrom, _PathFrom; e.g. `_IsCheck` at line 20). — WinsockPacketEditor/ClassObject/MapRemote.cs:5
`PacketInfo` is not registered, but `Queue` creates it and keeps it in the static `cqPacketInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_PacketTime, _PacketSocket, _PacketType, _PacketFrom, _FromLocation, _PacketTo; e.g. `_PacketTime` at line 40). — WinsockPacketEditor/ClassObject/PacketInfo.cs:5
`FilterInfo` is not registered, but `Filter` creates it and keeps it in the static `List.lstFilterInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _FID, _FName, _AppointHeader, _HeaderContent, _AppointSocket; e.g. `_IsEnable` at line 31). — WinsockPacketEditor/ClassObject/FilterInfo.cs:5
`SendInfo` is not registered, but `Send` creates it and keeps it in the static `List.lstSendInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _SID, _SName, _ExecutionCount, _ExecutionSuccess, _ExecutionFail; e.g. `_IsEnable` at line 18). — WinsockPacketEditor/ClassObject/SendInfo.cs:6
`SendExecute` is not registered, but `Send` creates it and keeps it in the static `editExecute`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (cts, Total_Send, Send_Success, Send_Failure, SendCollection_Index, siSelect; e.g. `cts` at line 57). — WinsockPacketEditor/ClassObject/SendExecute.cs:8
`RobotInfo` is not registered, but `Robot` creates it and keeps it in the static `List.lstRobotInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _RID, _RName, _ExecutionCount, _RInstruction; e.g. `_IsEnable` at line 18). — WinsockPacketEditor/ClassObject/RobotInfo.cs:6
`RobotExecute` is not registered, but `Robot` creates it and keeps it in the static `editExecute`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (cts, Total_Instruction, riSelect, RobotName, RInstruction, RParameters; e.g. `cts` at line 57). — WinsockPacketEditor/ClassObject/RobotExecute.cs:12
`InstructionInfo` is not registered, but `Robot` creates it and keeps it in the static `editInstruction`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_InstType, _InstContent; e.g. `_InstType` at line 16). — WinsockPacketEditor/ClassObject/InstructionInfo.cs:4
`WareHouseInfo` is not registered, but `WareHouse` creates it and keeps it in the static `List.lstWareHouseInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_WID, _WName, _Stores; e.g. `_WID` at line 18). — WinsockPacketEditor/ClassObject/WareHouseInfo.cs:6
`AutoStoresInfo` is not registered, but `WareHouse` creates it and keeps it in the static `List.lstAutoStoresInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _PacketHead, _WID; e.g. `_IsEnable` at line 17). — WinsockPacketEditor/ClassObject/AutoStoresInfo.cs:5
`ServerInfo` is not registered, but `ServerList` creates it and keeps it in the static `lstServerInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _SID, _ServerName, _ServerIP, _ServerPort, _ForgotURL; e.g. `_IsEnable` at line 18). — WinsockPacketEditor/ClassObject/ServerInfo.cs:6
`NoticeInfo` is not registered, but `NoticeList` creates it and keeps it in the static `lstNoticeInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_NID, _NoticeType, _NoticeTitle, _NoticeContent, _NoticeMore, _NoticeTime; e.g. `_NID` at line 17). — WinsockPacketEditor/ClassObject/NoticeInfo.cs:5
`LogInfo` is not registered, but `Queue` creates it and keeps it in the static `cqLogInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_LogTime, _FuncName, _LogContent; e.g. `_LogTime` at line 17). — WinsockPacketEditor/ClassObject/LogInfo.cs:5
`FilterLogInfo` is not registered, but `Queue` creates it and keeps it in the static `cqFilterLogInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_LogTime, _FName, _FAction, _MatchNum, _PacketType, _PacketLen; e.g. `_LogTime` at line 17). — WinsockPacketEditor/ClassObject/FilterLogInfo.cs:5
`ProxyLogInfo` is not registered, but `Queue` creates it and keeps it in the static `cqProxyLogInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_LogTime, _UserName, _LoginIP, _LogContent; e.g. `_LogTime` at line 17). — WinsockPacketEditor/ClassObject/ProxyLogInfo.cs:5
`WpeCore` keeps one instance of itself in the static `_instance`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_ctl, _pkt, _evt, _lastPingTick, _writerThread, _controlThread; e.g. `_ctl` at line 157). — WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:29
`WinSockHook` is not registered, but the singleton `WpeCore` creates it and keeps it in `_hook`, so one instance outlives every request and is shared by every caller that reaches it — and it mutates instance state outside any lock (InstalledCount, lhWS1_Send, lhWS1_SendTo, lhWS1_Recv, lhWS1_RecvFrom, lhWS2_Send; e.g. `InstalledCount` at line 94). — WinsockPacketEditor/ClassObject/WinSockHook.cs:8
`ShellForm` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (envTask; e.g. `envTask` at line 132). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — WinsockPacketEditor/ShellForm.cs:32
`FeedPump` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (attached; e.g. `attached` at line 65). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — WinsockPacketEditor/ClassObject/FeedPump.cs:35
`UI` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Host, L10n, Feed; e.g. `Host` at line 75). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — WinsockPacketEditor/ClassObject/Ui/UI.cs:27
`SystemConfig` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (HotKey1, HotKey2, HotKey3, HotKey4, HotKey5, HotKey6; e.g. `HotKey1` at line 937). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:40
`Proxy` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (mustTCP_AppointPortContent, mustTCP_AppointPorts, lastProcessList, selfProcessId, selfModuleName, Enable_Mihomo; e.g. `mustTCP_AppointPortContent` at line 5850). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:5795
`Mapping` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Enable_MapLocal, Enable_MapRemote; e.g. `Enable_MapLocal` at line 15726). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:14877
`List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (piSelect; e.g. `piSelect` at line 17572). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:17445
`Send` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (editSID, editCollection; e.g. `editSID` at line 24925). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:24035
`List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (sendListCts, sendListTask; e.g. `sendListCts` at line 25346). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:25206
`Robot` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (editHooked, editRID, editInstruction, LastBadIndex; e.g. `editHooked` at line 27015). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:26233
`List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (robotListCts, robotListTask; e.g. `robotListCts` at line 27524). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:27458
`List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (savedSeq; e.g. `savedSeq` at line 28683). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:28602
`DataBase` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (conStr; e.g. `conStr` at line 32692). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — REDACTED:32634
What to do
Keep singletons stateless or back their state with thread-safe types (Concurrent*/Immutable*); otherwise concurrent callers race.
A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.
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.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
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.
No [Authorize]/policies and no imperative guard methods (throw-on-violation) were found — endpoints may be unprotected.
`ProxyAccount_Controller.GetProxyAccountList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:74
`ProxyAccount_Controller.GetProxyAccountByID` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:89
`ProxyAccount_Controller.GetPlainPassword` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:111
`ProxyAccount_Controller.GetPassWordDecrypt` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:130
`ProxyAccount_Controller.AddProxyAccount` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:142
`ProxyAccount_Controller.DeleteProxyAccount` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:190
`ProxyAccount_Controller.UpdateProxyAccount` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:211
`ProxyCap_Controller.GetServerList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:14
`ProxyCap_Controller.GetNoticeList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:25
`ProxyInfo_Controller.GetProxyInfo` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:18
`ProxyInfo_Controller.GetProxyAuthList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:50
`ProxyInfo_Controller.GetProxyLogList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:70
`SocketInfo_Controller.GetSocketInfo` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:22
`SocketInfo_Controller.GetSocketLogList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:62
`SocketInfo_Controller.GetProxyLogList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:74
`SystemInfo_Controller.GetCPUAndMemory` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:18
`SystemInfo_Controller.GetStartTime` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:37
`SystemInfo_Controller.GetSelectMode` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase. — REDACTED:49
What to do
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords: members that only throw a "not implemented" exception, methods that take inputs and return a constant, async methods that never await, dead `if (false)` / `#if false` branches, and skeleton types most of whose members are holes. A real, objective slice of technical debt.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`Handshake` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. — REDACTED:7299
What to do
Remove the dead code that looks live: delete dead if(false) / #if false branches, which read as logic that runs, and either do the real async work or drop the async keyword from fake-async methods, which promise work they never wait for.
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.
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.
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.
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.
Do you agree with this assessment?
P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified
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.
No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
What to do
Add a CI workflow that builds and runs the test suite on every push/PR.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
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.
No static application security testing detected. For this repository's stack, add CodeQL's csharp pack, or a .NET security analyzer package (or `semgrep --config=auto`, which runs on any language) — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
`WPEMcpServer/WPEMcpServer.csproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — WPEMcpServer/WPEMcpServer.csproj:14
What to do
Run what this repository's stack ships: CodeQL's csharp pack, or a .NET security analyzer package — or `semgrep --config=auto`, which runs on any language — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Do you agree with this assessment?
P8 · Schema migrations3.0 / 10Weak✓ Tool-verified
Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.
Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. Exhaustive, deterministic.
This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead. (×16) — REDACTED:32740, REDACTED:33278, REDACTED:33456, …
What to do
Move each table the code creates at runtime into the versioned migrations the repository already applies.
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.
4 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
`_shutdown.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). — WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:210
`.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). (×3) — WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:232, WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:234, REDACTED:7645
What to do
Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult().
Do you agree with this assessment?
R1 · Type Safety9.8 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.
24 duplicated blocks under WinsockPacketEditor/WebUI/src/components/ have copies in at least two of the sibling directories decoder, extractor, inject, proxy — 21 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 24 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 24 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 24 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:498
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:498 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:433 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:498
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:676 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:618 — the two spans are one implementation copied and then locally edited — 539 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:676
WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:43 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:53 — the two spans are one implementation copied and then locally edited — 530 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:43
WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:35 · WinsockPacketEditor/WebUI/src/components/proxy/WareHouseList.vue:31 — the two spans are one implementation copied and then locally edited — 438 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:35
WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:76 · WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:84 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:76
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:362 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:292 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:362
WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:245 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:170 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:203 · WinsockPacketEditor/WebUI/src/components/proxy/WareHouseList.vue:139 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:245
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:437 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:379 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:437
WinsockPacketEditor/WebUI/src/components/HexPanel.vue:166 · WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue:92 — the two spans are one implementation copied and then locally edited — 333 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/HexPanel.vue:166
WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:154 · WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:245 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:170 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:203 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:154
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:160 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:122 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:160
WinsockPacketEditor/WebUI/src/components/proxy/NoticeEdit.vue:13 · WinsockPacketEditor/WebUI/src/components/proxy/ServerEdit.vue:11 — the two spans are one implementation copied and then locally edited — 223 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/proxy/NoticeEdit.vue:13
WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:61 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:53 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:61
WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:159 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:113 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:140 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:159
WinsockPacketEditor/WebUI/src/components/proxy/AccountBatch.vue:36 · WinsockPacketEditor/WebUI/src/components/proxy/AccountEdit.vue:46 — the two spans are one implementation copied and then locally edited — 137 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/proxy/AccountBatch.vue:36
WinsockPacketEditor/WebUI/src/components/InjectView.vue:470 · WinsockPacketEditor/WebUI/src/components/InjectView.vue:496 — 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. — WinsockPacketEditor/WebUI/src/components/InjectView.vue:470
WinsockPacketEditor/WebUI/src/components/proxy/HookSetting.vue:173 · WinsockPacketEditor/WebUI/src/components/proxy/LeachSetting.vue:100 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/HookSetting.vue:173
WinsockPacketEditor/WebUI/src/components/decoder/BatchResult.vue:16 · WinsockPacketEditor/WebUI/src/components/decoder/SmartResult.vue:23 — the two spans are one implementation copied and then locally edited — 220 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/decoder/BatchResult.vue:16
WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue:168 · WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:49 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue:168
WinsockPacketEditor/WebUI/src/components/proxy/ActionColor.vue:87 · WinsockPacketEditor/WebUI/src/components/proxy/IPRuleEdit.vue:98 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/ActionColor.vue:87
WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:122 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:173 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:122
WinsockPacketEditor/WebUI/src/components/proxy/AccountAdjust.vue:81 · WinsockPacketEditor/WebUI/src/components/proxy/AccountEdit.vue:128 · WinsockPacketEditor/WebUI/src/components/proxy/AutoStoresEdit.vue:69 · WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:925 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/AccountAdjust.vue:81
WinsockPacketEditor/WebUI/src/components/InjectView.vue:400 · WinsockPacketEditor/WebUI/src/components/StartView.vue:58 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — WinsockPacketEditor/WebUI/src/components/InjectView.vue:400
WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue:200 · WinsockPacketEditor/WebUI/src/components/proxy/HookSetting.vue:199 · WinsockPacketEditor/WebUI/src/components/proxy/LeachSetting.vue:125 · WinsockPacketEditor/WebUI/src/components/proxy/SystemSetting.vue:58 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue:200
WinsockPacketEditor/WebUI/src/components/proxy/ListSetting.vue:60 · WinsockPacketEditor/WebUI/src/components/proxy/ProxySetting.vue:84 — the two spans are one implementation copied and then locally edited — 73 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — WinsockPacketEditor/WebUI/src/components/proxy/ListSetting.vue:60
WinsockPacketEditor/WebUI/src/components/InjectView.vue:217 · WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue:171 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — WinsockPacketEditor/WebUI/src/components/InjectView.vue:217
WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:100 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:123 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:150 — the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:100
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:65 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:764 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:65
WinsockPacketEditor/WebUI/src/components/proxy/MapLocalEdit.vue:58 · WinsockPacketEditor/WebUI/src/components/proxy/MapRemoteEdit.vue:71 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/MapLocalEdit.vue:58
WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:202 · WinsockPacketEditor/WebUI/src/components/proxy/WpcConfig.vue:56 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:202
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:181 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:724 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:181
REDACTED:86 · WinsockPacketEditor/WebUI/src/components/proxy/RuleList.vue:137 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — REDACTED:86
WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:507 · WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:541 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:507
WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:551 · WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:295 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:551
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:97 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:81 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:97
WinsockPacketEditor/WebUI/src/components/proxy/ExtProxySetting.vue:50 · WinsockPacketEditor/WebUI/src/components/proxy/RemoteSetting.vue:50 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/ExtProxySetting.vue:50
WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:117 · WinsockPacketEditor/WebUI/src/components/proxy/StatData.vue:129 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited. — WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:117
WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:288 · WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:188 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:288
WinsockPacketEditor/WebUI/src/components/HexPanel.vue:88 · WinsockPacketEditor/WebUI/src/components/proxy/PacketModification.vue:44 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — WinsockPacketEditor/WebUI/src/components/HexPanel.vue:88
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
onMenuPick has cyclomatic complexity 36 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:647, WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:597
onKey has cyclomatic complexity 35 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/HexView.vue:346
transform has cyclomatic complexity 31 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/Transcode.vue:94
onPick has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/HexPanel.vue:209
onMenuPick has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:299
onKey has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/CyberSelect.vue:125
zhDescription has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue:50
onMenuPick has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:541
save has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:866
core has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/diff.ts:168
findNext has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:384, WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:320
toBlocks has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/diff.ts:114
(anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue:102
localizedDescription has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue:89
(anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:183
changeProtocol has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/MapRemoteEdit.vue:35
parse has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/tools/check-font-sizes.mjs:45
(anonymous) has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/bridge/index.ts:26
pasteAt has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:509
openBind has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:691
toggleSend has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue:162
initTheme has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/stores/theme.ts:236
myers has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/diff.ts:57
onMenuPick has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue:189
onScroll has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — WinsockPacketEditor/WebUI/src/tooltip.ts:339
Do you agree with this assessment?
R3 · Large Files1.1 / 10Critical✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue has 1348 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:1
WinsockPacketEditor/WebUI/src/components/InjectView.vue has 1263 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/InjectView.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue has 1033 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue has 901 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:1
WinsockPacketEditor/WebUI/src/components/PacketList.vue has 873 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/PacketList.vue:1
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue has 839 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue has 661 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:1
WinsockPacketEditor/WebUI/src/components/StartView.vue has 660 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/StartView.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/TextCompare.vue has 658 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/TextCompare.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue has 651 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue has 617 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue:1
WinsockPacketEditor/WebUI/src/components/HexView.vue has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/HexView.vue:1
WinsockPacketEditor/WebUI/src/App.vue has 574 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/App.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue has 517 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue has 503 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/WareHouseEdit.vue has 476 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/WareHouseEdit.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/SystemLog.vue has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/SystemLog.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue has 434 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue:1
WinsockPacketEditor/WebUI/src/components/AppSetting.vue has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/AppSetting.vue:1
WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue has 415 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage0.0 / 10Critical✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
0% of 117 production file(s) reachable from 0 test file(s) via the import graph — 'production' here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace's file count
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
Do you agree with this assessment?
R6 · Tooling3.3 / 10Weak✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
test ✗ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
What to do
Add a test runner (vitest / jest / playwright) and eslint as package.json scripts and run them in CI.
Do you agree with this assessment?
R7 · Dead Code9.8 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Nothing imports this binding — it is safe to review for removal. (×4) — WinsockPacketEditor/WebUI/src/components/decoder/actions.ts:116, WinsockPacketEditor/WebUI/src/components/decoder/actions.ts:122, WinsockPacketEditor/WebUI/src/components/decoder/enums.ts:6, …
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Security — Transport security, security headers, secure cookies, input validation, middleware order and crypto hygiene (presence, not runtime).
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.
`md5.ComputeHash(…)` puts the password `Password` through a fast general-purpose digest, so a stolen hash is guessed at billions of candidates a second whether or not it is salted — no key-derivation function (PBKDF2/scrypt/Argon2/bcrypt) stands between the password and the stored value. — REDACTED:1339
MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses. (×3) — WinsockPacketEditor/ClassObject/FileAssociation.cs:282, WinsockPacketEditor/ClassObject/HttpsMitmCertificateManager.cs:233, REDACTED:1335
`Entropy` is the DPAPI additional entropy and is a compile-time constant, so the secret this operation depends on is published with the source. A key that ships with the source is not secret: every contributor, fork, mirror and released binary carries it, so anyone holding the repository can decrypt what any installation encrypted, and there is no way to invalidate what was already protected because every deployment built from this source shares the value. Where the constant is a password salt the consequence differs but is no smaller — one global salt means precomputation amortises across every installation, which is the property salting exists to destroy. Read the value from configuration, an environment variable or a secrets manager at startup and FAIL FAST when it is absent, so a missing key stops the process instead of silently falling back to a shared default; treat the committed value as disclosed and rotate it rather than only deleting the line. For a salt, generate a fresh random one per password and store it alongside the hash. — WinsockPacketEditor/ClassObject/HttpsMitmCertificateManager.cs:26
This type encrypts through `SymmetricAlgorithm`, whose every cipher mode (CBC/ECB/OFB/CFB/CTS) is unauthenticated, and no keyed MAC or AEAD cipher appears anywhere in it — so nothing establishes that the ciphertext it produced is the ciphertext it later reads back. Encryption alone provides confidentiality, not integrity: unauthenticated CBC is MALLEABLE, and an attacker who can modify stored or transmitted ciphertext can flip chosen plaintext bits in the following block by flipping ciphertext bits in the preceding one, without ever knowing the key. Where the decrypt path reports failure differently for a padding error than for a downstream one — a broad `catch` that returns null is the usual spelling — the same construction also answers the attacker's questions, which is the padding-oracle shape that recovers plaintext outright. Prefer an AEAD cipher: `AesGcm` or `ChaCha20Poly1305` authenticate the ciphertext as part of encrypting it, and give you an associated-data slot for the surrounding context. Where the format cannot change, MAC it with encrypt-then-MAC — HMAC-SHA256 over the IV and the ciphertext together, with a key derived separately from the encryption key — and verify that tag with `CryptographicOperations.FixedTimeEquals` BEFORE decrypting anything. (×2) — WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:129, REDACTED:1368
DES / 3DES / RijndaelManaged-bare is deprecated or broken. Use AES-GCM via `Aes.Create()` with explicit key/iv sizes. (×2) — REDACTED:380, REDACTED:431
Set: Referrer-Policy, X-Content-Type-Options, X-Frame-Options. Missing: Content-Security-Policy, Strict-Transport-Security — 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.) — WinsockPacketEditor/WebAPI/Socket_Web.cs:42
No UseHttpsRedirection/UseHsts and no reverse-proxy signal — transport security is unverified at the app layer. (−2.0 on this card.)
No ModelState/[ApiController]/FluentValidation signal — inbound payloads reach handlers unvalidated. (−2.0 on this card.)
`ProxyAccount_Controller.GetProxyAccountByID` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:89
`ProxyAccount_Controller.GetPlainPassword` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:111
`ProxyAccount_Controller.GetPassWordDecrypt` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:130
`ProxyAccount_Controller.AddProxyAccount` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:142
`ProxyAccount_Controller.DeleteProxyAccount` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:190
`ProxyAccount_Controller.UpdateProxyAccount` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:211
`ProxyInfo_Controller.GetProxyAuthList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:50
`ProxyInfo_Controller.GetProxyLogList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:70
`SocketInfo_Controller.GetSocketLogList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:62
`SocketInfo_Controller.GetProxyLogList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard. — REDACTED:74
What to do
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `REDACTED:1339`.
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (`System.IO.Hashing.XxHash64`/`Crc32`) where it only derives an identifier such as a cache key or a mutex name. This repository constructs a collision-broken hash (MD5/SHA1) at 3 sites, not one: `WinsockPacketEditor/ClassObject/FileAssociation.cs:282` (SHA1), `WinsockPacketEditor/ClassObject/HttpsMitmCertificateManager.cs:233` (MD5), `REDACTED:1335` (MD5). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Load cryptographic key and salt material from configuration, an environment variable or a secrets manager rather than fixing it in the source, and fail fast at startup when it is absent — a default that silently works is the one that reaches production. Rotate anything already committed: it must be treated as disclosed. Salts should be generated per password and stored with the hash, never shared across installations.
Authenticate ciphertext, do not just encrypt it: move to an AEAD cipher (`AesGcm`, `ChaCha20Poly1305`), or where the wire format is fixed, add encrypt-then-MAC with HMAC-SHA256 over IV+ciphertext under a separately derived key and verify the tag with `CryptographicOperations.FixedTimeEquals` before decrypting. Unauthenticated CBC is malleable, and a decrypt path that distinguishes padding failures from other failures is a padding oracle. This repository constructs symmetric encryption whose ciphertext nothing authenticates at 2 sites, not one: `WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:129` (CBC or another CipherMode member), `REDACTED:1368` (CBC or another CipherMode member). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Replace DES/3DES (and bare RijndaelManaged) with AES-GCM via `Aes.Create()`. This repository constructs a broken or deprecated cipher at 2 sites, not one: `REDACTED:380` (DES), `REDACTED:431` (DES). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Add Content-Security-Policy, Strict-Transport-Security beside the headers already set; Content-Security-Policy is the one that pays for itself first, then Strict-Transport-Security, then nosniff and a frame policy.
Enforce HTTPS at the app layer (UseHttpsRedirection / UseHsts) — only skip this if a reverse proxy demonstrably terminates TLS.
Validate inbound models (ModelState/[ApiController]/FluentValidation) to reduce injection and bad-data risk.
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.
`async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained. (×9) — WinsockPacketEditor/Bridge/WebBridge.cs:94, WinsockPacketEditor/ClassObject/Core/HookHost.cs:106, WinsockPacketEditor/ClassObject/Core/HookHost.cs:112, …
Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process. (×3) — WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:232, WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:234, REDACTED:7645
`.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters). (×2) — WinsockPacketEditor/Mcp/McpAgentGateway.cs:70, WinsockPacketEditor/ShellForm.cs:559
`MihomoKernel.Stop` is a synchronous helper that blocks (`Thread.Sleep`): called from an `async` method it parks the thread exactly as the inline call would. Make the helper `async` and `await` it (`await Task.Delay`, `SemaphoreSlim.WaitAsync`, a `TaskCompletionSource` instead of the poll). — REDACTED:6227
`McpAgentGateway.Start` is a synchronous helper that blocks (`WaitHandle.WaitOne`): called from an `async` method it parks the thread exactly as the inline call would. Make the helper `async` and `await` it (`await Task.Delay`, `SemaphoreSlim.WaitAsync`, a `TaskCompletionSource` instead of the poll). — WinsockPacketEditor/ShellForm.cs:499
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
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.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document3.5 / 10Weak✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`TryGetCompleted` is public, takes a document from its caller (line 23) and hands it to `Canonicalize`, which calls itself at line 141 with a child of the node it was given (and at line 147) — and nowhere in `Canonicalize` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the tree it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. A document nested past the stack that remains raises `StackOverflowException`, which .NET neither lets you catch nor unwinds: the process is torn down where it stands, taking every other request in flight with it, and no `try`/`catch` around `TryGetCompleted` can intervene. Thread a depth argument through `Canonicalize` and reject the document past a fixed maximum, or rewrite the descent with an explicit stack. — WinsockPacketEditor/Mcp/McpWriteGuard.cs:141
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34321). Every use of it in `SelectTable_SendCollection` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:34321
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34348). Every use of it in `SelectTable_SendCollection` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:34348
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34556). Every use of it in `SelectTable_RobotInstruction` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:34556
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34583). Every use of it in `SelectTable_RobotInstruction` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:34583
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34801). Every use of it in `SelectTable_WareHouseData` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:34801
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34828). Every use of it in `SelectTable_WareHouseData` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:34828
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 35319). Every use of it in `SelectTable_ProxyAccountIPInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:35319
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 35346). Every use of it in `SelectTable_ProxyAccountIPInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:35346
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 36470). Every use of it in `SelectTable_ServerRuleInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:36470
`adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 36497). Every use of it in `SelectTable_ServerRuleInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:36497
`c` is a `TcpClient`, which implements `IDisposable`, and it is created here (line 555). Every use of it in `IsDevServerUp` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var c = …;`), which releases it at the end of the scope on every path including a throw. — WinsockPacketEditor/ShellForm.cs:555
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
Other · Code Health — Whether async methods accept a CancellationToken so work can be cancelled (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Only 11/277 async methods accept a CancellationToken, so in-flight work can't be stopped early when the caller gives up — whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice — judge against your hosting model.
No CancellationToken parameter — this work can't be stopped early once started. (×39) — WinsockPacketEditor/Bridge/BridgeUiHost.cs:190, WinsockPacketEditor/Bridge/WebBridge.cs:172, WinsockPacketEditor/ClassObject/Core/HookHost.cs:106, …
What to do
Thread a CancellationToken through async methods so work stops promptly on cancellation.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back. Also whether a `finally` that gives the primitive back unconditionally can run in a state where the method does not hold it: after a timed wait whose result was discarded, after an acquire inside the `try` that can fail, after the body already released it, or never, because a `return` left between the acquire and the `try`.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped1.7 / 10Critical✓ Tool-verified
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
`it.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — WinsockPacketEditor/WebUI/src/components/ContextMenu.vue:136
`s.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — WinsockPacketEditor/WebUI/src/components/ContextMenu.vue:152
`ICON[x.level]` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — WinsockPacketEditor/WebUI/src/components/ToastStack.vue:46
`p.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — WinsockPacketEditor/WebUI/src/components/proxy/ProxySide.vue:127
`b.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:640
`I[r.Type === IT.LoopStart ? 'loopStart' : r.Type === IT.LoopEnd ? 'loopEnd' : r.Type === IT.Delay ? 'delay' : r.Type === IT.Switch ? 'switch' : r.Type === IT.KeyBoard ? 'key' : r.Type === IT.Mouse ? 'mkey' : r.Type === IT.SetSystemSocket ? 'sock' : 'send']` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:797
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `foreach` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is enumerating invalidates the enumerator it is holding, so the next `MoveNext` throws `InvalidOperationException` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×29) — WinsockPacketEditor/Bridge/WebBridge.cs:145, WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:391, WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:483, …
`catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. (×7) — WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:497, WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:569, WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:752, …
`catch (ObjectDisposedException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. (×3) — WinsockPacketEditor/ClassObject/ProxySession.cs:330, WinsockPacketEditor/ClassObject/ProxySession.cs:423, WinsockPacketEditor/ClassObject/ProxySession.cs:498
An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `Dispose()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: record it through whatever this codebase already uses to report problems — or, if one specific failure truly cannot matter, catch exactly that exception type and say why in a comment on the catch (a comment on a catch-all still swallows everything else). — WinsockPacketEditor/Mcp/McpAgentGateway.cs:70
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
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.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
This method contradicts itself about `Session`: line 30726 writes `Session?.WpcToken`, which says `Session` can be null, but line 30728 then dereferences it directly as `Session.WpcToken` with no null test between them and no guard around it. If the `?.` is right, that dereference throws NullReferenceException on the input it was written for; if `Session` truly cannot be null here, the `?.` is misleading. Settle it one way — test `Session` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side. — REDACTED:30728
~0.2 `!` suppressions per 1k syntax nodes — 2 suppression(s) across the 9592 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
What to do
Where a method uses `?.` on a symbol and then dereferences it directly, settle the question once: test it before the first use and handle null, or drop the `?.`.
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
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.
Unscored — 3 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.
SC1 Supply-chain hygiene — 5 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X10 Duplicated predicate — 9 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 35 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 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.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 54 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 — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC2 Forms & labels — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC3 Page structure — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC4 Keyboard semantics — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC5 ARIA correctness — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC6 Visual & motion safety — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AX4 Dependency direction — not applicable to a CQRS architecture (the inward-dependency rule is for layered/clean styles)
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered. This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D10 Test Quality — ~5830 lines of test code exist on disk but weren't loaded from the analyzed solution (excluded from the .sln, or co-located/using a test attribute not loaded here), so test quality couldn't be assessed. Include the tests in the analyzed solution to enable this check.
D11 Test Reliability — Test reliability not measured — no test run produced results
D12 Dependency Hygiene — Dependency hygiene not measured
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D21 Naming Consistency — Naming consistency does not read html yet; not measured.
D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
D24 Comment Value — 1820 of 1838 comment blocks were not judged (1714 in a non-Latin script, 106 in a language other than English): redundancy is judged by word overlap with the code's identifiers, which cannot be measured across languages.
D25 ADR Conformance — no ADRs to check
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 2 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
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.
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage not measured
DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
ED1 Event-Driven — not scored — this repository shows only 1 of the 3 signals this lens looks for (2 CQRS handler(s))
ED5 Idempotency — 2 mutating command handler(s)/consumer(s) detected, but none exposes a recognised handler entry method — idempotency not assessed
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — no CI workflow found
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Not applicable: no benchmark suite was found by the two searches this check runs — a BenchmarkDotNet package reference in any project file (loaded, or on disk), and a script whose name contains `benchmark` that this repository's CI runs. Neither can see a suite in another ecosystem's idiom, so this is not a verdict that the repository has none. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted, and nothing is asked of a repository that has none.
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.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
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
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
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 C# was read, and every log call in it goes through a logger that takes one finished message — its own wrapper, log4net, Console or Debug — so an interpolated message there loses nothing the API could have kept. Calls through Microsoft.Extensions.Logging, Serilog, NLog or ZLogger, or any logger with a message-template overload, would be judged.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — 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.
EmptyCatchBlock WPEHook/Hook.cs:92— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WPELauncher/LauncherDialog.cs:68— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WPELauncher/LauncherDialog.cs:119— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WPELauncher/LauncherDialog.cs:120— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WPELauncher/Program.cs:111— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WPELauncher/SplashForm.cs:52— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/Bridge/WebBridge.cs:145— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:391— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:483— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:818— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:839— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:278— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:1110— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:1154— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:1183— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/FileAssociation.cs:305— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/FileAssociation.cs:313— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/HttpsMitmCertificateManager.cs:168— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:79— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:246— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:255— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:256— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:302— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:380— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:411— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
WriteOnlyPrivateField WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:70— private Thread _pktThread — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:70— private Thread _evtThread — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:70— private Thread _heartbeatThread — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:75— private Thread _heartbeatThread — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:75— private Thread _writerThread — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:75— private Thread _controlThread — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:75— private Thread _eventThread — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
NoWarnInCsproj tests/WPEHookTest/WPEHookTest.csproj:23— CS0618 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
S1 · Web-Security Posture· Password hashing without a KDF · ×1
Password hashing without a KDF REDACTED:1339— `md5.ComputeHash(…)` puts the password `Password` through a fast general-purpose digest, so a stolen hash is guessed at billions of candidates a second whether or not it is salted — no key-derivation function (PBKDF2/scrypt/Argon2/bcrypt) stands between the password and the stored value.
S1 · Web-Security Posture· Cryptographic key material is a compile-time constant · ×1
Cryptographic key material is a compile-time constant WinsockPacketEditor/ClassObject/HttpsMitmCertificateManager.cs:26— `Entropy` is the DPAPI additional entropy and is a compile-time constant, so the secret this operation depends on is published with the source. A key that ships with the source is not secret: every contributor, fork, mirror and released binary carries it, so anyone holding the repository can decrypt what any installation encrypted, and there is no way to invalidate what was already protected because every deployment built from this source shares the value. Where the constant is a password salt the consequence differs but is no smaller — one global salt means precomputation amortises across every installation, which is the property salting exists to destroy. Read the value from configuration, an environment variable or a secrets manager at startup and FAIL FAST when it is absent, so a missing key stops the process instead of silently falling back to a shared default; treat the committed value as disclosed and rotate it rather than only deleting the line. For a salt, generate a fresh random one per password and store it alongside the hash.
Serious — 803 finding(s)
X2 · Cancellation propagation· Async method without CancellationToken · ×39
Async method without CancellationToken: BusyAsync WinsockPacketEditor/Bridge/BridgeUiHost.cs:190— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: AskAsync WinsockPacketEditor/Bridge/WebBridge.cs:172— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: OnLog WinsockPacketEditor/ClassObject/Core/HookHost.cs:106— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: OnFilterLog WinsockPacketEditor/ClassObject/Core/HookHost.cs:112— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: Ingest WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:515— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: Run WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:33— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: Relay WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:83— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: CopyKnownRequestBody WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:107— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: CopySingleHttpResponse WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:115— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: CopyExactly WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:124— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: CopyUntilEnd WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:135— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: SendLocal WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:195— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: Write WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:202— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ReadHeaders WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:204— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ClearDialog WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:132— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ExportDialog WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:138— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ImportDialog WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:152— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ApplyListAction WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:191— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DrainFramesAsync WinsockPacketEditor/ClassObject/ProxySession.cs:231— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: HandleFrame WinsockPacketEditor/ClassObject/ProxySession.cs:258— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ConnectToEXTProxyServer WinsockPacketEditor/ClassObject/ProxySession.cs:357— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ShellActionAsync WinsockPacketEditor/Mcp/McpAgentGateway.cs:316— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: SetTaskEnabledAsync WinsockPacketEditor/Mcp/McpAgentGateway.cs:425— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: CreateTaskAsync WinsockPacketEditor/Mcp/McpAgentGateway.cs:440— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: UpdateTaskAsync WinsockPacketEditor/Mcp/McpAgentGateway.cs:449— No CancellationToken parameter — this work can't be stopped early once started.
Swallowed exception (empty catch) WinsockPacketEditor/Bridge/WebBridge.cs:145— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:391— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:483— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:818— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:839— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:278— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:1110— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:1154— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:1183— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/FileAssociation.cs:305— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/FileAssociation.cs:313— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/HttpsMitmCertificateManager.cs:168— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:79— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:246— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:255— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:256— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:302— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:380— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:411— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:412— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:199— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/ProxySession.cs:533— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/ProxySession.cs:717— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/WinSockHook.cs:67— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) WinsockPacketEditor/ClassObject/WinSockHook.cs:74— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Stateful shared instance: IPConnectionFilter WinsockPacketEditor/ClassObject/IPConnectionFilter.cs:7— `IPConnectionFilter` is not registered, but `Proxy` creates it and keeps it in the static `ipFilter`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (Name; e.g. `Name` at line 17).
Stateful shared instance: ProcessInfo WinsockPacketEditor/ClassObject/ProcessInfo.cs:5— `ProcessInfo` is not registered, but `Proxy` creates it and keeps it in the static `lstSelectProcessName`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsCheck, _ICO, _ProcessName, _ProcessID, _ModuleName, _ProcessPath; e.g. `_IsCheck` at line 17).
Stateful shared instance: ProxyUDP WinsockPacketEditor/ClassObject/ProxyUDP.cs:7— `ProxyUDP` is not registered, but `Proxy` creates it and keeps it in the static `List.cdProxyUDP`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (LastActivityTime, IsActive, ClientSocket; e.g. `LastActivityTime` at line 30).
Stateful shared instance: WhiteListInfo WinsockPacketEditor/ClassObject/WhiteListInfo.cs:6— `WhiteListInfo` is not registered, but `Proxy` creates it and keeps it in the static `lstWhiteList`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IPAddress, _StartIP, _EndIP, _IPLocation, _EffectCount, _IsExpiry; e.g. `_IPAddress` at line 18).
Stateful shared instance: BlackListInfo WinsockPacketEditor/ClassObject/BlackListInfo.cs:6— `BlackListInfo` is not registered, but `Proxy` creates it and keeps it in the static `lstBlackList`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IPAddress, _StartIP, _EndIP, _IPLocation, _EffectCount, _IsExpiry; e.g. `_IPAddress` at line 18).
Stateful shared instance: ProxyInfo WinsockPacketEditor/ClassObject/ProxyInfo.cs:5— `ProxyInfo` is not registered, but `Queue` creates it and keeps it in the static `qProxyInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_ProxyTime, _PacketSocket, _TheologyID, _PacketType, _ClientAddr, _ClientLocation; e.g. `_ProxyTime` at line 30).
Stateful shared instance: AccountInfo WinsockPacketEditor/ClassObject/AccountInfo.cs:6— `AccountInfo` is not registered, but `Account` creates it and keeps it in the static `lstAccountInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsCheck, _AID, _IsEnable, _UserName, _Password, _AIPInfo; e.g. `_IsCheck` at line 18).
Stateful shared instance: MapLocal WinsockPacketEditor/ClassObject/MapLocal.cs:5— `MapLocal` is not registered, but `Mapping` creates it and keeps it in the static `lstMapLocal`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _ProtocolType, _Host, _Port, _RemotePath, _LocalPath; e.g. `_IsEnable` at line 20).
Stateful shared instance: MapRemote WinsockPacketEditor/ClassObject/MapRemote.cs:5— `MapRemote` is not registered, but `Mapping` creates it and keeps it in the static `lstMapRemote`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsCheck, _IsEnable, _ProtocolTypeFrom, _HostFrom, _PortFrom, _PathFrom; e.g. `_IsCheck` at line 20).
Stateful shared instance: PacketInfo WinsockPacketEditor/ClassObject/PacketInfo.cs:5— `PacketInfo` is not registered, but `Queue` creates it and keeps it in the static `cqPacketInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_PacketTime, _PacketSocket, _PacketType, _PacketFrom, _FromLocation, _PacketTo; e.g. `_PacketTime` at line 40).
Stateful shared instance: FilterInfo WinsockPacketEditor/ClassObject/FilterInfo.cs:5— `FilterInfo` is not registered, but `Filter` creates it and keeps it in the static `List.lstFilterInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _FID, _FName, _AppointHeader, _HeaderContent, _AppointSocket; e.g. `_IsEnable` at line 31).
Stateful shared instance: SendInfo WinsockPacketEditor/ClassObject/SendInfo.cs:6— `SendInfo` is not registered, but `Send` creates it and keeps it in the static `List.lstSendInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _SID, _SName, _ExecutionCount, _ExecutionSuccess, _ExecutionFail; e.g. `_IsEnable` at line 18).
Stateful shared instance: SendExecute WinsockPacketEditor/ClassObject/SendExecute.cs:8— `SendExecute` is not registered, but `Send` creates it and keeps it in the static `editExecute`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (cts, Total_Send, Send_Success, Send_Failure, SendCollection_Index, siSelect; e.g. `cts` at line 57).
Stateful shared instance: RobotInfo WinsockPacketEditor/ClassObject/RobotInfo.cs:6— `RobotInfo` is not registered, but `Robot` creates it and keeps it in the static `List.lstRobotInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _RID, _RName, _ExecutionCount, _RInstruction; e.g. `_IsEnable` at line 18).
Stateful shared instance: RobotExecute WinsockPacketEditor/ClassObject/RobotExecute.cs:12— `RobotExecute` is not registered, but `Robot` creates it and keeps it in the static `editExecute`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (cts, Total_Instruction, riSelect, RobotName, RInstruction, RParameters; e.g. `cts` at line 57).
Stateful shared instance: InstructionInfo WinsockPacketEditor/ClassObject/InstructionInfo.cs:4— `InstructionInfo` is not registered, but `Robot` creates it and keeps it in the static `editInstruction`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_InstType, _InstContent; e.g. `_InstType` at line 16).
Stateful shared instance: WareHouseInfo WinsockPacketEditor/ClassObject/WareHouseInfo.cs:6— `WareHouseInfo` is not registered, but `WareHouse` creates it and keeps it in the static `List.lstWareHouseInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_WID, _WName, _Stores; e.g. `_WID` at line 18).
Stateful shared instance: AutoStoresInfo WinsockPacketEditor/ClassObject/AutoStoresInfo.cs:5— `AutoStoresInfo` is not registered, but `WareHouse` creates it and keeps it in the static `List.lstAutoStoresInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _PacketHead, _WID; e.g. `_IsEnable` at line 17).
Stateful shared instance: ServerInfo WinsockPacketEditor/ClassObject/ServerInfo.cs:6— `ServerInfo` is not registered, but `ServerList` creates it and keeps it in the static `lstServerInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_IsEnable, _SID, _ServerName, _ServerIP, _ServerPort, _ForgotURL; e.g. `_IsEnable` at line 18).
Stateful shared instance: NoticeInfo WinsockPacketEditor/ClassObject/NoticeInfo.cs:5— `NoticeInfo` is not registered, but `NoticeList` creates it and keeps it in the static `lstNoticeInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_NID, _NoticeType, _NoticeTitle, _NoticeContent, _NoticeMore, _NoticeTime; e.g. `_NID` at line 17).
Stateful shared instance: LogInfo WinsockPacketEditor/ClassObject/LogInfo.cs:5— `LogInfo` is not registered, but `Queue` creates it and keeps it in the static `cqLogInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_LogTime, _FuncName, _LogContent; e.g. `_LogTime` at line 17).
Stateful shared instance: FilterLogInfo WinsockPacketEditor/ClassObject/FilterLogInfo.cs:5— `FilterLogInfo` is not registered, but `Queue` creates it and keeps it in the static `cqFilterLogInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_LogTime, _FName, _FAction, _MatchNum, _PacketType, _PacketLen; e.g. `_LogTime` at line 17).
Stateful shared instance: ProxyLogInfo WinsockPacketEditor/ClassObject/ProxyLogInfo.cs:5— `ProxyLogInfo` is not registered, but `Queue` creates it and keeps it in the static `cqProxyLogInfo`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_LogTime, _UserName, _LoginIP, _LogContent; e.g. `_LogTime` at line 17).
Stateful shared instance: WpeCore WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:29— `WpeCore` keeps one instance of itself in the static `_instance`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_ctl, _pkt, _evt, _lastPingTick, _writerThread, _controlThread; e.g. `_ctl` at line 157).
Stateful shared instance: WinSockHook WinsockPacketEditor/ClassObject/WinSockHook.cs:8— `WinSockHook` is not registered, but the singleton `WpeCore` creates it and keeps it in `_hook`, so one instance outlives every request and is shared by every caller that reaches it — and it mutates instance state outside any lock (InstalledCount, lhWS1_Send, lhWS1_SendTo, lhWS1_Recv, lhWS1_RecvFrom, lhWS2_Send; e.g. `InstalledCount` at line 94).
Dead code: RunEncode REDACTED:58— Method RunEncode — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: ClearScope WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:40— Method ClearScope — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: IsWow64Process WinsockPacketEditor/NativeMethods/Kernel32.cs:13— Method IsWow64Process — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GetForegroundWindow WinsockPacketEditor/NativeMethods/User32.cs:52— Method GetForegroundWindow — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: WSAWaitForMultipleEvents WinsockPacketEditor/NativeMethods/WS2_32.cs:33— Method WSAWaitForMultipleEvents — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: WSACreateEvent WinsockPacketEditor/NativeMethods/WS2_32.cs:46— Method WSACreateEvent — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GetUDPIPString REDACTED:2155— Method GetUDPIPString — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: NormalizeAppointPorts REDACTED:5888— Method NormalizeAppointPorts — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: IsLocalProxyAddress REDACTED:6146— Method IsLocalProxyAddress — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: PortOfAddress REDACTED:9635— Method PortOfAddress — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: PortOfUrl REDACTED:9659— Method PortOfUrl — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: MarshalFromNative REDACTED:16420— Method MarshalFromNative — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: MarshalToNative REDACTED:16427— Method MarshalToNative — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: KindLabel REDACTED:19010— Method KindLabel — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GetDecoder_ByIdString REDACTED:19418— Method GetDecoder_ByIdString — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: SendListItem REDACTED:25269— NamedType SendListItem — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GetSendRows REDACTED:25626— Method GetSendRows — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GetRobotRows REDACTED:27784— Method GetRobotRows — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GetWareHouseRows REDACTED:29306— Method GetWareHouseRows — Roslyn's SymbolFinder walked every project the solution loads, including WinsockPacketEditor, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: Diag tests/WPEHookTest/Matrix.cs:252— Method Diag — Roslyn's SymbolFinder walked every project the solution loads, including WPEHookTest, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: BackupExportInput WPEMcpServer/WpeTools.cs:352— NamedType BackupExportInput — Roslyn's SymbolFinder walked every project the solution loads, including WPEMcpServer, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: CaptureExportInput WPEMcpServer/WpeTools.cs:358— NamedType CaptureExportInput — Roslyn's SymbolFinder walked every project the solution loads, including WPEMcpServer, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: FilterFileInput WPEMcpServer/WpeTools.cs:359— NamedType FilterFileInput — Roslyn's SymbolFinder walked every project the solution loads, including WPEMcpServer, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: ProxyFailuresListInput WPEMcpServer/WpeTools.cs:366— NamedType ProxyFailuresListInput — Roslyn's SymbolFinder walked every project the solution loads, including WPEMcpServer, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
MethodTooLong: ShellForm.RegisterMethods WinsockPacketEditor/ShellForm.cs:1347— MethodTooLong — RegisterMethods runs 1881 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1781 over it, 18.81× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: L10nEn.Build WinsockPacketEditor/ClassObject/L10n/L10nEn.cs:16— MethodTooLong — Build runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: L10nJa.Build WinsockPacketEditor/ClassObject/L10n/L10nJa.cs:16— MethodTooLong — Build runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: L10nKo.Build WinsockPacketEditor/ClassObject/L10n/L10nKo.cs:16— MethodTooLong — Build runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: L10nRu.Build WinsockPacketEditor/ClassObject/L10n/L10nRu.cs:16— MethodTooLong — Build runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: L10nTw.Build WinsockPacketEditor/ClassObject/L10n/L10nTw.cs:21— MethodTooLong — Build runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: L10nVi.Build WinsockPacketEditor/ClassObject/L10n/L10nVi.cs:16— MethodTooLong — Build runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ShellForm.HandleMcpShellActionAsync WinsockPacketEditor/ShellForm.cs:6711— MethodTooLong — HandleMcpShellActionAsync runs 272 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 172 over it, 2.72× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DataBase.InsertTable_SystemConfig REDACTED:32984— MethodTooLong — InsertTable_SystemConfig runs 218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 118 over it, 2.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SystemConfig.SetSystemConfig_FromXML REDACTED:3626— MethodTooLong — SetSystemConfig_FromXML runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RobotExecute.Robot_Body WinsockPacketEditor/ClassObject/RobotExecute.cs:128— MethodTooLong — Robot_Body runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SystemConfig.ImportSystemBackUp_FromXDocument REDACTED:5189— MethodTooLong — ImportSystemBackUp_FromXDocument runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Filter.DoFilterCore REDACTED:21318— MethodTooLong — DoFilterCore runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DataBase.InsertTable_ProxyMode REDACTED:33581— MethodTooLong — InsertTable_ProxyMode runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SystemConfig.ExtractData REDACTED:2811— MethodTooLong — ExtractData runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SystemConfig.SetProxyMode_FromXML REDACTED:4431— MethodTooLong — SetProxyMode_FromXML runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: List.LoadFilterList_FromXDocument REDACTED:23775— MethodTooLong — LoadFilterList_FromXDocument runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Robot.GetContentString_ByInstructionType REDACTED:26487— MethodTooLong — GetContentString_ByInstructionType runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: WpeCore.Dispatch WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:788— MethodTooLong — Dispatch runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SystemConfig.LoadSystemConfig_FromDB REDACTED:3437— MethodTooLong — LoadSystemConfig_FromDB runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DataBase.InsertTable_Filter REDACTED:33910— MethodTooLong — InsertTable_Filter runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: List.SaveFilterEdit REDACTED:22883— MethodTooLong — SaveFilterEdit runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
TooManyMethods: McpAgentGateway WinsockPacketEditor/Mcp/McpAgentGateway.cs— TooManyMethods — 1760 significant lines (blank, comment-only and punctuation-only lines excluded), 175 methods. The bar is 30 methods; this is 145 over it, 5.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Proxy REDACTED— TooManyMethods — 2535 significant lines (blank, comment-only and punctuation-only lines excluded), 160 methods. The bar is 30 methods; this is 130 over it, 5.33× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: SystemConfig REDACTED— TooManyMethods — 2683 significant lines (blank, comment-only and punctuation-only lines excluded), 103 methods. The bar is 30 methods; this is 73 over it, 3.43× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: DataBase REDACTED— TooManyMethods — 2281 significant lines (blank, comment-only and punctuation-only lines excluded), 97 methods. The bar is 30 methods; this is 67 over it, 3.23× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: ShellForm WinsockPacketEditor/ShellForm.cs— TooManyMethods — 3174 significant lines (blank, comment-only and punctuation-only lines excluded), 87 methods. The bar is 30 methods; this is 57 over it, 2.90× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Account REDACTED— TooManyMethods — 1129 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 30 methods; this is 39 over it, 2.30× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: Filter REDACTED— TooManyMethods — 1338 significant lines (blank, comment-only and punctuation-only lines excluded), 64 methods. The bar is 30 methods; this is 34 over it, 2.13× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: List REDACTED— TooManyMethods — 765 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: Mapping REDACTED— TooManyMethods — 734 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 30 methods; this is 24 over it, 1.80× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: CodecEngine REDACTED— TooManyMethods — 401 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: ShellLink WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs— TooManyMethods — 381 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DecoderConfig REDACTED— TooManyMethods — 421 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: WpeLog WinsockPacketEditor/ClassObject/WpeLogFactory.cs— TooManyMethods — 59 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: List REDACTED— TooManyMethods — 802 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: Send REDACTED— TooManyMethods — 476 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: WpeCore WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs— TooManyMethods — 481 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: WinSockHook WinsockPacketEditor/ClassObject/WinSockHook.cs— TooManyMethods — 642 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ServerList REDACTED— TooManyMethods — 426 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: List REDACTED— TooManyMethods — 397 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: List REDACTED— TooManyMethods — 334 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
No authorization — No [Authorize]/policies and no imperative guard methods (throw-on-violation) were found — endpoints may be unprotected.
No authorization REDACTED:74— `ProxyAccount_Controller.GetProxyAccountList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:89— `ProxyAccount_Controller.GetProxyAccountByID` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:111— `ProxyAccount_Controller.GetPlainPassword` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:130— `ProxyAccount_Controller.GetPassWordDecrypt` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:142— `ProxyAccount_Controller.AddProxyAccount` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:190— `ProxyAccount_Controller.DeleteProxyAccount` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:211— `ProxyAccount_Controller.UpdateProxyAccount` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:14— `ProxyCap_Controller.GetServerList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:25— `ProxyCap_Controller.GetNoticeList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:18— `ProxyInfo_Controller.GetProxyInfo` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:50— `ProxyInfo_Controller.GetProxyAuthList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:70— `ProxyInfo_Controller.GetProxyLogList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:22— `SocketInfo_Controller.GetSocketInfo` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:62— `SocketInfo_Controller.GetSocketLogList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:74— `SocketInfo_Controller.GetProxyLogList` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:18— `SystemInfo_Controller.GetCPUAndMemory` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:37— `SystemInfo_Controller.GetStartTime` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
No authorization REDACTED:49— `SystemInfo_Controller.GetSelectMode` serves requests and nothing authorizes it: no [Authorize] or RequireAuthorization on it or its controller/group, no fallback policy, no auth-gate middleware and no imperative guard in this codebase.
Hotspot: WinsockPacketEditor/ShellForm.cs WinsockPacketEditor/ShellForm.cs:1347— WinsockPacketEditor/ShellForm.cs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 596 in ShellForm.RegisterMethods at line 1347. 5 of those changes were fix/bug commits, and the other 68 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/ShellForm.cs`: 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: REDACTED REDACTED:3626— REDACTED changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in SystemConfig.SetSystemConfig_FromXML at line 3626. 9 of those changes were fix/bug commits, and the other 81 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- REDACTED`: 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: WinsockPacketEditor/Mcp/McpAgentGateway.cs WinsockPacketEditor/Mcp/McpAgentGateway.cs:220— WinsockPacketEditor/Mcp/McpAgentGateway.cs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in McpAgentGateway.DispatchAsync at line 220. 4 of those changes were fix/bug commits, and the other 14 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/Mcp/McpAgentGateway.cs`: 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: WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:597— WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in onMenuPick at line 597. 2 of those changes were fix/bug commits, and the other 29 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue`: 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: WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:647— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in onMenuPick at line 647. 1 of those changes was a fix/bug commit, and the other 25 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue`: 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: WinsockPacketEditor/ClassObject/RobotExecute.cs WinsockPacketEditor/ClassObject/RobotExecute.cs:128— WinsockPacketEditor/ClassObject/RobotExecute.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in RobotExecute.Robot_Body at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/ClassObject/RobotExecute.cs`: 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: WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:788— WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in WpeCore.Dispatch at line 788. 1 of those changes was a fix/bug commit, and the other 7 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs`: 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: WinsockPacketEditor/WebUI/src/components/proxy/Transcode.vue WinsockPacketEditor/WebUI/src/components/proxy/Transcode.vue:94— WinsockPacketEditor/WebUI/src/components/proxy/Transcode.vue changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in transform at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebUI/src/components/proxy/Transcode.vue`: 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: WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue:50— WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in zhDescription at line 50. 3 of those changes were fix/bug commits, and the other 9 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue`: 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: WinsockPacketEditor/ClassObject/ProxySession.cs WinsockPacketEditor/ClassObject/ProxySession.cs:574— WinsockPacketEditor/ClassObject/ProxySession.cs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ProxySession.ProcessUdpReceive at line 574. 1 of those changes was a fix/bug commit, and the other 9 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/ClassObject/ProxySession.cs`: 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: WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:643— WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ShellLink.ApplyStats at line 643. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs`: 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: WinsockPacketEditor/WebUI/src/components/HexPanel.vue WinsockPacketEditor/WebUI/src/components/HexPanel.vue:209— WinsockPacketEditor/WebUI/src/components/HexPanel.vue changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in onPick at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebUI/src/components/HexPanel.vue`: 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: WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:866— WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in save at line 866. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue`: 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: WinsockPacketEditor/ClassObject/WinSockHook.cs WinsockPacketEditor/ClassObject/WinSockHook.cs:107— WinsockPacketEditor/ClassObject/WinSockHook.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in WinSockHook.StartHook at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/ClassObject/WinSockHook.cs`: 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: WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:86— WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MihomoKernel.Start at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs`: 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: WinsockPacketEditor/WebAPI/Socket_Web.cs WinsockPacketEditor/WebAPI/Socket_Web.cs:35— WinsockPacketEditor/WebAPI/Socket_Web.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Socket_Web.Configuration at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebAPI/Socket_Web.cs`: 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.
P8 · Schema migrations· Schema created by a CREATE TABLE statement outside the migrations · ×16
Schema created by a CREATE TABLE statement outside the migrations REDACTED:32740— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:33278— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:33456— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:33753— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:33807— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:34240— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:34482— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:34729— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:35010— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:35200— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:35799— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:35944— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:36098— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:36243— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:36388— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
Schema created by a CREATE TABLE statement outside the migrations REDACTED:36694— This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them — structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead.
AX2 · Stateful singletons· Process-global static state · ×13
Process-global static state: ShellForm WinsockPacketEditor/ShellForm.cs:32— `ShellForm` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (envTask; e.g. `envTask` at line 132). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: FeedPump WinsockPacketEditor/ClassObject/FeedPump.cs:35— `FeedPump` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (attached; e.g. `attached` at line 65). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: UI WinsockPacketEditor/ClassObject/Ui/UI.cs:27— `UI` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Host, L10n, Feed; e.g. `Host` at line 75). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: SystemConfig REDACTED:40— `SystemConfig` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (HotKey1, HotKey2, HotKey3, HotKey4, HotKey5, HotKey6; e.g. `HotKey1` at line 937). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Proxy REDACTED:5795— `Proxy` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (mustTCP_AppointPortContent, mustTCP_AppointPorts, lastProcessList, selfProcessId, selfModuleName, Enable_Mihomo; e.g. `mustTCP_AppointPortContent` at line 5850). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Mapping REDACTED:14877— `Mapping` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Enable_MapLocal, Enable_MapRemote; e.g. `Enable_MapLocal` at line 15726). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: List REDACTED:17445— `List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (piSelect; e.g. `piSelect` at line 17572). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Send REDACTED:24035— `Send` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (editSID, editCollection; e.g. `editSID` at line 24925). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: List REDACTED:25206— `List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (sendListCts, sendListTask; e.g. `sendListCts` at line 25346). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Robot REDACTED:26233— `Robot` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (editHooked, editRID, editInstruction, LastBadIndex; e.g. `editHooked` at line 27015). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: List REDACTED:27458— `List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (robotListCts, robotListTask; e.g. `robotListCts` at line 27524). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: List REDACTED:28602— `List` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (savedSeq; e.g. `savedSeq` at line 28683). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: DataBase REDACTED:32634— `DataBase` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (conStr; e.g. `conStr` at line 32692). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
X18 · Disposal-pattern correctness· Disposable created and abandoned in the method that made it · ×11
Disposable created and abandoned in the method that made it REDACTED:34321— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34321). Every use of it in `SelectTable_SendCollection` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:34348— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34348). Every use of it in `SelectTable_SendCollection` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:34556— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34556). Every use of it in `SelectTable_RobotInstruction` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:34583— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34583). Every use of it in `SelectTable_RobotInstruction` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:34801— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34801). Every use of it in `SelectTable_WareHouseData` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:34828— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 34828). Every use of it in `SelectTable_WareHouseData` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:35319— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 35319). Every use of it in `SelectTable_ProxyAccountIPInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:35346— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 35346). Every use of it in `SelectTable_ProxyAccountIPInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:36470— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 36470). Every use of it in `SelectTable_ServerRuleInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it REDACTED:36497— `adapter` is a `SqliteDataAdapter`, which implements `IDisposable`, and it is created here (line 36497). Every use of it in `SelectTable_ServerRuleInfo` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var adapter = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it WinsockPacketEditor/ShellForm.cs:555— `c` is a `TcpClient`, which implements `IDisposable`, and it is created here (line 555). Every use of it in `IsDevServerUp` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var c = …;`), which releases it at the end of the scope on every path including a throw.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:497— `catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:569— `catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:752— `catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:948— `catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:951— `catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) REDACTED:144— `catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) REDACTED:640— `catch` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/ProxySession.cs:330— `catch (ObjectDisposedException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/ProxySession.cs:423— `catch (ObjectDisposedException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) WinsockPacketEditor/ClassObject/ProxySession.cs:498— `catch (ObjectDisposedException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
async void method: OnWebMessage WinsockPacketEditor/Bridge/WebBridge.cs:94— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: OnLog WinsockPacketEditor/ClassObject/Core/HookHost.cs:106— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: OnFilterLog WinsockPacketEditor/ClassObject/Core/HookHost.cs:112— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: InitCPUAndMemoryCounter REDACTED:329— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: AddToWhiteList REDACTED:9871— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: AddToBlackList REDACTED:10319— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: LoadWhiteList_FromDB REDACTED:10839— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: LoadBlackList_FromDB REDACTED:10870— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
async void method: OnLoad WinsockPacketEditor/ShellForm.cs:353— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
Duplicated block (5 lines × 2) REDACTED:16587— REDACTED:16587-16591 | REDACTED:17140-17144 — 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 `REDACTED:16587` 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 (5 lines × 2) WinsockPacketEditor/ShellForm.cs:5120— WinsockPacketEditor/ShellForm.cs:5120-5124 | WinsockPacketEditor/ShellForm.cs:5130-5134 — 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 `WinsockPacketEditor/ShellForm.cs:5120` 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 (5 lines × 2) WinsockPacketEditor/ShellForm.cs:6776— WinsockPacketEditor/ShellForm.cs:6776-6780 | WinsockPacketEditor/ShellForm.cs:6891-6895 — 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 `WinsockPacketEditor/ShellForm.cs:6776` 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 (5 lines × 2) REDACTED:330— REDACTED:330-334 | WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:99-103 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (5 lines × 2) WinsockPacketEditor/ShellForm.cs:1393— WinsockPacketEditor/ShellForm.cs:1393-1397 | WinsockPacketEditor/ShellForm.cs:1404-1408 — 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 `WinsockPacketEditor/ShellForm.cs:1393` 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 (5 lines × 2) WinsockPacketEditor/ShellForm.cs:6835— WinsockPacketEditor/ShellForm.cs:6835-6839 | WinsockPacketEditor/ShellForm.cs:6946-6950 — 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 `WinsockPacketEditor/ShellForm.cs:6835` 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. 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 (5 lines × 2) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:836— WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:836-840 | WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:275-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (5 lines × 2) REDACTED:725— REDACTED:725-729 | WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:203-207 — 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 (14 lines × 2) WinsockPacketEditor/ShellForm.cs:4243— WinsockPacketEditor/ShellForm.cs:4243-4256 | WinsockPacketEditor/ShellForm.cs:4298-4311 — 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 `WinsockPacketEditor/ShellForm.cs:4243` 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) REDACTED:24843— REDACTED:24843-24856 | REDACTED:26194-26207 — 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 `REDACTED:24843` 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 (14 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:286— WinsockPacketEditor/ClassObject/WinSockHook.cs:286-299 | WinsockPacketEditor/ClassObject/WinSockHook.cs:452-465 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:286` 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) WinsockPacketEditor/NativeMethods/WS2_32.cs:110— WinsockPacketEditor/NativeMethods/WS2_32.cs:110-123 | WinsockPacketEditor/NativeMethods/WSock32.cs:14-27 — before extracting anything, compare `WinsockPacketEditor/NativeMethods/WS2_32.cs` and `WinsockPacketEditor/NativeMethods/WSock32.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 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.
Duplicated block (14 lines × 2) WinsockPacketEditor/NativeMethods/WS2_32.cs:140— WinsockPacketEditor/NativeMethods/WS2_32.cs:140-153 | WinsockPacketEditor/NativeMethods/WSock32.cs:44-57 — before extracting anything, compare `WinsockPacketEditor/NativeMethods/WS2_32.cs` and `WinsockPacketEditor/NativeMethods/WSock32.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 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.
Duplicated block (14 lines × 2) REDACTED:11641— REDACTED:11641-11654 | REDACTED:17618-17631 — 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 `REDACTED:11641` 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.
Duplicated block (14 lines × 2) REDACTED:11680— REDACTED:11680-11693 | REDACTED:17657-17670 — 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 `REDACTED:11680` 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.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×6
Untrusted text written into markup unescaped WinsockPacketEditor/WebUI/src/components/ContextMenu.vue:136— `it.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped WinsockPacketEditor/WebUI/src/components/ContextMenu.vue:152— `s.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped WinsockPacketEditor/WebUI/src/components/ToastStack.vue:46— `ICON[x.level]` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped WinsockPacketEditor/WebUI/src/components/proxy/ProxySide.vue:127— `p.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:640— `b.icon` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:797— `I[r.Type === IT.LoopStart ? 'loopStart' : r.Type === IT.LoopEnd ? 'loopEnd' : r.Type === IT.Delay ? 'delay' : r.Type === IT.Switch ? 'switch' : r.Type === IT.KeyBoard ? 'key' : r.Type === IT.Mouse ? 'mkey' : r.Type === IT.SetSystemSocket ? 'sock' : 'send']` is text this program did not author, and it is written into the text of an element through Vue's `v-html` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
FileTooLong: REDACTED REDACTED— FileTooLong — 17421 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16921 over it, 34.84× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: WinsockPacketEditor/ShellForm.cs WinsockPacketEditor/ShellForm.cs— FileTooLong — 3211 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2711 over it, 6.42× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Mcp/McpAgentGateway.cs WinsockPacketEditor/Mcp/McpAgentGateway.cs— FileTooLong — 1793 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1293 over it, 3.59× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ClassObject/WinSockHook.cs WinsockPacketEditor/ClassObject/WinSockHook.cs— FileTooLong — 647 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 147 over it, 1.29× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Ui/FeedRows.cs WinsockPacketEditor/ClassObject/Ui/FeedRows.cs— FileTooLong — 605 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 105 over it, 1.21× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×5
Edited copy of a member (12 corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:471— WinsockPacketEditor/Mcp/McpAgentGateway.cs:471-482 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:484-495 — 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.
Edited copy of a member (12 corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:2143— WinsockPacketEditor/Mcp/McpAgentGateway.cs:2143-2154 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:2157-2168 — 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.
Edited copy of a member (12 corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1601— WinsockPacketEditor/Mcp/McpAgentGateway.cs:1601-1612 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:1694-1711 — 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.
Edited copy of a member (12 corresponding lines) WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:106— WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:106-117 | WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:120-131 — 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.
Edited copy of a member (12 corresponding lines) WinsockPacketEditor/ClassObject/RobotExecute.cs:103— WinsockPacketEditor/ClassObject/RobotExecute.cs:103-114 | WinsockPacketEditor/ClassObject/SendExecute.cs:94-105 — 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 (4 corresponding lines) · ×5
Edited copy of a member (4 corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:633— WinsockPacketEditor/Mcp/McpAgentGateway.cs:633-636 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:638-641 — 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.
Edited copy of a member (4 corresponding lines) REDACTED:614— REDACTED:614-617 | REDACTED:620-627 — 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.
Edited copy of a member (4 corresponding lines) WinsockPacketEditor/ClassObject/HttpSniffer.cs:213— WinsockPacketEditor/ClassObject/HttpSniffer.cs:213-216 | REDACTED:8840-8847 — 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.
Edited copy of a member (4 corresponding lines) WinsockPacketEditor/NativeMethods/WS2_32.cs:197— WinsockPacketEditor/NativeMethods/WS2_32.cs:197-200 | WinsockPacketEditor/NativeMethods/WSock32.cs:101-104 — 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.
Edited copy of a member (4 corresponding lines) WinsockPacketEditor/NativeMethods/WS2_32.cs:234— WinsockPacketEditor/NativeMethods/WS2_32.cs:234-237 | WinsockPacketEditor/NativeMethods/WSock32.cs:138-141 — 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· Edited copy of a member (14 corresponding lines) · ×5
Edited copy of a member (14 corresponding lines) REDACTED:1682— REDACTED:1682-1698 | REDACTED:1709-1722 — 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.
Edited copy of a member (14 corresponding lines) REDACTED:28297— REDACTED:28297-28311 | REDACTED:28334-28347 — 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.
Edited copy of a member (14 corresponding lines) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:491— WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:491-504 | WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:563-576 — 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.
Edited copy of a member (14 corresponding lines) WinsockPacketEditor/ClassObject/PacketInfo.cs:254— WinsockPacketEditor/ClassObject/PacketInfo.cs:254-267 | WinsockPacketEditor/ClassObject/ProxyInfo.cs:298-314 — 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.
Edited copy of a member (14 corresponding lines) REDACTED:15069— REDACTED:15069-15082 | REDACTED:15098-15121 — 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.
Duplicated block (19 lines × 2) REDACTED:24782— REDACTED:24782-24800 | REDACTED:24825-24843 — 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 (19 lines × 2) REDACTED:36099— REDACTED:36099-36117 | REDACTED:36244-36262 — 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 `REDACTED:36099` 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.
Duplicated block (19 lines × 2) WinsockPacketEditor/NativeMethods/WS2_32.cs:170— WinsockPacketEditor/NativeMethods/WS2_32.cs:170-188 | WinsockPacketEditor/NativeMethods/WSock32.cs:74-92 — before extracting anything, compare `WinsockPacketEditor/NativeMethods/WS2_32.cs` and `WinsockPacketEditor/NativeMethods/WSock32.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 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.
Duplicated block (19 lines × 2) WinsockPacketEditor/NativeMethods/WS2_32.cs:207— WinsockPacketEditor/NativeMethods/WS2_32.cs:207-225 | WinsockPacketEditor/NativeMethods/WSock32.cs:111-129 — before extracting anything, compare `WinsockPacketEditor/NativeMethods/WS2_32.cs` and `WinsockPacketEditor/NativeMethods/WSock32.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 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.
Duplicated block (19 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:719— WinsockPacketEditor/ClassObject/WinSockHook.cs:719-737 | WinsockPacketEditor/ClassObject/WinSockHook.cs:944-962 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:719` 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, `WinsockPacketEditor/ClassObject/WinSockHook.cs:943` calls `ReadAddress`, `ReadInt32` and `WinsockPacketEditor/ClassObject/WinSockHook.cs:718` does not — after which the two agree again for 4 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.
Sync-over-async blocking — 4 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:210— `_shutdown.Wait()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:232— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:234— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:7645— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
SC1 · Supply-chain hygiene· NuGet dependencies are not locked · ×5
NuGet dependencies are not locked WPEHook/packages.config:3— WPEHook/packages.config declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
NuGet dependencies are not locked WPEMcpServer/WPEMcpServer.csproj:14— WPEMcpServer/WPEMcpServer.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
NuGet dependencies are not locked WinsockPacketEditor/WinsockPacketEditor.csproj:87— WinsockPacketEditor/WinsockPacketEditor.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
NuGet dependencies are not locked tests/PacketUnpackTest/PacketUnpackTest.csproj:13— tests/PacketUnpackTest/PacketUnpackTest.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
NuGet dependencies are not locked tests/WPEHookTest/WPEHookTest.csproj:41— tests/WPEHookTest/WPEHookTest.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×4
Edited copy of a member (25 corresponding lines) REDACTED:10840— REDACTED:10840-10864 | REDACTED:10871-10895 — These two members are one piece of code written twice and then edited apart: 25 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.
Edited copy of a member (25 corresponding lines) REDACTED:11777— REDACTED:11777-11801 | REDACTED:17754-17778 — These two members are one piece of code written twice and then edited apart: 25 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.
Edited copy of a member (25 corresponding lines) REDACTED:12764— REDACTED:12764-12789 | REDACTED:12796-12820 — These two members are one piece of code written twice and then edited apart: 25 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.
Edited copy of a member (25 corresponding lines) REDACTED:13417— REDACTED:13417-13441 | REDACTED:13448-13472 — These two members are one piece of code written twice and then edited apart: 25 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) · ×4
Edited copy of a member (22 corresponding lines) REDACTED:11636— REDACTED:11636-11657 | REDACTED:17613-17634 — 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.
Edited copy of a member (22 corresponding lines) REDACTED:21939— REDACTED:21939-21960 | REDACTED:22078-22101 — 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.
Edited copy of a member (22 corresponding lines) REDACTED:13248— REDACTED:13248-13269 | REDACTED:22374-22395 — 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.
Edited copy of a member (22 corresponding lines) REDACTED:24629— REDACTED:24629-24650 | REDACTED:30047-30068 — 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 (20 corresponding lines) · ×4
Edited copy of a member (20 corresponding lines) REDACTED:16906— REDACTED:16906-16925 | REDACTED:16932-16951 — These two members are one piece of code written twice and then edited apart: 20 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.
Edited copy of a member (20 corresponding lines) REDACTED:11607— REDACTED:11607-11626 | REDACTED:17584-17603 — These two members are one piece of code written twice and then edited apart: 20 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.
Edited copy of a member (20 corresponding lines) REDACTED:25604— REDACTED:25604-25623 | REDACTED:29721-29740 — These two members are one piece of code written twice and then edited apart: 20 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.
Edited copy of a member (20 corresponding lines) REDACTED:12145— REDACTED:12145-12164 | REDACTED:18096-18115 — These two members are one piece of code written twice and then edited apart: 20 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.
Duplicated block (12 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/InjectView.vue:217— WinsockPacketEditor/WebUI/src/components/InjectView.vue:217 · WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue:171 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (12 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:65— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:65 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:764 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (12 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/MapLocalEdit.vue:58— WinsockPacketEditor/WebUI/src/components/proxy/MapLocalEdit.vue:58 · WinsockPacketEditor/WebUI/src/components/proxy/MapRemoteEdit.vue:71 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (12 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:202— WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:202 · WinsockPacketEditor/WebUI/src/components/proxy/WpcConfig.vue:56 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (11 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:181— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:181 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:724 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (11 lines × 2 locations) REDACTED:86— REDACTED:86 · WinsockPacketEditor/WebUI/src/components/proxy/RuleList.vue:137 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
Duplicated block (11 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:507— WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:507 · WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:541 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (11 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:551— WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:551 · WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:295 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (10 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:97— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:97 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:81 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (10 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/ExtProxySetting.vue:50— WinsockPacketEditor/WebUI/src/components/proxy/ExtProxySetting.vue:50 · WinsockPacketEditor/WebUI/src/components/proxy/RemoteSetting.vue:50 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (10 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:117— WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:117 · WinsockPacketEditor/WebUI/src/components/proxy/StatData.vue:129 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:288— WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:288 · WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:188 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) WinsockPacketEditor/ClassObject/WinSockHook.cs:351— WinsockPacketEditor/ClassObject/WinSockHook.cs:351-404 | WinsockPacketEditor/ClassObject/WinSockHook.cs:521-571 | WinsockPacketEditor/ClassObject/WinSockHook.cs:705-847 | WinsockPacketEditor/ClassObject/WinSockHook.cs:929-1072 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:14525— REDACTED:14525-14742 | REDACTED:23776-24019 | REDACTED:26126-26217 | REDACTED:28215-28256 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:34335— REDACTED:34335-34359 | REDACTED:34570-34594 | REDACTED:34815-34839 | REDACTED:35333-35357 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×3
Edited copy of a member (23 corresponding lines) WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:28— WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:28-62 | WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:66-88 — 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.
Edited copy of a member (23 corresponding lines) REDACTED:25332— REDACTED:25332-25359 | REDACTED:27515-27537 — 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.
Edited copy of a member (23 corresponding lines) REDACTED:9762— REDACTED:9762-9784 | REDACTED:9805-9827 — 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 (28 corresponding lines) · ×3
Edited copy of a member (28 corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1015— WinsockPacketEditor/Mcp/McpAgentGateway.cs:1015-1042 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:1216-1243 — These two members are one piece of code written twice and then edited apart: 28 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.
Edited copy of a member (28 corresponding lines) REDACTED:1354— REDACTED:1354-1381 | REDACTED:1384-1420 — These two members are one piece of code written twice and then edited apart: 28 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.
Edited copy of a member (28 corresponding lines) REDACTED:31054— REDACTED:31054-31081 | REDACTED:31088-31117 — These two members are one piece of code written twice and then edited apart: 28 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 (21 corresponding lines) · ×3
Edited copy of a member (21 corresponding lines) WinsockPacketEditor/ClassObject/L10n/L10n.cs:77— WinsockPacketEditor/ClassObject/L10n/L10n.cs:77-102 | WinsockPacketEditor/ShellForm.cs:6232-6252 — These two members are one piece of code written twice and then edited apart: 21 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.
Edited copy of a member (21 corresponding lines) REDACTED:14089— REDACTED:14089-14109 | REDACTED:14116-14136 — These two members are one piece of code written twice and then edited apart: 21 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.
Edited copy of a member (21 corresponding lines) REDACTED:13928— REDACTED:13928-13948 | REDACTED:13960-13980 — These two members are one piece of code written twice and then edited apart: 21 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) · ×3
Edited copy of a member (6 corresponding lines) REDACTED:329— REDACTED:329-334 | WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:98-103 — 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.
Edited copy of a member (6 corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:2492— WinsockPacketEditor/Mcp/McpAgentGateway.cs:2492-2497 | WPEMcpServer/WpeGatewayClient.cs:83-88 — 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.
Edited copy of a member (6 corresponding lines) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:835— WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:835-840 | WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:274-279 — 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.
Duplicated block (11 lines × 2) REDACTED:9962— REDACTED:9962-9972 | REDACTED:10410-10420 — 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 `REDACTED:9962` 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.
Duplicated block (11 lines × 2) WinsockPacketEditor/ClassObject/ProxySession.cs:423— WinsockPacketEditor/ClassObject/ProxySession.cs:423-433 | WinsockPacketEditor/ClassObject/ProxySession.cs:498-508 — 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 `WinsockPacketEditor/ClassObject/ProxySession.cs:423` 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) WinsockPacketEditor/ClassObject/BlackListInfo.cs:145— WinsockPacketEditor/ClassObject/BlackListInfo.cs:145-155 | WinsockPacketEditor/ClassObject/WhiteListInfo.cs:145-155 — before extracting anything, compare `WinsockPacketEditor/ClassObject/BlackListInfo.cs` and `WinsockPacketEditor/ClassObject/WhiteListInfo.cs` as WHOLE FILES: 97% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12 lines × 2) REDACTED:12458— REDACTED:12458-12469 | REDACTED:12503-12514 — 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 `REDACTED:12458` 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, `REDACTED:12471` calls `NormalizeLimit` and `REDACTED:12517` 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 (12 lines × 2) REDACTED:11555— REDACTED:11555-11566 | REDACTED:17445-17456 — 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 `REDACTED:11555` 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 (12 lines × 2) WinsockPacketEditor/ShellForm.cs:6799— WinsockPacketEditor/ShellForm.cs:6799-6810 | WinsockPacketEditor/ShellForm.cs:6898-6909 — 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 `WinsockPacketEditor/ShellForm.cs:6799` 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.
Duplicated block (9 lines × 2) REDACTED:21898— REDACTED:21898-21906 | REDACTED:22203-22211 — 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 `REDACTED:21898` 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.
Duplicated block (9 lines × 2) REDACTED:16164— REDACTED:16164-16172 | REDACTED:16296-16304 — 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 `REDACTED:16164` 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) WinsockPacketEditor/ClassObject/WinSockHook.cs:274— WinsockPacketEditor/ClassObject/WinSockHook.cs:274-282 | WinsockPacketEditor/ClassObject/WinSockHook.cs:440-448 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:274` 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) WinsockPacketEditor/ClassObject/WinSockHook.cs:386— WinsockPacketEditor/ClassObject/WinSockHook.cs:386-393 | WinsockPacketEditor/ClassObject/WinSockHook.cs:553-560 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:386` 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.
Duplicated block (8 lines × 2) REDACTED:5116— REDACTED:5116-5123 | REDACTED:23701-23708 — 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 `REDACTED:5116` 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) WinsockPacketEditor/ClassObject/WinSockHook.cs:374— WinsockPacketEditor/ClassObject/WinSockHook.cs:374-381 | WinsockPacketEditor/ClassObject/WinSockHook.cs:541-548 — 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. 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, `WinsockPacketEditor/ClassObject/WinSockHook.cs:540` calls `ReadAddress`, `ReadInt32` and `WinsockPacketEditor/ClassObject/WinSockHook.cs:373` does not — after which the two agree again for 4 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 (7 lines × 2) WinsockPacketEditor/ClassObject/RobotExecute.cs:487— WinsockPacketEditor/ClassObject/RobotExecute.cs:487-493 | WinsockPacketEditor/ClassObject/RobotExecute.cs:502-508 — 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 `WinsockPacketEditor/ClassObject/RobotExecute.cs:487` 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) WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:253— WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:253-259 | WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:279-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 `WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:253` 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) WinsockPacketEditor/Mcp/McpWriteGuard.cs:77— WinsockPacketEditor/Mcp/McpWriteGuard.cs:77-84 | WinsockPacketEditor/Mcp/McpWriteGuard.cs:104-110 — 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.
Weak hash algorithm WinsockPacketEditor/ClassObject/FileAssociation.cs:282— MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses.
Weak hash algorithm WinsockPacketEditor/ClassObject/HttpsMitmCertificateManager.cs:233— MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses.
Weak hash algorithm REDACTED:1335— MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses.
Sync-over-async (deadlock risk) WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:232— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:234— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) REDACTED:7645— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
List.FlushToFeed (cyclomatic 20) REDACTED:12029— List.FlushToFeed has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.FlushToFeed (cyclomatic 20) REDACTED:17973— List.FlushToFeed has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
ClassTooLong: Robot REDACTED— ClassTooLong — 589 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 189 over it, 1.47× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
ClassTooLong: Packet REDACTED— ClassTooLong — 476 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 76 over it, 1.19× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
D4 · Code Duplication· Edited copy of a member (38 corresponding lines) · ×2
Edited copy of a member (38 corresponding lines) REDACTED:21892— REDACTED:21892-21934 | REDACTED:22198-22235 — These two members are one piece of code written twice and then edited apart: 38 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.
Edited copy of a member (38 corresponding lines) REDACTED:11808— REDACTED:11808-11845 | REDACTED:17785-17822 — These two members are one piece of code written twice and then edited apart: 38 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, 21+ corresponding lines) · ×2
Edited copies of one member (5 members, 21+ corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1097— WinsockPacketEditor/Mcp/McpAgentGateway.cs:1097-1119 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:1122-1144 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:1147-1168 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:1171-1191 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:1884-1905 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 21 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.
Edited copies of one member (5 members, 21+ corresponding lines) REDACTED:34312— REDACTED:34312-34332 | REDACTED:34547-34567 | REDACTED:34792-34812 | REDACTED:35310-35330 | REDACTED:36461-36481 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 21 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 (19 corresponding lines) · ×2
Edited copy of a member (19 corresponding lines) REDACTED:24040— REDACTED:24040-24059 | REDACTED:24219-24237 — 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.
Edited copy of a member (19 corresponding lines) REDACTED:12000— REDACTED:12000-12018 | REDACTED:17518-17537 — 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 copies of one member (3 members, 26+ corresponding lines) · ×2
Edited copies of one member (3 members, 26+ corresponding lines) REDACTED:10982— REDACTED:10982-11008 | REDACTED:11095-11121 | REDACTED:30292-30317 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 26+ corresponding lines) REDACTED:36511— REDACTED:36511-36536 | REDACTED:36618-36647 | REDACTED:36745-36770 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×2
Edited copy of a member (8 corresponding lines) WinsockPacketEditor/ClassObject/WinSockHook.cs:664— WinsockPacketEditor/ClassObject/WinSockHook.cs:664-672 | WinsockPacketEditor/ClassObject/WinSockHook.cs:885-892 — These two members are one piece of code written twice and then edited apart: 8 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.
Edited copy of a member (8 corresponding lines) REDACTED:19029— REDACTED:19029-19038 | REDACTED:19047-19054 — These two members are one piece of code written twice and then edited apart: 8 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) · ×2
Edited copy of a member (10 corresponding lines) WinsockPacketEditor/ClassObject/HttpSniffer.cs:195— WinsockPacketEditor/ClassObject/HttpSniffer.cs:195-204 | REDACTED:8850-8864 — 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.
Edited copy of a member (10 corresponding lines) REDACTED:15687— REDACTED:15687-15696 | REDACTED:15699-15708 — 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 (1 corresponding lines) · ×2
Edited copy of a member (1 corresponding lines) WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:227— WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:227-227 | WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:228-228 — These two members are one piece of code written twice and then edited apart: 1 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.
Edited copy of a member (1 corresponding lines) WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:233— WinsockPacketEditor/ClassObject/HttpsMitmSession.cs:233-233 | WinsockPacketEditor/ClassObject/Socks5ProxyReceiveFilter.cs:136-140 — These two members are one piece of code written twice and then edited apart: 1 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 (3 members, 16+ corresponding lines) · ×2
Edited copies of one member (3 members, 16+ corresponding lines) REDACTED:15128— REDACTED:15128-15143 | REDACTED:15150-15165 | REDACTED:28578-28593 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 16+ corresponding lines) REDACTED:22480— REDACTED:22480-22499 | REDACTED:25703-25722 | REDACTED:27838-27853 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×2
Edited copy of a member (11 corresponding lines) WinsockPacketEditor/ClassObject/WinSockHook.cs:863— WinsockPacketEditor/ClassObject/WinSockHook.cs:863-873 | WinsockPacketEditor/ClassObject/WinSockHook.cs:907-917 — These two members are one piece of code written twice and then edited apart: 11 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.
Edited copy of a member (11 corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:2500— WinsockPacketEditor/Mcp/McpAgentGateway.cs:2500-2510 | WPEMcpServer/WpeGatewayClient.cs:91-101 — These two members are one piece of code written twice and then edited apart: 11 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.
Duplicated block (27 lines × 2) REDACTED:11206— REDACTED:11206-11232 | REDACTED:11326-11352 — 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 `REDACTED:11206` 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 (27 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:801— WinsockPacketEditor/ClassObject/WinSockHook.cs:801-827 | WinsockPacketEditor/ClassObject/WinSockHook.cs:1026-1052 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:801` 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 (22 lines × 2) REDACTED:19925— REDACTED:19925-19946 | REDACTED:20065-20086 — 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 `REDACTED:19925` 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 (22 lines × 2) REDACTED:12054— REDACTED:12054-12075 | REDACTED:17998-18019 — 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 (15 lines × 3) REDACTED:24782— REDACTED:24782-24796 | REDACTED:24825-24839 | REDACTED:26176-26190 — 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 `REDACTED:24782` 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 lines × 3) REDACTED:24496— REDACTED:24496-24510 | REDACTED:26828-26842 | REDACTED:28866-28880 — 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. 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 (16–17 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:730— WinsockPacketEditor/ClassObject/WinSockHook.cs:730-746 | WinsockPacketEditor/ClassObject/WinSockHook.cs:792-807 — 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. 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 (16–17 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:955— WinsockPacketEditor/ClassObject/WinSockHook.cs:955-971 | WinsockPacketEditor/ClassObject/WinSockHook.cs:1017-1032 — 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. 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 (13 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:786— WinsockPacketEditor/ClassObject/WinSockHook.cs:786-798 | WinsockPacketEditor/ClassObject/WinSockHook.cs:1011-1023 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:786` 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.
Duplicated block (13 lines × 2) WinsockPacketEditor/ShellForm.cs:2360— WinsockPacketEditor/ShellForm.cs:2360-2372 | WinsockPacketEditor/ShellForm.cs:4574-4587 — 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 `WinsockPacketEditor/ShellForm.cs:2360` 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.
Duplicated block (6 lines × 2) REDACTED:10849— REDACTED:10849-10854 | REDACTED:10880-10885 — 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) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:201— WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:201-206 | WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:227-232 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (16 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/InjectView.vue:470— WinsockPacketEditor/WebUI/src/components/InjectView.vue:470 · WinsockPacketEditor/WebUI/src/components/InjectView.vue:496 — 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 (16 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/HookSetting.vue:173— WinsockPacketEditor/WebUI/src/components/proxy/HookSetting.vue:173 · WinsockPacketEditor/WebUI/src/components/proxy/LeachSetting.vue:100 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (15 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue:168— WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue:168 · WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:49 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (15 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/ActionColor.vue:87— WinsockPacketEditor/WebUI/src/components/proxy/ActionColor.vue:87 · WinsockPacketEditor/WebUI/src/components/proxy/IPRuleEdit.vue:98 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Complex function onMenuPick (cyclomatic 36, cognitive 49) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:647— onMenuPick has cyclomatic complexity 36 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onMenuPick (cyclomatic 36, cognitive 49) WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:597— onMenuPick has cyclomatic complexity 36 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function findNext (cyclomatic 16, cognitive 18) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:384— findNext has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function findNext (cyclomatic 16, cognitive 18) WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:320— findNext has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
S1 · Web-Security Posture· Ciphertext is encrypted but not authenticated · ×2
Ciphertext is encrypted but not authenticated WinsockPacketEditor/ClassObject/ProtocolDecoder.cs:129— This type encrypts through `SymmetricAlgorithm`, whose every cipher mode (CBC/ECB/OFB/CFB/CTS) is unauthenticated, and no keyed MAC or AEAD cipher appears anywhere in it — so nothing establishes that the ciphertext it produced is the ciphertext it later reads back. Encryption alone provides confidentiality, not integrity: unauthenticated CBC is MALLEABLE, and an attacker who can modify stored or transmitted ciphertext can flip chosen plaintext bits in the following block by flipping ciphertext bits in the preceding one, without ever knowing the key. Where the decrypt path reports failure differently for a padding error than for a downstream one — a broad `catch` that returns null is the usual spelling — the same construction also answers the attacker's questions, which is the padding-oracle shape that recovers plaintext outright. Prefer an AEAD cipher: `AesGcm` or `ChaCha20Poly1305` authenticate the ciphertext as part of encrypting it, and give you an associated-data slot for the surrounding context. Where the format cannot change, MAC it with encrypt-then-MAC — HMAC-SHA256 over the IV and the ciphertext together, with a key derived separately from the encryption key — and verify that tag with `CryptographicOperations.FixedTimeEquals` BEFORE decrypting anything.
Ciphertext is encrypted but not authenticated REDACTED:1368— This type encrypts through `SymmetricAlgorithm`, whose every cipher mode (CBC/ECB/OFB/CFB/CTS) is unauthenticated, and no keyed MAC or AEAD cipher appears anywhere in it — so nothing establishes that the ciphertext it produced is the ciphertext it later reads back. Encryption alone provides confidentiality, not integrity: unauthenticated CBC is MALLEABLE, and an attacker who can modify stored or transmitted ciphertext can flip chosen plaintext bits in the following block by flipping ciphertext bits in the preceding one, without ever knowing the key. Where the decrypt path reports failure differently for a padding error than for a downstream one — a broad `catch` that returns null is the usual spelling — the same construction also answers the attacker's questions, which is the padding-oracle shape that recovers plaintext outright. Prefer an AEAD cipher: `AesGcm` or `ChaCha20Poly1305` authenticate the ciphertext as part of encrypting it, and give you an associated-data slot for the surrounding context. Where the format cannot change, MAC it with encrypt-then-MAC — HMAC-SHA256 over the IV and the ciphertext together, with a key derived separately from the encryption key — and verify that tag with `CryptographicOperations.FixedTimeEquals` BEFORE decrypting anything.
Sync-over-async (deadlock risk) through `.Wait(…)` WinsockPacketEditor/Mcp/McpAgentGateway.cs:70— `.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters).
Sync-over-async (deadlock risk) through `.Wait(…)` WinsockPacketEditor/ShellForm.cs:559— `.Wait(…)` blocks this thread until the task completes or the bound expires — sync-over-async: it can deadlock under a synchronization context and it parks a thread while it waits. `await` the task (with `.WaitAsync(timeout, token)` where the bound matters).
ShellForm.RegisterMethods (cyclomatic 596) WinsockPacketEditor/ShellForm.cs:1347— ShellForm.RegisterMethods has cyclomatic complexity 596 (threshold 15). Most of this is not in the body itself: 3 of the 596 points are its own statements and the rest belongs to 170 function literals inside it that branch (lines 2653, 3140, 2769, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ShellForm.HandleMcpShellActionAsync (cyclomatic 150) WinsockPacketEditor/ShellForm.cs:6711— ShellForm.HandleMcpShellActionAsync has cyclomatic complexity 150 (threshold 15). Of this number, 147 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
McpAgentGateway.DispatchAsync (cyclomatic 96) WinsockPacketEditor/Mcp/McpAgentGateway.cs:220— McpAgentGateway.DispatchAsync has cyclomatic complexity 96 (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.
RobotExecute.Robot_Body (cyclomatic 82) WinsockPacketEditor/ClassObject/RobotExecute.cs:128— RobotExecute.Robot_Body has cyclomatic complexity 82 (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.
SystemConfig.SetSystemConfig_FromXML (cyclomatic 73) REDACTED:3626— SystemConfig.SetSystemConfig_FromXML has cyclomatic complexity 73 (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.
Filter.DoFilterCore (cyclomatic 70) REDACTED:21318— Filter.DoFilterCore has cyclomatic complexity 70 (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.
SystemConfig.SetProxyMode_FromXML (cyclomatic 55) REDACTED:4431— SystemConfig.SetProxyMode_FromXML has cyclomatic complexity 55 (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.
Robot.ValidateInstruction (cyclomatic 49) REDACTED:27121— Robot.ValidateInstruction has cyclomatic complexity 49 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Robot.GetContentString_ByInstructionType (cyclomatic 48) REDACTED:26487— Robot.GetContentString_ByInstructionType has cyclomatic complexity 48 (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.
McpAgentGateway.Dispatch (cyclomatic 44) WinsockPacketEditor/Mcp/McpAgentGateway.cs:162— McpAgentGateway.Dispatch has cyclomatic complexity 44 (threshold 15). Of this number, 42 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Packet.SendPacket (cyclomatic 44) REDACTED:16533— Packet.SendPacket has cyclomatic complexity 44 (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.
List.SaveFilterEdit (cyclomatic 44) REDACTED:22883— List.SaveFilterEdit 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.
CodecEngine.ParseMsgpack (cyclomatic 43) REDACTED:550— CodecEngine.ParseMsgpack has cyclomatic complexity 43 (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.
List.LoadFilterList_FromXDocument (cyclomatic 39) REDACTED:23775— List.LoadFilterList_FromXDocument 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.
SystemConfig.ExportSystemBackUp (cyclomatic 38) REDACTED:4883— SystemConfig.ExportSystemBackUp has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
WpeCore.Dispatch (cyclomatic 36) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:788— WpeCore.Dispatch has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
SystemConfig.BytesToString (cyclomatic 35) REDACTED:1724— SystemConfig.BytesToString 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.
SystemConfig.ImportSystemBackUp_FromXDocument (cyclomatic 35) REDACTED:5189— SystemConfig.ImportSystemBackUp_FromXDocument has cyclomatic complexity 35 (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.
Proxy.ForwardData (cyclomatic 34) REDACTED:7819— Proxy.ForwardData 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.
ShellForm.WndProc (cyclomatic 32) WinsockPacketEditor/ShellForm.cs:952— ShellForm.WndProc has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
List.SearchForList (cyclomatic 30) REDACTED:18127— List.SearchForList 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.
McpAgentGateway.SaveSettingAsync (cyclomatic 29) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1997— McpAgentGateway.SaveSettingAsync has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 2005). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
Account.LoadAccountList_FromXDocument (cyclomatic 29) REDACTED:14524— Account.LoadAccountList_FromXDocument 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.
SystemConfig.ExtractData (cyclomatic 27) REDACTED:2811— SystemConfig.ExtractData has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
PacketEditConfig.StartSend (cyclomatic 27) REDACTED:18784— PacketEditConfig.StartSend has cyclomatic complexity 27 (threshold 15). Of this number, 18 points are the body's own statements and 9 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
PacketVariableEngine.ToBytes (cyclomatic 26) WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:459— PacketVariableEngine.ToBytes has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
WinSockHook.WSARecvFrom_HookCore (cyclomatic 25) WinsockPacketEditor/ClassObject/WinSockHook.cs:919— WinSockHook.WSARecvFrom_HookCore 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.
WinSockHook.WSARecv_HookCore (cyclomatic 24) WinsockPacketEditor/ClassObject/WinSockHook.cs:697— WinSockHook.WSARecv_HookCore has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SystemConfig.SetInjectMode_FromXML (cyclomatic 24) REDACTED:4142— SystemConfig.SetInjectMode_FromXML has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Proxy.ProcessUnpackData (cyclomatic 24) REDACTED:8409— Proxy.ProcessUnpackData has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Send.UpdateSendCollection_ByListAction (cyclomatic 23) REDACTED:24464— Send.UpdateSendCollection_ByListAction has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (List.UpdateStores_ByListAction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.UpdateStores_ByListAction (cyclomatic 23) REDACTED:28834— List.UpdateStores_ByListAction has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (Send.UpdateSendCollection_ByListAction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
HttpSniffer.Feed (cyclomatic 22) WinsockPacketEditor/ClassObject/HttpSniffer.cs:48— HttpSniffer.Feed 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.
ProxySession.ProcessUdpReceive (cyclomatic 22) WinsockPacketEditor/ClassObject/ProxySession.cs:574— ProxySession.ProcessUdpReceive has cyclomatic complexity 22 (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.
McpAgentGateway.GetSetting (cyclomatic 22) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1816— McpAgentGateway.GetSetting 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.
WinSockHook.StartHook (cyclomatic 21) WinsockPacketEditor/ClassObject/WinSockHook.cs:107— WinSockHook.StartHook has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SystemConfig.AnalyzeContinuousDuplicates (cyclomatic 21) REDACTED:2548— SystemConfig.AnalyzeContinuousDuplicates has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Proxy.Socks5FrameLength (cyclomatic 21) REDACTED:8737— Proxy.Socks5FrameLength has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Mapping.ModifyRequestHostAndPath (cyclomatic 21) REDACTED:14906— Mapping.ModifyRequestHostAndPath has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
FrameExtractor.Extract (cyclomatic 20) WinsockPacketEditor/ClassObject/Decoder/FrameExtractor.cs:22— FrameExtractor.Extract 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.
McpAgentGateway.DecoderActionAsync (cyclomatic 20) WinsockPacketEditor/Mcp/McpAgentGateway.cs:2396— McpAgentGateway.DecoderActionAsync has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 2399). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
DecoderConfig.Normalize (cyclomatic 20) REDACTED:19196— DecoderConfig.Normalize has cyclomatic complexity 20 (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. Note what this body is, though: it works in explicit hardware vector and instruction-set types. A kernel divided across a call boundary passes its vectors between the parts and depends on the runtime putting them back together, so the division can cost more than the complexity it removes. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
MihomoKernel.Start (cyclomatic 19) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:86— MihomoKernel.Start 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.
SystemConfig.LoadProxyMode_FromDB (cyclomatic 19) REDACTED:4337— SystemConfig.LoadProxyMode_FromDB has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Proxy.EstablishSocksProxyServer (cyclomatic 19) REDACTED:8972— Proxy.EstablishSocksProxyServer has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.GetFilterEdit_ById (cyclomatic 19) REDACTED:22756— List.GetFilterEdit_ById has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Robot.CheckRobotInstruction (cyclomatic 19) REDACTED:26882— Robot.CheckRobotInstruction has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Device.Register (cyclomatic 19) REDACTED:30635— Device.Register has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
ShellLink.ApplyStats (cyclomatic 18) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:643— ShellLink.ApplyStats 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.
AmfReader.ReadValue (cyclomatic 18) WinsockPacketEditor/ClassObject/Decoder/AdditionalDecoders.cs:95— AmfReader.ReadValue has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
PacketExtractorConfig.Normalize (cyclomatic 18) WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:231— PacketExtractorConfig.Normalize has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
McpAgentGateway.AddFirewallRuleAsync (cyclomatic 18) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1268— McpAgentGateway.AddFirewallRuleAsync has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
List.SearchProxy_Shell (cyclomatic 18) REDACTED:11890— List.SearchProxy_Shell has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (List.SearchPacket_Shell) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Packet.IsShowByFilter (cyclomatic 18) REDACTED:16781— Packet.IsShowByFilter has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.SearchPacket_Shell (cyclomatic 18) REDACTED:17856— List.SearchPacket_Shell has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (List.SearchProxy_Shell) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
DecoderConfig.UpdateDecoderList_ByListAction (cyclomatic 18) REDACTED:19475— DecoderConfig.UpdateDecoderList_ByListAction has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Filter.CheckFilter_IsMatch_Advanced (cyclomatic 18) REDACTED:21084— Filter.CheckFilter_IsMatch_Advanced 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. Note what this body is, though: it carries an aggressive-inlining request, so its author has asked in the source for this body to be inlined into every caller. Each part pulled out of it becomes a call the runtime has to decide to inline again, against a size budget — so the split can quietly turn one inlined body into several real calls, on the path the marker exists to protect. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.LoadSendList_FromXDocument (cyclomatic 18) REDACTED:26125— List.LoadSendList_FromXDocument has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Robot.UpdateInstruction_ByListAction (cyclomatic 18) REDACTED:26793— Robot.UpdateInstruction_ByListAction has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
CodecEngine.CoreResult (cyclomatic 17) REDACTED:253— CodecEngine.CoreResult 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. Note what this body is, though: it works in explicit hardware vector and instruction-set types. A kernel divided across a call boundary passes its vectors between the parts and depends on the runtime putting them back together, so the division can cost more than the complexity it removes. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free. This is NOT this file's highest cyclomatic complexity: CodecEngine.AppliesTo (cyclomatic 29) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
CodecEngine.Symmetric (cyclomatic 17) REDACTED:338— CodecEngine.Symmetric has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. Note what this body is, though: it works in explicit hardware vector and instruction-set types. A kernel divided across a call boundary passes its vectors between the parts and depends on the runtime putting them back together, so the division can cost more than the complexity it removes. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free. This is NOT this file's highest cyclomatic complexity: CodecEngine.AppliesTo (cyclomatic 29) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
RobotExecute.TryGetVirtualKey (cyclomatic 17) WinsockPacketEditor/ClassObject/RobotExecute.cs:647— RobotExecute.TryGetVirtualKey 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.
SystemConfig.ParseHotkeyString (cyclomatic 17) REDACTED:2252— SystemConfig.ParseHotkeyString has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Proxy.SaveCertToFile_Dialog (cyclomatic 17) REDACTED:9673— Proxy.SaveCertToFile_Dialog 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. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.UpdateFilterList_ByListAction (cyclomatic 17) REDACTED:23277— List.UpdateFilterList_ByListAction has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (List.UpdateSendList_ByListAction, List.UpdateRobotList_ByListAction, List.UpdateWareHouseList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.UpdateSendList_ByListAction (cyclomatic 17) REDACTED:25492— List.UpdateSendList_ByListAction has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (List.UpdateFilterList_ByListAction, List.UpdateRobotList_ByListAction, List.UpdateWareHouseList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.UpdateRobotList_ByListAction (cyclomatic 17) REDACTED:27674— List.UpdateRobotList_ByListAction has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (List.UpdateFilterList_ByListAction, List.UpdateSendList_ByListAction, List.UpdateWareHouseList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
List.UpdateWareHouseList_ByListAction (cyclomatic 17) REDACTED:28747— List.UpdateWareHouseList_ByListAction has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (List.UpdateFilterList_ByListAction, List.UpdateSendList_ByListAction, List.UpdateRobotList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Socket_Web.Configuration (cyclomatic 17) WinsockPacketEditor/WebAPI/Socket_Web.cs:35— Socket_Web.Configuration has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 76, 122, 206, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Socket_Web.HandleAccountPost (cyclomatic 17) WinsockPacketEditor/WebAPI/Socket_Web.cs:393— Socket_Web.HandleAccountPost has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body's own statements and 6 belong to one function literal inside it that branches. 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.
diff.core (cyclomatic 17) WinsockPacketEditor/WebUI/src/diff.ts:168— diff.core 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.
SystemConfig.ParseAccountList_FromXDocument (cyclomatic 16) REDACTED:3029— SystemConfig.ParseAccountList_FromXDocument has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
SystemConfig.LoadSystemConfig_FromDB (cyclomatic 16) REDACTED:3437— SystemConfig.LoadSystemConfig_FromDB has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Mapping.SaveMapRemote_Shell (cyclomatic 16) REDACTED:15614— Mapping.SaveMapRemote_Shell 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. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Send.LoadSendCollection_FromXDocument (cyclomatic 16) REDACTED:24768— Send.LoadSendCollection_FromXDocument has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
ServerList.LoadServerList_FromXDocument (cyclomatic 16) REDACTED:30885— ServerList.LoadServerList_FromXDocument has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: SystemConfig.DoHotKey (cyclomatic 28) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Payload.ReadInfo (cyclomatic 16) REDACTED:60— Payload.ReadInfo 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.
ProxyAccount.html.openEdit (cyclomatic 16) WinsockPacketEditor/Web/ProxyAccount.html:288— ProxyAccount.html.openEdit has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Repeated repair: WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue:192— WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue 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 4 (its worst body is save 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: 防火墙名单的过期时间与操作列表头内容都居中”; “fix: 防火墙工具条挪回表格上方、软件设置改成 01-04 分区卡”; “fix: 备份底部一行放全选与导入导出、防火墙名单贴边”; “fix: 备份竖排四区、导入导出改小按钮、防火墙名单去壳”. 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-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-04 22:18:55 +08:00' --until='2026-10-02 22:18:55 +08:00' --full-history --no-merges -- WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue`: 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.
ShellForm.RegisterMethods (cognitive 662) WinsockPacketEditor/ShellForm.cs:1347— ShellForm.RegisterMethods has cognitive complexity 662 (threshold 15). Most of this is not in the body itself: 2 of the 662 points are its own statements and the rest belongs to 170 function literals inside it that branch (lines 2769, 2653, 3140, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ShellForm.HandleMcpShellActionAsync (cognitive 321) WinsockPacketEditor/ShellForm.cs:6711— ShellForm.HandleMcpShellActionAsync has cognitive complexity 321 (threshold 15). Of this number, 315 points are the body's own statements and 6 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RobotExecute.Robot_Body (cognitive 244) WinsockPacketEditor/ClassObject/RobotExecute.cs:128— RobotExecute.Robot_Body has cognitive complexity 244 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Filter.DoFilterCore (cognitive 97) REDACTED:21318— Filter.DoFilterCore has cognitive complexity 97 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McpAgentGateway.DispatchAsync (cognitive 94) WinsockPacketEditor/Mcp/McpAgentGateway.cs:220— McpAgentGateway.DispatchAsync has cognitive complexity 94 (threshold 15). 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.
Proxy.ForwardData (cognitive 81) REDACTED:7819— Proxy.ForwardData has cognitive complexity 81 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
WinSockHook.WSARecvFrom_HookCore (cognitive 77) WinsockPacketEditor/ClassObject/WinSockHook.cs:919— WinSockHook.WSARecvFrom_HookCore has cognitive complexity 77 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
WinSockHook.WSARecv_HookCore (cognitive 74) WinsockPacketEditor/ClassObject/WinSockHook.cs:697— WinSockHook.WSARecv_HookCore has cognitive complexity 74 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SystemConfig.SetSystemConfig_FromXML (cognitive 74) REDACTED:3626— SystemConfig.SetSystemConfig_FromXML has cognitive complexity 74 (threshold 15). 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.
List.LoadFilterList_FromXDocument (cognitive 73) REDACTED:23775— List.LoadFilterList_FromXDocument has cognitive complexity 73 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.SaveFilterEdit (cognitive 70) REDACTED:22883— List.SaveFilterEdit has cognitive complexity 70 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.SearchForList (cognitive 63) REDACTED:18127— List.SearchForList has cognitive complexity 63 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.SetProxyMode_FromXML (cognitive 52) REDACTED:4431— SystemConfig.SetProxyMode_FromXML has cognitive complexity 52 (threshold 15). 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.
Account.LoadAccountList_FromXDocument (cognitive 52) REDACTED:14524— Account.LoadAccountList_FromXDocument has cognitive complexity 52 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Filter.CheckFilter_IsMatch_Advanced (cognitive 51) REDACTED:21084— Filter.CheckFilter_IsMatch_Advanced has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. Note what this body is, though: it carries an aggressive-inlining request, so its author has asked in the source for this body to be inlined into every caller. Each part pulled out of it becomes a call the runtime has to decide to inline again, against a size budget — so the split can quietly turn one inlined body into several real calls, on the path the marker exists to protect. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free.
Robot.GetContentString_ByInstructionType (cognitive 51) REDACTED:26487— Robot.GetContentString_ByInstructionType has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SystemConfig.ExtractData (cognitive 50) REDACTED:2811— SystemConfig.ExtractData has cognitive complexity 50 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.FlushToFeed (cognitive 48) REDACTED:12029— List.FlushToFeed has cognitive complexity 48 (threshold 15). Of this number, 45 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
McpAgentGateway.Dispatch (cognitive 46) WinsockPacketEditor/Mcp/McpAgentGateway.cs:162— McpAgentGateway.Dispatch has cognitive complexity 46 (threshold 15). Of this number, 41 points are the body's own statements and 5 belong to one function literal inside it that branches. 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.
McpAgentGateway.SaveSettingAsync (cognitive 46) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1997— McpAgentGateway.SaveSettingAsync has cognitive complexity 46 (threshold 15). Most of this is not in the body itself: 2 of the 46 points are its own statements and the rest belongs to one function literal inside it that branches (line 2005). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
List.FlushToFeed (cognitive 46) REDACTED:17973— List.FlushToFeed has cognitive complexity 46 (threshold 15). Of this number, 43 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SystemConfig.ExportSystemBackUp (cognitive 44) REDACTED:4883— SystemConfig.ExportSystemBackUp has cognitive complexity 44 (threshold 15). Of this number, 43 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
Robot.ValidateInstruction (cognitive 44) REDACTED:27121— Robot.ValidateInstruction has cognitive complexity 44 (threshold 15). 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.
HttpSniffer.Feed (cognitive 43) WinsockPacketEditor/ClassObject/HttpSniffer.cs:48— HttpSniffer.Feed has cognitive complexity 43 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Mapping.ModifyRequestHostAndPath (cognitive 42) REDACTED:14906— Mapping.ModifyRequestHostAndPath has cognitive complexity 42 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.ProcessUnpackData (cognitive 40) REDACTED:8409— Proxy.ProcessUnpackData has cognitive complexity 40 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.LoadSendList_FromXDocument (cognitive 40) REDACTED:26125— List.LoadSendList_FromXDocument has cognitive complexity 40 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Robot.CheckRobotInstruction (cognitive 40) REDACTED:26882— Robot.CheckRobotInstruction has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SystemConfig.BytesToString (cognitive 37) REDACTED:1724— SystemConfig.BytesToString has cognitive complexity 37 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PacketEditConfig.StartSend (cognitive 37) REDACTED:18784— PacketEditConfig.StartSend has cognitive complexity 37 (threshold 15). Of this number, 21 points are the body's own statements and 16 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Send.LoadSendCollection_FromXDocument (cognitive 36) REDACTED:24768— Send.LoadSendCollection_FromXDocument has cognitive complexity 36 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WpeCore.Dispatch (cognitive 34) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:788— WpeCore.Dispatch has cognitive complexity 34 (threshold 15). 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.
SystemConfig.ImportSystemBackUp_FromXDocument (cognitive 34) REDACTED:5189— SystemConfig.ImportSystemBackUp_FromXDocument has cognitive complexity 34 (threshold 15). 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.
ShellForm.WndProc (cognitive 34) WinsockPacketEditor/ShellForm.cs:952— ShellForm.WndProc has cognitive complexity 34 (threshold 15). Of this number, 30 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
WinSockHook.StartHook (cognitive 33) WinsockPacketEditor/ClassObject/WinSockHook.cs:107— WinSockHook.StartHook has cognitive complexity 33 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServerList.LoadServerList_FromXDocument (cognitive 33) REDACTED:30885— ServerList.LoadServerList_FromXDocument has cognitive complexity 33 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PacketVariableEngine.ToBytes (cognitive 32) WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:459— PacketVariableEngine.ToBytes has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McpAgentGateway.DecoderActionAsync (cognitive 32) WinsockPacketEditor/Mcp/McpAgentGateway.cs:2396— McpAgentGateway.DecoderActionAsync has cognitive complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to one function literal inside it that branches (line 2399). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
List.SendList_Body (cognitive 32) REDACTED:25391— List.SendList_Body has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.RobotList_Body (cognitive 32) REDACTED:27565— List.RobotList_Body has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.LoadSystemConfig_FromDB (cognitive 30) REDACTED:3437— SystemConfig.LoadSystemConfig_FromDB has cognitive complexity 30 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SendExecute.Send_Body (cognitive 29) WinsockPacketEditor/ClassObject/SendExecute.cs:119— SendExecute.Send_Body has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McpAgentGateway.GetSetting (cognitive 29) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1816— McpAgentGateway.GetSetting has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.AnalyzeContinuousDuplicates (cognitive 29) REDACTED:2548— SystemConfig.AnalyzeContinuousDuplicates has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.ParseAccountList_FromXDocument (cognitive 29) REDACTED:3029— SystemConfig.ParseAccountList_FromXDocument has cognitive complexity 29 (threshold 15). Of this number, 27 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.LoadProxyMode_FromDB (cognitive 29) REDACTED:4337— SystemConfig.LoadProxyMode_FromDB has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.GetFilterEdit_ById (cognitive 29) REDACTED:22756— List.GetFilterEdit_ById has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Send.UpdateSendCollection_ByListAction (cognitive 29) REDACTED:24464— Send.UpdateSendCollection_ByListAction has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (List.UpdateStores_ByListAction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
List.UpdateStores_ByListAction (cognitive 29) REDACTED:28834— List.UpdateStores_ByListAction has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Send.UpdateSendCollection_ByListAction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Proxy.Socks5FrameLength (cognitive 28) REDACTED:8737— Proxy.Socks5FrameLength has cognitive complexity 28 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Account.LoadAccountList (cognitive 28) REDACTED:14436— Account.LoadAccountList has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
ShellLink.ApplyStats (cognitive 27) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:643— ShellLink.ApplyStats has cognitive complexity 27 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FrameExtractor.Extract (cognitive 27) WinsockPacketEditor/ClassObject/Decoder/FrameExtractor.cs:22— FrameExtractor.Extract has cognitive complexity 27 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.InitSocks5Proxy (cognitive 26) REDACTED:6844— Proxy.InitSocks5Proxy has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Proxy.AuthUserName (cognitive 26) REDACTED:7364— Proxy.AuthUserName has cognitive complexity 26 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Filter.ParseSearchConditionsCore (cognitive 26) REDACTED:21190— Filter.ParseSearchConditionsCore has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
parse (cognitive 25) WinsockPacketEditor/WebUI/tools/check-font-sizes.mjs:45— parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 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.
Packet.IsShowByFilter (cognitive 24) REDACTED:16781— Packet.IsShowByFilter has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Packet.IsFilter_BySize (cognitive 24) REDACTED:17041— Packet.IsFilter_BySize has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Robot.UpdateInstruction_ByListAction (cognitive 24) REDACTED:26793— Robot.UpdateInstruction_ByListAction has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.SetInjectMode_FromXML (cognitive 23) REDACTED:4142— SystemConfig.SetInjectMode_FromXML has cognitive complexity 23 (threshold 15). 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.
diff.core (cognitive 23) WinsockPacketEditor/WebUI/src/diff.ts:168— diff.core has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (9 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MihomoConfig.Build (cognitive 22) WinsockPacketEditor/ClassObject/Kernel/MihomoConfig.cs:60— MihomoConfig.Build has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MihomoKernel.Start (cognitive 22) WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:86— MihomoKernel.Start has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProxySession.OnTargetDataReceived (cognitive 22) WinsockPacketEditor/ClassObject/ProxySession.cs:438— ProxySession.OnTargetDataReceived has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.ComparePackets (cognitive 22) REDACTED:2465— SystemConfig.ComparePackets has cognitive complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
DataBase.InsertTable_WareHouse (cognitive 22) REDACTED:34853— DataBase.InsertTable_WareHouse has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShellForm.PickMouseHook (cognitive 22) WinsockPacketEditor/ShellForm.cs:7202— ShellForm.PickMouseHook has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Payload.ExtractEntries (cognitive 22) REDACTED:258— Payload.ExtractEntries has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PacketExtractorConfig.Normalize (cognitive 21) WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:231— PacketExtractorConfig.Normalize has cognitive complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Account.GetAccountList_XML (cognitive 21) REDACTED:14316— Account.GetAccountList_XML has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Packet.IsFilter_ByHead (cognitive 21) REDACTED:16957— Packet.IsFilter_ByHead has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PacketEditConfig.DoSend (cognitive 21) REDACTED:18941— PacketEditConfig.DoSend has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DecoderConfig.UpdateDecoderList_ByListAction (cognitive 21) REDACTED:19475— DecoderConfig.UpdateDecoderList_ByListAction has cognitive complexity 21 (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.
CodecEngine.SmartDecode (cognitive 20) REDACTED:123— CodecEngine.SmartDecode has cognitive complexity 20 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FileAssociation.Remove (cognitive 20) WinsockPacketEditor/ClassObject/FileAssociation.cs:376— FileAssociation.Remove has cognitive complexity 20 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Mapping.LoadMapRemote_FromXDocument (cognitive 20) REDACTED:16294— Mapping.LoadMapRemote_FromXDocument has cognitive complexity 20 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WpeCore.WriterLoop (cognitive 19) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:560— WpeCore.WriterLoop has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HttpSniffer.ChunkedTotal (cognitive 19) WinsockPacketEditor/ClassObject/HttpSniffer.cs:236— HttpSniffer.ChunkedTotal has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PacketVariableEngine.TrySplitTerms (cognitive 19) WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:327— PacketVariableEngine.TrySplitTerms has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.FindRule (cognitive 19) REDACTED:8484— Proxy.FindRule has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.LongestAnyHeaderPrefixSuffix (cognitive 19) REDACTED:8502— Proxy.LongestAnyHeaderPrefixSuffix has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.EstablishSocksProxyServer (cognitive 19) REDACTED:8972— Proxy.EstablishSocksProxyServer has cognitive complexity 19 (threshold 15). 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.
Packet.SendPacket (cognitive 19) REDACTED:16533— Packet.SendPacket has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.CheckChange (cognitive 19) REDACTED:23192— List.CheckChange has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.UpdateFilterList_ByListAction (cognitive 19) REDACTED:23277— List.UpdateFilterList_ByListAction has cognitive complexity 19 (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. This shape REPEATS in the file: 3 other methods here (List.UpdateSendList_ByListAction, List.UpdateRobotList_ByListAction, List.UpdateWareHouseList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
List.UpdateSendList_ByListAction (cognitive 19) REDACTED:25492— List.UpdateSendList_ByListAction has cognitive complexity 19 (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. This shape REPEATS in the file: 3 other methods here (List.UpdateFilterList_ByListAction, List.UpdateRobotList_ByListAction, List.UpdateWareHouseList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
List.UpdateRobotList_ByListAction (cognitive 19) REDACTED:27674— List.UpdateRobotList_ByListAction has cognitive complexity 19 (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. This shape REPEATS in the file: 3 other methods here (List.UpdateFilterList_ByListAction, List.UpdateSendList_ByListAction, List.UpdateWareHouseList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
List.UpdateWareHouseList_ByListAction (cognitive 19) REDACTED:28747— List.UpdateWareHouseList_ByListAction has cognitive complexity 19 (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. This shape REPEATS in the file: 3 other methods here (List.UpdateFilterList_ByListAction, List.UpdateSendList_ByListAction, List.UpdateRobotList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
diff.toBlocks (cognitive 19) WinsockPacketEditor/WebUI/src/diff.ts:114— diff.toBlocks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProxySession.ProcessUdpReceive (cognitive 18) WinsockPacketEditor/ClassObject/ProxySession.cs:574— ProxySession.ProcessUdpReceive has cognitive complexity 18 (threshold 15). 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.
McpAgentGateway.AddFirewallRuleAsync (cognitive 18) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1268— McpAgentGateway.AddFirewallRuleAsync has cognitive complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to one function literal inside it that branches. 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.
McpAgentGateway.SaveUnpackRulesAsync (cognitive 18) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1963— McpAgentGateway.SaveUnpackRulesAsync has cognitive complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.SaveIPRuleAsync (cognitive 18) REDACTED:10072— Proxy.SaveIPRuleAsync has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Filter.ProcessProgressions (cognitive 18) REDACTED:21889— Filter.ProcessProgressions has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. Note what this body is, though: it carries an aggressive-inlining request, so its author has asked in the source for this body to be inlined into every caller. Each part pulled out of it becomes a call the runtime has to decide to inline again, against a size budget — so the split can quietly turn one inlined body into several real calls, on the path the marker exists to protect. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free. This shape REPEATS in the file: one other method here (Filter.ApplyProgressions) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Filter.ApplyProgressions (cognitive 18) REDACTED:22196— Filter.ApplyProgressions has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. Note what this body is, though: it carries an aggressive-inlining request, so its author has asked in the source for this body to be inlined into every caller. Each part pulled out of it becomes a call the runtime has to decide to inline again, against a size budget — so the split can quietly turn one inlined body into several real calls, on the path the marker exists to protect. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free. This shape REPEATS in the file: one other method here (Filter.ProcessProgressions) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Socket_Web.Configuration (cognitive 18) WinsockPacketEditor/WebAPI/Socket_Web.cs:35— Socket_Web.Configuration has cognitive complexity 18 (threshold 15). None of this is in the body itself: all 18 points belong to 5 function literals inside it that branch (lines 76, 122, 206, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Program.Main (cognitive 18) WPELauncher/Program.cs:20— Program.Main has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CodecEngine.Symmetric (cognitive 17) REDACTED:338— CodecEngine.Symmetric has cognitive complexity 17 (threshold 15). 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. Note what this body is, though: it works in explicit hardware vector and instruction-set types. A kernel divided across a call boundary passes its vectors between the parts and depends on the runtime putting them back together, so the division can cost more than the complexity it removes. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free.
PacketVariableEngine.RecalculateExpressions (cognitive 17) WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:180— PacketVariableEngine.RecalculateExpressions has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McpAgentGateway.ServeAsync (cognitive 17) WinsockPacketEditor/Mcp/McpAgentGateway.cs:108— McpAgentGateway.ServeAsync has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McpAgentGateway.ListLogs (cognitive 17) WinsockPacketEditor/Mcp/McpAgentGateway.cs:1546— McpAgentGateway.ListLogs has cognitive complexity 17 (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.
Proxy.TryParseHttpHost (cognitive 17) REDACTED:8867— Proxy.TryParseHttpHost has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.ParseIPEndPoint (cognitive 17) REDACTED:8921— Proxy.ParseIPEndPoint has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.SearchProxy_Shell (cognitive 17) REDACTED:11890— List.SearchProxy_Shell has cognitive complexity 17 (threshold 15). 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. This shape REPEATS in the file: one other method here (List.SearchPacket_Shell) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Account.LoadAccountList_FromInIFile (cognitive 17) REDACTED:14744— Account.LoadAccountList_FromInIFile has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.SearchPacket_Shell (cognitive 17) REDACTED:17856— List.SearchPacket_Shell has cognitive complexity 17 (threshold 15). 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. This shape REPEATS in the file: one other method here (List.SearchProxy_Shell) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
DecoderConfig.Normalize (cognitive 17) REDACTED:19196— DecoderConfig.Normalize has cognitive complexity 17 (threshold 15). 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. Note what this body is, though: it works in explicit hardware vector and instruction-set types. A kernel divided across a call boundary passes its vectors between the parts and depends on the runtime putting them back together, so the division can cost more than the complexity it removes. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free.
Filter.CheckPacket_IsMatch_AppointPort (cognitive 17) REDACTED:20662— Filter.CheckPacket_IsMatch_AppointPort has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. Note what this body is, though: it carries an aggressive-inlining request, so its author has asked in the source for this body to be inlined into every caller. Each part pulled out of it becomes a call the runtime has to decide to inline again, against a size budget — so the split can quietly turn one inlined body into several real calls, on the path the marker exists to protect. The measurement stands — a hot path is not a licence to be unreadable — but the move that pays here is to lift the COLD parts out first (argument validation, fallback and error paths, one-off setup) and leave the kernel whole. Where the kernel itself has to be divided, ask for the extracted parts to be inlined as well, and measure the result rather than assuming the division is free.
Device.Register (cognitive 17) REDACTED:30635— Device.Register has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
ServerList.UpdateServerList_ByListAction (cognitive 17) REDACTED:31227— ServerList.UpdateServerList_ByListAction has cognitive complexity 17 (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. This shape REPEATS in the file: 2 other methods here (ServerList.UpdateRuleList_ByListAction, NoticeList.UpdateNoticeList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ServerList.UpdateRuleList_ByListAction (cognitive 17) REDACTED:31298— ServerList.UpdateRuleList_ByListAction has cognitive complexity 17 (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. This shape REPEATS in the file: 2 other methods here (ServerList.UpdateServerList_ByListAction, NoticeList.UpdateNoticeList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
NoticeList.UpdateNoticeList_ByListAction (cognitive 17) REDACTED:31914— NoticeList.UpdateNoticeList_ByListAction has cognitive complexity 17 (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. This shape REPEATS in the file: 2 other methods here (ServerList.UpdateServerList_ByListAction, ServerList.UpdateRuleList_ByListAction) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
diff.myers (cognitive 17) WinsockPacketEditor/WebUI/src/diff.ts:57— diff.myers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WpeCore.ControlLoop (cognitive 16) WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:742— WpeCore.ControlLoop has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AdditionalDecoders.Xxtea (cognitive 16) WinsockPacketEditor/ClassObject/Decoder/AdditionalDecoders.cs:27— AdditionalDecoders.Xxtea has cognitive complexity 16 (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.
FileAssociation.StageIcon (cognitive 16) WinsockPacketEditor/ClassObject/FileAssociation.cs:272— FileAssociation.StageIcon has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RobotExecute.StartRobot (cognitive 16) WinsockPacketEditor/ClassObject/RobotExecute.cs:47— RobotExecute.StartRobot has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McpAgentGateway.FilterModifyCells (cognitive 16) WinsockPacketEditor/Mcp/McpAgentGateway.cs:868— McpAgentGateway.FilterModifyCells has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SystemConfig.IPv4OfAddress (cognitive 16) REDACTED:738— SystemConfig.IPv4OfAddress has cognitive complexity 16 (threshold 15). 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.
SystemConfig.ParseHotkeyString (cognitive 16) REDACTED:2252— SystemConfig.ParseHotkeyString has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.HandleConnectCommand (cognitive 16) REDACTED:7551— Proxy.HandleConnectCommand has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Mapping.SaveMapRemote_Shell (cognitive 16) REDACTED:15614— Mapping.SaveMapRemote_Shell has cognitive complexity 16 (threshold 15). 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.
List.CheckAppoint (cognitive 16) REDACTED:23128— List.CheckAppoint has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
List.LoadWareHouseList_FromXDocument (cognitive 16) REDACTED:29231— List.LoadWareHouseList_FromXDocument has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServerList.SaveRule_Shell (cognitive 16) REDACTED:31567— ServerList.SaveRule_Shell has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DataBase.InsertTable_AutoStores (cognitive 16) REDACTED:35069— DataBase.InsertTable_AutoStores has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShellForm.DispatchHotKeyToTarget (cognitive 16) WinsockPacketEditor/ShellForm.cs:6619— ShellForm.DispatchHotKeyToTarget has cognitive complexity 16 (threshold 15). 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.
Change coupling: InjectData.vue ↔ ProxyData.vue WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:1— `WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue` and `WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue` change together 77% of the time (10 of the 13 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 10 shared commits counted here, the most recent 3 are `42b9a914` Fix injection hook packet handling and list restore; `a188e7d4` 「查找下一个」走到同一个封包里的下一处 (at that commit the files were still `WPEHybrid/web/src/components/inject/InjectData.vue` and `WPEHybrid/web/src/components/proxy/ProxyData.vue`); `9e6e72bd` 「从头查找」去掉多余的 title (at that commit the files were still `WPEHybrid/web/src/components/inject/InjectData.vue` and `WPEHybrid/web/src/components/proxy/ProxyData.vue`) — run `git show` on any of them.
D4 · Code Duplication· Members sharing a duplicated core (13 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (13 members, 50+ identical tokens) REDACTED:11157— REDACTED:11157-11202 | REDACTED:11277-11322 | REDACTED:14437-14522 | REDACTED:16115-16160 | REDACTED:16247-16292 | REDACTED:19690-19726 | REDACTED:23727-23773 | REDACTED:24722-24766 | REDACTED:26078-26123 | REDACTED:28167-28212 | REDACTED:29184-29229 | REDACTED:30139-30185 | REDACTED:30353-30398 — These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times.
D4 · Code Duplication· Members sharing a duplicated core (11 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (11 members, 50+ identical tokens) REDACTED:10946— REDACTED:10946-10979 | REDACTED:11059-11092 | REDACTED:14281-14314 | REDACTED:15897-15930 | REDACTED:16012-16045 | REDACTED:19632-19656 | REDACTED:23595-23628 | REDACTED:25950-25983 | REDACTED:28047-28080 | REDACTED:29066-29099 | REDACTED:30256-30289 — These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times.
D4 · Code Duplication· Edited copies of one member (5 members, 380+ corresponding lines) · ×1
Edited copies of one member (5 members, 380+ corresponding lines) WinsockPacketEditor/ClassObject/L10n/L10nEn.cs:17— WinsockPacketEditor/ClassObject/L10n/L10nEn.cs:17-396 | WinsockPacketEditor/ClassObject/L10n/L10nJa.cs:17-396 | WinsockPacketEditor/ClassObject/L10n/L10nKo.cs:17-396 | WinsockPacketEditor/ClassObject/L10n/L10nRu.cs:17-396 | WinsockPacketEditor/ClassObject/L10n/L10nVi.cs:17-396 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 380 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 (101 corresponding lines) · ×1
Edited copy of a member (101 corresponding lines) REDACTED:11891— REDACTED:11891-11991 | REDACTED:17857-17957 — These two members are one piece of code written twice and then edited apart: 101 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 (75 corresponding lines) · ×1
Edited copy of a member (75 corresponding lines) REDACTED:34854— REDACTED:34854-34950 | REDACTED:35070-35144 — 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 (108 corresponding lines) · ×1
Edited copy of a member (108 corresponding lines) REDACTED:24465— REDACTED:24465-24578 | REDACTED:28835-28942 — These two members are one piece of code written twice and then edited apart: 108 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 (109 corresponding lines) · ×1
Edited copy of a member (109 corresponding lines) REDACTED:12030— REDACTED:12030-12138 | REDACTED:17974-18089 — These two members are one piece of code written twice and then edited apart: 109 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 (50 corresponding lines) · ×1
Edited copy of a member (50 corresponding lines) WinsockPacketEditor/ClassObject/WinSockHook.cs:272— WinsockPacketEditor/ClassObject/WinSockHook.cs:272-321 | WinsockPacketEditor/ClassObject/WinSockHook.cs:438-487 — These two members are one piece of code written twice and then edited apart: 50 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 (4 members, 81+ corresponding lines) · ×1
Edited copies of one member (4 members, 81+ corresponding lines) REDACTED:23278— REDACTED:23278-23360 | REDACTED:25493-25573 | REDACTED:27675-27755 | REDACTED:28748-28828 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 81 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 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (53 corresponding lines) · ×1
Edited copy of a member (53 corresponding lines) REDACTED:25844— REDACTED:25844-25899 | REDACTED:31672-31724 — These two members are one piece of code written twice and then edited apart: 53 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, 67+ corresponding lines) · ×1
Edited copies of one member (5 members, 67+ corresponding lines) REDACTED:10245— REDACTED:10245-10311 | REDACTED:10468-10534 | REDACTED:15407-15473 | REDACTED:15480-15546 | REDACTED:28949-29015 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 67 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 (65 corresponding lines) · ×1
Edited copy of a member (65 corresponding lines) REDACTED:31228— REDACTED:31228-31292 | REDACTED:31299-31363 — These two members are one piece of code written twice and then edited apart: 65 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 (67 corresponding lines) · ×1
Edited copy of a member (67 corresponding lines) REDACTED:25392— REDACTED:25392-25465 | REDACTED:27566-27632 — These two members are one piece of code written twice and then edited apart: 67 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) REDACTED:19103— REDACTED:19103-19129 | REDACTED:19132-19163 — 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 (56 corresponding lines) · ×1
Edited copy of a member (56 corresponding lines) REDACTED:9878— REDACTED:9878-9933 | REDACTED:10326-10381 — These two members are one piece of code written twice and then edited apart: 56 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 (37 corresponding lines) · ×1
Edited copy of a member (37 corresponding lines) REDACTED:11205— REDACTED:11205-11241 | REDACTED:11325-11361 — These two members are one piece of code written twice and then edited apart: 37 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) WinsockPacketEditor/Mcp/McpAgentGateway.cs:542— WinsockPacketEditor/Mcp/McpAgentGateway.cs:542-549 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:551-555 — 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 (29 corresponding lines) · ×1
Edited copy of a member (29 corresponding lines) REDACTED:15584— REDACTED:15584-15612 | REDACTED:32022-32053 — 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 (33 corresponding lines) · ×1
Edited copy of a member (33 corresponding lines) REDACTED:11664— REDACTED:11664-11696 | REDACTED:17641-17673 — These two members are one piece of code written twice and then edited apart: 33 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 (39 corresponding lines) · ×1
Edited copy of a member (39 corresponding lines) REDACTED:27957— REDACTED:27957-27995 | REDACTED:29955-29996 — These two members are one piece of code written twice and then edited apart: 39 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 (36 corresponding lines) · ×1
Edited copy of a member (36 corresponding lines) REDACTED:9940— REDACTED:9940-9975 | REDACTED:10388-10423 — These two members are one piece of code written twice and then edited apart: 36 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 (40 corresponding lines) · ×1
Edited copy of a member (40 corresponding lines) REDACTED:21834— REDACTED:21834-21873 | REDACTED:21969-22009 — These two members are one piece of code written twice and then edited apart: 40 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) REDACTED:32860— REDACTED:32860-32895 | REDACTED:32903-32937 — 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 (13 corresponding lines) · ×1
Edited copy of a member (13 corresponding lines) REDACTED:31618— REDACTED:31618-31633 | REDACTED:32056-32068 — 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 copies of one member (3 members, 22+ corresponding lines) · ×1
Edited copies of one member (3 members, 22+ corresponding lines) REDACTED:5111— REDACTED:5111-5139 | REDACTED:19666-19687 | REDACTED:23696-23724 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×1
Edited copy of a member (34 corresponding lines) REDACTED:12451— REDACTED:12451-12486 | REDACTED:12496-12529 — These two members are one piece of code written twice and then edited apart: 34 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 (47 corresponding lines) · ×1
Edited copy of a member (47 corresponding lines) REDACTED:25986— REDACTED:25986-26042 | REDACTED:28083-28129 — These two members are one piece of code written twice and then edited apart: 47 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, 36+ corresponding lines) · ×1
Edited copies of one member (5 members, 36+ corresponding lines) REDACTED:34054— REDACTED:34054-34090 | REDACTED:34190-34226 | REDACTED:34680-34715 | REDACTED:34961-34996 | REDACTED:35151-35186 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 36 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 (32 corresponding lines) · ×1
Edited copy of a member (32 corresponding lines) REDACTED:36091— REDACTED:36091-36122 | REDACTED:36236-36267 — These two members are one piece of code written twice and then edited apart: 32 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 (8 members, 14+ corresponding lines) · ×1
Edited copies of one member (8 members, 14+ corresponding lines) REDACTED:12978— REDACTED:12978-13002 | REDACTED:19426-19440 | REDACTED:22404-22428 | REDACTED:25638-25662 | REDACTED:27791-27805 | REDACTED:29318-29342 | REDACTED:29552-29576 | REDACTED:31429-31442 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 14 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 8 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 31+ corresponding lines) · ×1
Edited copies of one member (4 members, 31+ corresponding lines) REDACTED:11700— REDACTED:11700-11736 | REDACTED:11740-11770 | REDACTED:17677-17713 | REDACTED:17717-17747 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 31 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 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (7 members, 26+ corresponding lines) · ×1
Edited copies of one member (7 members, 26+ corresponding lines) REDACTED:34438— REDACTED:34438-34468 | REDACTED:35905-35930 | REDACTED:36059-36084 | REDACTED:36204-36229 | REDACTED:36349-36374 | REDACTED:36585-36615 | REDACTED:36807-36837 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 26 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 7 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 26+ corresponding lines) · ×1
Edited copies of one member (4 members, 26+ corresponding lines) REDACTED:24115— REDACTED:24115-24140 | REDACTED:24143-24168 | REDACTED:28478-28503 | REDACTED:28506-28531 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 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 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 1+ corresponding lines) · ×1
Edited copies of one member (5 members, 1+ corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:623— WinsockPacketEditor/Mcp/McpAgentGateway.cs:623-626 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:2359-2362 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:2364-2367 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:2380-2383 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:2385-2385 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 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 (15 corresponding lines) · ×1
Edited copy of a member (15 corresponding lines) REDACTED:26280— REDACTED:26280-26295 | REDACTED:26338-26352 — 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 copy of a member (24 corresponding lines) · ×1
Edited copy of a member (24 corresponding lines) WinsockPacketEditor/ShellForm.cs:5966— WinsockPacketEditor/ShellForm.cs:5966-5989 | WinsockPacketEditor/ShellForm.cs:5992-6016 — These two members are one piece of code written twice and then edited apart: 24 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 (4 members, 5+ corresponding lines) · ×1
Edited copies of one member (4 members, 5+ corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:339— WinsockPacketEditor/Mcp/McpAgentGateway.cs:339-343 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:363-367 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:379-383 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:2302-2306 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 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 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 19+ corresponding lines) · ×1
Edited copies of one member (6 members, 19+ corresponding lines) REDACTED:20191— REDACTED:20191-20209 | REDACTED:24244-24262 | REDACTED:26359-26377 | REDACTED:28354-28372 | REDACTED:31124-31142 | REDACTED:31890-31908 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 19 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 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 16+ corresponding lines) · ×1
Edited copies of one member (5 members, 16+ corresponding lines) REDACTED:19549— REDACTED:19549-19565 | REDACTED:22518-22542 | REDACTED:25739-25763 | REDACTED:27864-27879 | REDACTED:29368-29391 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 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 (17 corresponding lines) · ×1
Edited copy of a member (17 corresponding lines) REDACTED:800— REDACTED:800-816 | REDACTED:822-838 — These two members are one piece of code written twice and then edited apart: 17 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 (3 members, 19+ corresponding lines) · ×1
Edited copies of one member (3 members, 19+ corresponding lines) REDACTED:32964— REDACTED:32964-32982 | REDACTED:33346-33364 | REDACTED:33561-33579 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 19+ corresponding lines) · ×1
Edited copies of one member (5 members, 19+ corresponding lines) REDACTED:34362— REDACTED:34362-34380 | REDACTED:35850-35868 | REDACTED:35998-36016 | REDACTED:36149-36167 | REDACTED:36294-36312 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 19 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 copies of one member (3 members, 20+ corresponding lines) · ×1
Edited copies of one member (3 members, 20+ corresponding lines) REDACTED:12565— REDACTED:12565-12586 | REDACTED:13292-13311 | REDACTED:13314-13333 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 3+ corresponding lines) · ×1
Edited copies of one member (3 members, 3+ corresponding lines) WinsockPacketEditor/Mcp/McpAgentGateway.cs:463— WinsockPacketEditor/Mcp/McpAgentGateway.cs:463-469 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:525-533 | WinsockPacketEditor/Mcp/McpAgentGateway.cs:2393-2395 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 21+ corresponding lines) · ×1
Edited copies of one member (3 members, 21+ corresponding lines) REDACTED:24269— REDACTED:24269-24289 | REDACTED:26384-26404 | REDACTED:28383-28403 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 15+ corresponding lines) · ×1
Edited copies of one member (3 members, 15+ corresponding lines) REDACTED:32489— REDACTED:32489-32503 | REDACTED:32510-32527 | REDACTED:32534-32549 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 8+ corresponding lines) · ×1
Edited copies of one member (4 members, 8+ corresponding lines) REDACTED:276— REDACTED:276-283 | REDACTED:289-296 | REDACTED:302-309 | REDACTED:315-322 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 14+ corresponding lines) · ×1
Edited copies of one member (3 members, 14+ corresponding lines) REDACTED:26298— REDACTED:26298-26311 | REDACTED:28314-28327 | REDACTED:30953-30966 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×1
Edited copy of a member (7 corresponding lines) WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:200— WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:200-206 | WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:226-232 — 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.
Duplicated block (54 lines × 2) REDACTED:11892— REDACTED:11892-11945 | REDACTED:17858-17911 — 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 `REDACTED:11892` 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 (21–36 lines × 2) WinsockPacketEditor/ClassObject/Ui/FeedRows.cs:344— WinsockPacketEditor/ClassObject/Ui/FeedRows.cs:344-364 | WinsockPacketEditor/ClassObject/Ui/FeedRows.cs:514-549 — 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 (33 lines × 2) REDACTED:11955— REDACTED:11955-11987 | REDACTED:17921-17953 — 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 `REDACTED:11955` 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.
Duplicated block (29 lines × 2) REDACTED:11813— REDACTED:11813-11841 | REDACTED:17790-17818 — 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 `REDACTED:11813` 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.
Duplicated block (21 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:740— WinsockPacketEditor/ClassObject/WinSockHook.cs:740-760 | WinsockPacketEditor/ClassObject/WinSockHook.cs:965-985 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:740` 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 (17 lines × 3) REDACTED:11216— REDACTED:11216-11232 | REDACTED:11336-11352 | REDACTED:14587-14603 — 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.
Duplicated block (18 lines × 2) REDACTED:9763— REDACTED:9763-9780 | REDACTED:9806-9823 — 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 `REDACTED:9763` 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 (19–20 lines × 2) REDACTED:32860— REDACTED:32860-32879 | REDACTED:32903-32921 — 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 `REDACTED:32860` 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. 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 (17–18 lines × 2) REDACTED:21644— REDACTED:21644-21661 | REDACTED:21783-21799 — 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 `REDACTED:21644` 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) REDACTED:740— REDACTED:740-754 | WinsockPacketEditor/ClassObject/Decoder/FrameExtractor.cs:208-223 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (14 lines × 13) REDACTED:11169— REDACTED:11169-11186 | REDACTED:11289-11306 | REDACTED:14466-14483 | REDACTED:16127-16144 | REDACTED:16259-16276 | REDACTED:19701-19714 | REDACTED:23739-23757 | REDACTED:24734-24751 | REDACTED:26090-26107 | REDACTED:28179-28196 | REDACTED:29196-29213 | REDACTED:30151-30168 | REDACTED:30365-30382 — all 13 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 `REDACTED:11169` 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. 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 (11 lines × 4) REDACTED:34344— REDACTED:34344-34354 | REDACTED:34579-34589 | REDACTED:34824-34834 | REDACTED:35342-35352 — 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 `REDACTED:34344` 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.
Duplicated block (13 lines × 11) REDACTED:10955— REDACTED:10955-10975 | REDACTED:11068-11088 | REDACTED:14290-14310 | REDACTED:15906-15926 | REDACTED:16021-16041 | REDACTED:19641-19653 | REDACTED:23604-23624 | REDACTED:25959-25979 | REDACTED:28056-28076 | REDACTED:29075-29095 | REDACTED:30265-30285 — all 11 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 `REDACTED:10955` 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. 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 (5–13 lines × 3) REDACTED:10991— REDACTED:10991-11003 | REDACTED:11104-11116 | REDACTED:14350-14354 — 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 `REDACTED:10991` 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. 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 (9 lines × 3) REDACTED:23777— REDACTED:23777-23785 | REDACTED:26127-26135 | REDACTED:28216-28224 — 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 `REDACTED:23777` 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–13 lines × 2) WinsockPacketEditor/ClassObject/WinSockHook.cs:378— WinsockPacketEditor/ClassObject/WinSockHook.cs:378-384 | WinsockPacketEditor/ClassObject/WinSockHook.cs:729-741 — 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 `WinsockPacketEditor/ClassObject/WinSockHook.cs:378` 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 (12 lines × 13) REDACTED:4841— REDACTED:4841-4852 | REDACTED:10910-10921 | REDACTED:11023-11034 | REDACTED:14246-14257 | REDACTED:15861-15872 | REDACTED:15976-15987 | REDACTED:23557-23568 | REDACTED:24593-24604 | REDACTED:25914-25925 | REDACTED:28010-28022 | REDACTED:29030-29041 | REDACTED:30011-30022 | REDACTED:30220-30231 — all 13 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 `REDACTED:4841` 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 × 4) REDACTED:14535— REDACTED:14535-14543 | REDACTED:23777-23785 | REDACTED:26127-26135 | REDACTED:28216-28224 — 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 `REDACTED:14535` 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–12 lines × 3) WinsockPacketEditor/ClassObject/Core/Ipc/PacketFrame.cs:75— WinsockPacketEditor/ClassObject/Core/Ipc/PacketFrame.cs:75-81 | WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:450-456 | WinsockPacketEditor/ShellForm.cs:7572-7583 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — 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 3 times. 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 × 7) WinsockPacketEditor/ShellForm.cs:3609— WinsockPacketEditor/ShellForm.cs:3609-3615 | WinsockPacketEditor/ShellForm.cs:3690-3696 | WinsockPacketEditor/ShellForm.cs:3820-3826 | WinsockPacketEditor/ShellForm.cs:4352-4358 | WinsockPacketEditor/ShellForm.cs:5085-5091 | WinsockPacketEditor/ShellForm.cs:5164-5170 | WinsockPacketEditor/ShellForm.cs:5322-5328 — all 7 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. 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 (10–11 lines × 2) REDACTED:9047— REDACTED:9047-9056 | REDACTED:9071-9081 — 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 `REDACTED:9047` 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.
Duplicated block (9–11 lines × 2) WinsockPacketEditor/ShellForm.cs:5032— WinsockPacketEditor/ShellForm.cs:5032-5042 | WinsockPacketEditor/ShellForm.cs:5046-5054 — 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 `WinsockPacketEditor/ShellForm.cs:5032` 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) REDACTED:19116— REDACTED:19116-19125 | REDACTED:19150-19159 — 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 × 4) WinsockPacketEditor/ClassObject/WinSockHook.cs:740— WinsockPacketEditor/ClassObject/WinSockHook.cs:740-745 | WinsockPacketEditor/ClassObject/WinSockHook.cs:801-806 | WinsockPacketEditor/ClassObject/WinSockHook.cs:965-970 | WinsockPacketEditor/ClassObject/WinSockHook.cs:1026-1031 — 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.
Duplicated block (8–9 lines × 2) WinsockPacketEditor/ShellForm.cs:2791— WinsockPacketEditor/ShellForm.cs:2791-2799 | WinsockPacketEditor/ShellForm.cs:6929-6936 — 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 `WinsockPacketEditor/ShellForm.cs:2791` 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 (6 lines × 3) WinsockPacketEditor/ShellForm.cs:4432— WinsockPacketEditor/ShellForm.cs:4432-4437 | WinsockPacketEditor/ShellForm.cs:4472-4477 | WinsockPacketEditor/ShellForm.cs:4496-4501 — 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 `WinsockPacketEditor/ShellForm.cs:4432` 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 (5 lines × 10) WinsockPacketEditor/ShellForm.cs:3607— WinsockPacketEditor/ShellForm.cs:3607-3615 | WinsockPacketEditor/ShellForm.cs:3688-3696 | WinsockPacketEditor/ShellForm.cs:3818-3826 | WinsockPacketEditor/ShellForm.cs:4350-4358 | WinsockPacketEditor/ShellForm.cs:4432-4436 | WinsockPacketEditor/ShellForm.cs:4472-4476 | WinsockPacketEditor/ShellForm.cs:4496-4500 | WinsockPacketEditor/ShellForm.cs:5083-5091 | WinsockPacketEditor/ShellForm.cs:5162-5170 | WinsockPacketEditor/ShellForm.cs:5320-5328 — all 10 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 `WinsockPacketEditor/ShellForm.cs:3607` 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.
Off the main sequence: WinsockPacketEditor WinsockPacketEditor/WinsockPacketEditor.csproj:1— WinsockPacketEditor: abstractness 0.03, instability 0.00, distance 0.97 — an application entry point, so it is concrete by design — the distance is expected; what is worth checking is that other projects depend on it at all, since a host should be a leaf of the graph.
Low cohesion: ProxySession (LCOM4 4) WinsockPacketEditor/ClassObject/ProxySession.cs:13— ProxySession's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Fake-async — async method never awaits REDACTED:7299— `Handshake` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Duplication concentrated across 4 sibling directories (24 clone groups) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:498— 24 duplicated blocks under WinsockPacketEditor/WebUI/src/components/ have copies in at least two of the sibling directories decoder, extractor, inject, proxy — 21 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 24 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 24 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 24 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplicated block (147 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:498— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:498 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:433 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (74 matched lines × 2 locations) · ×1
Duplicated block with local edits (74 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:676— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:676 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:618 — the two spans are one implementation copied and then locally edited — 539 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (69 matched lines × 2 locations) · ×1
Duplicated block with local edits (69 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:43— WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:43 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:53 — the two spans are one implementation copied and then locally edited — 530 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (54 matched lines × 2 locations) · ×1
Duplicated block with local edits (54 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:35— WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:35 · WinsockPacketEditor/WebUI/src/components/proxy/WareHouseList.vue:31 — the two spans are one implementation copied and then locally edited — 438 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (38 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:76— WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:76 · WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:84 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (37 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:362— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:362 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:292 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (29 lines × 4 locations) WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:245— WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:245 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:170 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:203 · WinsockPacketEditor/WebUI/src/components/proxy/WareHouseList.vue:139 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (26 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:437— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:437 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:379 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (25 matched lines × 2 locations) · ×1
Duplicated block with local edits (25 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/HexPanel.vue:166— WinsockPacketEditor/WebUI/src/components/HexPanel.vue:166 · WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue:92 — the two spans are one implementation copied and then locally edited — 333 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (25 lines × 5 locations) WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:154— WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:154 · WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:245 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:170 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:203 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (20 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:160— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:160 · WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:122 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication· Duplicated block with local edits (19 matched lines × 2 locations) · ×1
Duplicated block with local edits (19 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/NoticeEdit.vue:13— WinsockPacketEditor/WebUI/src/components/proxy/NoticeEdit.vue:13 · WinsockPacketEditor/WebUI/src/components/proxy/ServerEdit.vue:11 — the two spans are one implementation copied and then locally edited — 223 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (18 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:61— WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:61 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:53 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (18 lines × 3 locations) WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:159— WinsockPacketEditor/WebUI/src/components/proxy/FilterList.vue:159 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:113 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:140 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication· Duplicated block with local edits (17 matched lines × 2 locations) · ×1
Duplicated block with local edits (17 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/AccountBatch.vue:36— WinsockPacketEditor/WebUI/src/components/proxy/AccountBatch.vue:36 · WinsockPacketEditor/WebUI/src/components/proxy/AccountEdit.vue:46 — the two spans are one implementation copied and then locally edited — 137 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (15 matched lines × 2 locations) · ×1
Duplicated block with local edits (15 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/decoder/BatchResult.vue:16— WinsockPacketEditor/WebUI/src/components/decoder/BatchResult.vue:16 · WinsockPacketEditor/WebUI/src/components/decoder/SmartResult.vue:23 — the two spans are one implementation copied and then locally edited — 220 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (14 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:122— WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:122 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:173 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (14 lines × 4 locations) WinsockPacketEditor/WebUI/src/components/proxy/AccountAdjust.vue:81— WinsockPacketEditor/WebUI/src/components/proxy/AccountAdjust.vue:81 · WinsockPacketEditor/WebUI/src/components/proxy/AccountEdit.vue:128 · WinsockPacketEditor/WebUI/src/components/proxy/AutoStoresEdit.vue:69 · WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:925 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (13 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/InjectView.vue:400— WinsockPacketEditor/WebUI/src/components/InjectView.vue:400 · WinsockPacketEditor/WebUI/src/components/StartView.vue:58 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (13 lines × 4 locations) WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue:200— WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue:200 · WinsockPacketEditor/WebUI/src/components/proxy/HookSetting.vue:199 · WinsockPacketEditor/WebUI/src/components/proxy/LeachSetting.vue:125 · WinsockPacketEditor/WebUI/src/components/proxy/SystemSetting.vue:58 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (13 matched lines × 2 locations) · ×1
Duplicated block with local edits (13 matched lines × 2 locations) WinsockPacketEditor/WebUI/src/components/proxy/ListSetting.vue:60— WinsockPacketEditor/WebUI/src/components/proxy/ListSetting.vue:60 · WinsockPacketEditor/WebUI/src/components/proxy/ProxySetting.vue:84 — the two spans are one implementation copied and then locally edited — 73 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (12 lines × 3 locations) WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:100— WinsockPacketEditor/WebUI/src/components/decoder/DecoderList.vue:100 · WinsockPacketEditor/WebUI/src/components/proxy/RobotList.vue:123 · WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:150 — the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (9 lines × 2 locations) WinsockPacketEditor/WebUI/src/components/HexPanel.vue:88— WinsockPacketEditor/WebUI/src/components/HexPanel.vue:88 · WinsockPacketEditor/WebUI/src/components/proxy/PacketModification.vue:44 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Complex function onKey (cyclomatic 35, cognitive 38) WinsockPacketEditor/WebUI/src/components/HexView.vue:346— onKey has cyclomatic complexity 35 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function transform (cyclomatic 31, cognitive 54) WinsockPacketEditor/WebUI/src/components/proxy/Transcode.vue:94— transform has cyclomatic complexity 31 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onPick (cyclomatic 23, cognitive 31) WinsockPacketEditor/WebUI/src/components/HexPanel.vue:209— onPick has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onMenuPick (cyclomatic 23, cognitive 29) WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:299— onMenuPick has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onKey (cyclomatic 23, cognitive 26) WinsockPacketEditor/WebUI/src/components/CyberSelect.vue:125— onKey has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function zhDescription (cyclomatic 20, cognitive 19) WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue:50— zhDescription has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onMenuPick (cyclomatic 18, cognitive 24) WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:541— onMenuPick has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function save (cyclomatic 18, cognitive 18) · ×1
Complex function save (cyclomatic 18, cognitive 18) WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:866— save has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function core (cyclomatic 17, cognitive 22) WinsockPacketEditor/WebUI/src/diff.ts:168— core has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function toBlocks (cyclomatic 14, cognitive 18) WinsockPacketEditor/WebUI/src/diff.ts:114— toBlocks has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 14, cognitive 17) WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue:102— (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function localizedDescription (cyclomatic 14, cognitive 14) WinsockPacketEditor/WebUI/src/components/proxy/McpSetting.vue:89— localizedDescription has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 14, cognitive 13) WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:183— (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function changeProtocol (cyclomatic 14, cognitive 13) WinsockPacketEditor/WebUI/src/components/proxy/MapRemoteEdit.vue:35— changeProtocol has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parse (cyclomatic 13, cognitive 25) WinsockPacketEditor/WebUI/tools/check-font-sizes.mjs:45— parse has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 13, cognitive 20) WinsockPacketEditor/WebUI/src/bridge/index.ts:26— (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function pasteAt (cyclomatic 13, cognitive 17) WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:509— pasteAt has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function openBind (cyclomatic 13, cognitive 12) WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:691— openBind has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function toggleSend (cyclomatic 12, cognitive 12) WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue:162— toggleSend has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function initTheme (cyclomatic 12, cognitive 10) WinsockPacketEditor/WebUI/src/stores/theme.ts:236— initTheme has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function myers (cyclomatic 11, cognitive 17) WinsockPacketEditor/WebUI/src/diff.ts:57— myers has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onMenuPick (cyclomatic 11, cognitive 10) WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue:189— onMenuPick has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onScroll (cyclomatic 11, cognitive 10) WinsockPacketEditor/WebUI/src/tooltip.ts:339— onScroll has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue: 1348 lines of code WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/FilterEdit.vue has 1348 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/InjectView.vue · ×1
WinsockPacketEditor/WebUI/src/components/InjectView.vue: 1263 lines of code WinsockPacketEditor/WebUI/src/components/InjectView.vue:1— WinsockPacketEditor/WebUI/src/components/InjectView.vue has 1263 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue: 1033 lines of code WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/RobotEdit.vue has 1033 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue: 901 lines of code WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/ProxyData.vue has 901 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/PacketList.vue · ×1
WinsockPacketEditor/WebUI/src/components/PacketList.vue: 873 lines of code WinsockPacketEditor/WebUI/src/components/PacketList.vue:1— WinsockPacketEditor/WebUI/src/components/PacketList.vue has 873 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue · ×1
WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue: 839 lines of code WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue:1— WinsockPacketEditor/WebUI/src/components/inject/InjectData.vue has 839 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue: 661 lines of code WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/SendEdit.vue has 661 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/StartView.vue · ×1
WinsockPacketEditor/WebUI/src/components/StartView.vue: 660 lines of code WinsockPacketEditor/WebUI/src/components/StartView.vue:1— WinsockPacketEditor/WebUI/src/components/StartView.vue has 660 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/TextCompare.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/TextCompare.vue: 658 lines of code WinsockPacketEditor/WebUI/src/components/proxy/TextCompare.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/TextCompare.vue has 658 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue: 651 lines of code WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/ClientList.vue has 651 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue: 617 lines of code WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/AccountList.vue has 617 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/HexView.vue · ×1
WinsockPacketEditor/WebUI/src/components/HexView.vue: 576 lines of code WinsockPacketEditor/WebUI/src/components/HexView.vue:1— WinsockPacketEditor/WebUI/src/components/HexView.vue has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/App.vue · ×1
WinsockPacketEditor/WebUI/src/App.vue: 574 lines of code WinsockPacketEditor/WebUI/src/App.vue:1— WinsockPacketEditor/WebUI/src/App.vue has 574 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue: 517 lines of code WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/FireWallSetting.vue has 517 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue: 503 lines of code WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/PacketEdit.vue has 503 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/WareHouseEdit.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/WareHouseEdit.vue: 476 lines of code WinsockPacketEditor/WebUI/src/components/proxy/WareHouseEdit.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/WareHouseEdit.vue has 476 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/SystemLog.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/SystemLog.vue: 458 lines of code WinsockPacketEditor/WebUI/src/components/proxy/SystemLog.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/SystemLog.vue has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue: 434 lines of code WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/QuickPanel.vue has 434 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue: 430 lines of code WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/MihomoSetting.vue has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/AppSetting.vue · ×1
WinsockPacketEditor/WebUI/src/components/AppSetting.vue: 427 lines of code WinsockPacketEditor/WebUI/src/components/AppSetting.vue:1— WinsockPacketEditor/WebUI/src/components/AppSetting.vue has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue · ×1
WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue: 415 lines of code WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue:1— WinsockPacketEditor/WebUI/src/components/proxy/SendList.vue has 415 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
Test Coverage — 0% of 117 production file(s) reachable from 0 test file(s) via the import graph — 'production' here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace's file count
No test or lint script — test ✗ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
Blocking `MihomoKernel.Stop` inside an `async` method REDACTED:6227— `MihomoKernel.Stop` is a synchronous helper that blocks (`Thread.Sleep`): called from an `async` method it parks the thread exactly as the inline call would. Make the helper `async` and `await` it (`await Task.Delay`, `SemaphoreSlim.WaitAsync`, a `TaskCompletionSource` instead of the poll).
Blocking `McpAgentGateway.Start` inside an `async` method WinsockPacketEditor/ShellForm.cs:499— `McpAgentGateway.Start` is a synchronous helper that blocks (`WaitHandle.WaitOne`): called from an `async` method it parks the thread exactly as the inline call would. Make the helper `async` and `await` it (`await Task.Delay`, `SemaphoreSlim.WaitAsync`, a `TaskCompletionSource` instead of the poll).
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×1
Recursive walk over a caller-supplied document has no depth cap WinsockPacketEditor/Mcp/McpWriteGuard.cs:141— `TryGetCompleted` is public, takes a document from its caller (line 23) and hands it to `Canonicalize`, which calls itself at line 141 with a child of the node it was given (and at line 147) — and nowhere in `Canonicalize` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the tree it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. A document nested past the stack that remains raises `StackOverflowException`, which .NET neither lets you catch nor unwinds: the process is torn down where it stands, taking every other request in flight with it, and no `try`/`catch` around `TryGetCompleted` can intervene. Thread a depth argument through `Canonicalize` and reject the document past a fixed maximum, or rewrite the descent with an explicit stack.
X5 · Nullable reference types· Symbol treated as nullable, then dereferenced unguarded · ×1
Symbol treated as nullable, then dereferenced unguarded REDACTED:30728— This method contradicts itself about `Session`: line 30726 writes `Session?.WpcToken`, which says `Session` can be null, but line 30728 then dereferences it directly as `Session.WpcToken` with no null test between them and no guard around it. If the `?.` is right, that dereference throws NullReferenceException on the input it was written for; if `Session` truly cannot be null here, the `?.` is misleading. Settle it one way — test `Session` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:497— `PacketLoop` swallows every exception and sets `frame = null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:569— `EventLoop` swallows every exception and sets `frame = null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Core/Ipc/ShellLink.cs:770— `Snapshot` swallows every exception into `return new List<T>();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:527— `WriteEvents` swallows every exception into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:721— `Snapshot` swallows every exception into `return new List<T>();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:752— `ControlLoop` swallows every exception and sets `req = null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:948— `Dispatch` swallows every exception and sets `name = "(?)";` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/HttpSniffer.cs:244— `ChunkedTotal` swallows every exception into `return -1;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:435— `ReadVersion` swallows every exception into `return string.Empty;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ClassObject/ProxySession.cs:533— `SendUdpData` swallows every exception and returns `iReturn` still holding `0` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/Mcp/McpAgentGateway.cs:2555— `IsProcessAlive` swallows every exception into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:175— `IsAdministrator` swallows every exception into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:1407— `DecryptXMLFile` swallows every exception and sets `xdReturn = null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:1994— `Base64_Decoding` swallows every exception and returns `sReturn` still holding `string.Empty` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:5762— `GetProcessPath` swallows every exception into `return string.Empty;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:6127— `SelfProcessId` swallows every exception and sets `selfModuleName = null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:9472— `ResolveAddress` swallows every exception into `return null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:18180— `SearchForList` swallows every exception into `return -1;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ShellForm.cs:560— `IsDevServerUp` swallows every exception and sets `done = true;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WinsockPacketEditor/ShellForm.cs:6467— `SafeProcessPath` swallows every exception into `return string.Empty;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WPELauncher/LauncherDialog.cs:127— `DpiAt` swallows every exception into `return 96;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:152— `HasMarker` swallows `IOException` into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:408— `IsInUse` swallows `IOException` into `return true;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:517— `TryDeleteDirectory` swallows every exception into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch WPELauncher/Program.cs:52— `Main` swallows `AbandonedMutexException` and sets `owned = true;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
+ 1 more in this group — see findings.md.
S1 · Web-Security Posture· No inbound model validation detected · ×11
No inbound model validation detected — No ModelState/[ApiController]/FluentValidation signal — inbound payloads reach handlers unvalidated. (−2.0 on this card.)
No inbound model validation detected REDACTED:89— `ProxyAccount_Controller.GetProxyAccountByID` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:111— `ProxyAccount_Controller.GetPlainPassword` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:130— `ProxyAccount_Controller.GetPassWordDecrypt` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:142— `ProxyAccount_Controller.AddProxyAccount` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:190— `ProxyAccount_Controller.DeleteProxyAccount` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:211— `ProxyAccount_Controller.UpdateProxyAccount` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:50— `ProxyInfo_Controller.GetProxyAuthList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:70— `ProxyInfo_Controller.GetProxyLogList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:62— `SocketInfo_Controller.GetSocketLogList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
No inbound model validation detected REDACTED:74— `SocketInfo_Controller.GetProxyLogList` binds request input and nothing in this codebase validates it — no [ApiController]/ModelState check, validator or guard.
Duplicated predicate WinsockPacketEditor/ClassObject/RobotExecute.cs:339— `!string.IsNullOrEmpty(sContent) && sContent.IndexOf("|") > 0` appears character-identically in 2 files — WinsockPacketEditor/ClassObject/RobotExecute.cs, REDACTED. 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 REDACTED:244— `char.IsControl(c) && c != '\r' && c != '\n' && c != '\t'` appears character-identically in 2 files — REDACTED, WinsockPacketEditor/ClassObject/ProtocolDecoder.cs. 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 WinsockPacketEditor/ClassObject/HttpSniffer.cs:214— `data[i] == 13 && data[i + 1] == 10 && data[i + 2] == 13 && data[i + 3] == 10` appears character-identically in 2 files — WinsockPacketEditor/ClassObject/HttpSniffer.cs, REDACTED. 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 WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs:95— `extractor == null || extractor.Variables == null` appears character-identically in 2 files — WinsockPacketEditor/ClassObject/PacketExtractorConfig.cs, WinsockPacketEditor/ClassObject/PacketVariableEngine.cs. 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 WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs:302— `filterAction != Operate.FilterConfig.Filter.FilterAction.Intercept && res <= 0` appears character-identically in 2 files — WinsockPacketEditor/ClassObject/Core/Ipc/WpeCore.cs, REDACTED. 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 WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs:133— `pi != null && !string.IsNullOrEmpty(pi.ModuleName)` appears character-identically in 2 files — WinsockPacketEditor/ClassObject/Kernel/MihomoKernel.cs, REDACTED. 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 WinsockPacketEditor/Mcp/McpAgentGateway.cs:1979— `rule.Direction < 0 || rule.Direction > 2` appears character-identically in 2 files — WinsockPacketEditor/Mcp/McpAgentGateway.cs, WinsockPacketEditor/ShellForm.cs. 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 WinsockPacketEditor/ClassObject/RobotExecute.cs:198— `sContent.Contains("Customize") && sContent.Contains("|")` appears character-identically in 2 files — WinsockPacketEditor/ClassObject/RobotExecute.cs, REDACTED. 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 WinsockPacketEditor/ClassObject/BlackListInfo.cs:163— `this._StartIP != -1 && this._EndIP != -1 && ipValue >= this._StartIP && ipValue <= this._EndIP` appears character-identically in 2 files — WinsockPacketEditor/ClassObject/BlackListInfo.cs, WinsockPacketEditor/ClassObject/WhiteListInfo.cs. 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.
Silent fallback default on parse failure REDACTED:746— `HexToBytes` returns `new byte[0]` when `byte.TryParse(s.Substring(i * 2, 2), System.Globalization.NumberStyles.AllowHexS…` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure WinsockPacketEditor/ClassObject/Decoder/FrameExtractor.cs:215— `ParseHex` returns `new byte[0]` when `byte.TryParse(s.Substring(i * 2, 2), System.Globalization.NumberStyles.AllowHexS…` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure WinsockPacketEditor/ClassObject/PacketVariableEngine.cs:56— `GetCurrentDisplay` falls back to `"—"` when `TryParseConstant(variable, out constant)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure REDACTED:11705— `AddToSend_ByProxyIds` returns `0` when `Guid.TryParse(SID, out gid)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure REDACTED:11745— `AddToWareHouse_ByProxyIds` returns `0` when `Guid.TryParse(WID, out gid)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure REDACTED:17682— `AddToSend_ByPacketIds` returns `0` when `Guid.TryParse(SID, out gid)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure REDACTED:17722— `AddToWareHouse_ByPacketIds` returns `0` when `Guid.TryParse(WID, out gid)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure REDACTED:19064— `SetDecoderEnable_ById` returns `false` when `Guid.TryParse(id, out g)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure REDACTED:23018— `SaveFilterEdit` falls back to `Guid.Empty` when `Guid.TryParse(Row.ExecuteId, out g)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Documentation: no build, run or usage example README.md:1— the repository holds project manifests and neither `README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
No ADRs found WPELauncher/WPELauncher.csproj:19— 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 `WPELauncher/WPELauncher.csproj` makes this repository a deployable product (line 19).
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion WinsockPacketEditor/WinsockPacketEditor.csproj:1— `WinsockPacketEditor` overshoots its size bounds (60031 LoC, 268 public types across 3 namespaces). 1 of 7 project(s) overshoot their size bounds, lowering Project Cohesion to 7.1/10. Size alone is no reason to split a project: where its type references show a separable part, a Split row names it.
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.
No SAST — No static application security testing detected. For this repository's stack, add CodeQL's csharp pack, or a .NET security analyzer package (or `semgrep --config=auto`, which runs on any language) — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
No dependency-update automation WPEMcpServer/WPEMcpServer.csproj:14— `WPEMcpServer/WPEMcpServer.csproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Unused export 'hexToBytes' WinsockPacketEditor/WebUI/src/components/decoder/actions.ts:116— Nothing imports this binding — it is safe to review for removal.
Unused export 'bytesToB64' WinsockPacketEditor/WebUI/src/components/decoder/actions.ts:122— Nothing imports this binding — it is safe to review for removal.
Unused export 'DecProtocol' WinsockPacketEditor/WebUI/src/components/decoder/enums.ts:6— Nothing imports this binding — it is safe to review for removal.
Unused export 'DecDirection' WinsockPacketEditor/WebUI/src/components/decoder/enums.ts:7— Nothing imports this binding — it is safe to review for removal.
Security headers incomplete WinsockPacketEditor/WebAPI/Socket_Web.cs:42— Set: Referrer-Policy, X-Content-Type-Options, X-Frame-Options. Missing: Content-Security-Policy, Strict-Transport-Security — 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.)
No app-layer HTTPS enforcement detected — No UseHttpsRedirection/UseHsts and no reverse-proxy signal — transport security is unverified at the app layer. (−2.0 on this card.)
X2 · Cancellation propagation· Not all async methods take a CancellationToken · ×1
Not all async methods take a CancellationToken — Only 11/277 async methods accept a CancellationToken, so in-flight work can't be stopped early when the caller gives up — whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice — judge against your hosting model.
Null-forgiving operator (`!`) suppressions override nullable warnings — ~0.2 `!` suppressions per 1k syntax nodes — 2 suppression(s) across the 9592 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
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.
nuget: not applicable — nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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. semgrep could not parse 2 file(s) — `WinsockPacketEditor/Mcp/McpAgentGateway.cs`, `WinsockPacketEditor/WebUI/src/i18n/base.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
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.
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.
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.
Run 01a1e58c-8a06-7951-83dd-eddc6eaa12e9 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 68 · Warnings: 803 · Recommendations: 70 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 16-11-2026 @ 18:09 UTC.
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.