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

0auBSQ/OpenTaiko

Measured 17 November 2026, 13:10 UTC, at code version 50b190a

Code coverage is not measured: Suite not runnable in-image.

Boundary Type-Coupling is not measured: Bounded contexts not declared.

Knowledge freshness is not measured: Freshness signal contradicted by repo activity.

CAI score 42.5out of 100 Weak
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: 197,818 lines of product code in 6 projects, tests not counted · Estimated rebuild effort: about 24.7 person-years · Weakest lens: Code Health, 37.1

Findings by how serious they are

178 critical 1382 serious 163 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

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 13:10 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 ▸

66of 66 dimensions measured by tools.
1707of 1723 findings point to an exact file and line, so you can open each one in the code. The other 16 concern the repository as a whole, such as missing documentation.
66dimensions across 6 lenses, read from 197,818 lines of product code in 6 projects.
Chapters

Executive summary

0auBSQ/OpenTaiko falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 42.5 out of 100 and is rated Weak, and 22 of its 178 critical findings are security problems.

Code Health, at 37.1, is the weakest lens and counts most in the score. The best first step is removing the unread values, worth about 4.2 points. Removing the blocking waits would lift Code Health itself, worth about 2.9 points. Raising Code Health to 70 would lift the score to about 47.7.

Eleven weaknesses in the code could be used by an attacker. Six pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and 125 errors are caught and ignored, so failures can go unnoticed. Fixing the weaknesses the scanner points to, pinning each tool to an exact version and handling or logging the ignored errors would close these risks. Limiting each secret to its own step would fix the two secrets exposed to more of the pipeline than needed, and loading the key from a secret store instead of the code would deal with the encryption key written into the code. The 30 data fields that are written but never read need removing.

The product code is 197,818 lines, about €3,600,000 to rebuild.

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

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

If Code Health rose from 37.1 to 70, the lowest score rated Strong, the score would rise from 42.5 to about 47.7.

Code composition: what the lines of code are
Business logic 61%Supporting code 30%Tests 9%
Rebuild cost: about €3,600,000 · Estimate
Cost to rebuild€1,200,000 to €6,100,000, for 19,334 to 63,777 hours of work, about 24.7 person-years for 14 to 48 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 43. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 197,818 lines of product code
Comment linesThe estimate prices 184,208 lines. Comment lines count towards the size of 197,818 lines but aren't priced as work.
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 30 WriteOnlyPrivateField finding(s) in Explicit Debt — start with CActOptionPanel.cs (10), SoundManager.cs (2), MetalPresenter.cs (2).
Raises the score by about 4.2 points · Medium effort · Explicit Debt
2
Resolve the 99 CommentedOutCode finding(s) in Explicit Debt — start with CActImplCharacter.cs (15), HEasingMethods.cs (11), CActImplBackground.cs (9).
Raises the score by about 3.1 points · Medium effort · Explicit Debt
3
Resolve the 125 EmptyCatchBlock finding(s) in Explicit Debt — start with LuaNetworking.cs (41), CTraceLogListener.cs (8), VideoExporter.cs (8).
Raises the score by about 4.2 points · High 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 €3,600,000 to build again, about 24.7 person-years of work. Its weakest lens is Code Health, at 37.1 (Weak). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Resolve the 30 WriteOnlyPrivateField finding(s) in Explicit Debt. Of all the actions in this report, it raises the score most for the work it takes: about 4.2 points for medium effort, because it clears the 30 Explicit Debt findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.5 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 6% to 14% on every change. The history of the code shows how much it changes: about 302,948 lines over the last 90 days, which is about 1,228,622 lines a year. At that pace, the extra work comes to an estimated 195.4 to 1172.1 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.

arch FDK FDK FFmpeg.AutoGen AutoGen OpenTaiko OpenTaiko OpenTaiko->FDK OpenTaiko.Android Android OpenTaiko.Android->FDK OpenTaiko.Android->OpenTaiko OpenTaiko.iOS iOS OpenTaiko.iOS->FDK OpenTaiko.iOS->OpenTaiko

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.

18 modules, with 13 dependencies between them. One loop runs through 2 of the modules, marked above the diagonal.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 FDK.BassMixExtension2 FDK.ExtensionMethods3 LWGFW.Graphics4 OpenTK.Graphics.Egl5 OpenTaiko.Android.scripts6 OpenTaiko.docs7 OpenTaiko.iOS.scripts8 SevenZip.Compression.LZMA9 SlimDXKeys10 System11 System.ArrayExtensions12 FDK13 OpenTaiko.AviUtl214 OpenTaiko.Animations15 OpenTaiko16 OpenTaiko.Android17 OpenTaiko.CSongListNodeComparers18 OpenTaiko.iOS
1 FDK.BassMixExtension
2 FDK.ExtensionMethods
3 LWGFW.Graphics
4 OpenTK.Graphics.Egl
5 OpenTaiko.Android.scripts
6 OpenTaiko.docs
7 OpenTaiko.iOS.scripts
8 SevenZip.Compression.LZMA
9 SlimDXKeys
10 System
11 System.ArrayExtensions
12 FDK1
13 OpenTaiko.AviUtl22
14 OpenTaiko.Animations1
15 OpenTaiko216132
16 OpenTaiko.Android113
17 OpenTaiko.CSongListNodeComparers8
18 OpenTaiko.iOS165
Uses a module listed above itPart of a loopThe module itself
1 FDK.BassMixExtension2 FDK.ExtensionMethods3 LWGFW.Graphics4 OpenTK.Graphics.Egl5 OpenTaiko.Android.scripts6 OpenTaiko.docs7 OpenTaiko.iOS.scripts8 SevenZip.Compression.LZMA9 SlimDXKeys10 System11 System.ArrayExtensions12 FDK13 OpenTaiko.AviUtl214 OpenTaiko.Animations15 OpenTaiko16 OpenTaiko.Android17 OpenTaiko.CSongListNodeComparers18 OpenTaiko.iOSFDK.BassMixExtension1FDK.ExtensionMethods2LWGFW.Graphics3OpenTK.Graphics.Egl4OpenTaiko.Android.scripts5OpenTaiko.docs6OpenTaiko.iOS.scripts7SevenZip.Compression.LZMA8SlimDXKeys9System10System.ArrayExtensions11FDK12OpenTaiko.AviUtl213OpenTaiko.Animations14OpenTaiko15OpenTaiko.Android16OpenTaiko.CSongListNodeComparers17OpenTaiko.iOS181212161321138165

At a glance — Code Health · 37.1 · Weak · gated by D1, D2, X1, X4 ·

At a glance — Architecture · 71.1 · Adequate · gated by AX2 ·

At a glance — Maturity · 65.3 · Adequate · gated by M2 ·

At a glance — Readiness · 39.6 · Weak · gated by P3, P7, P8 ·

At a glance — Security · 44.5 · Weak · gated by D29, D36, C1 ·

At a glance — Performance · 60.0 · Adequate ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection28High / Critical
A03:2025 — Software Supply Chain Failures6Medium

Roadmap

Top priorities: Resolve the 125 EmptyCatchBlock finding(s) in Explicit Debt — start with LuaNetworking.cs (41), CTraceLogListener.cs (8), VideoExporter.cs (8); Resolve the 30 WriteOnlyPrivateField finding(s) in Explicit Debt — start with CActOptionPanel.cs (10), SoundManager.cs (2), MetalPresenter.cs (2); Resolve the 99 CommentedOutCode finding(s) in Explicit Debt — start with CActImplCharacter.cs (15), HEasingMethods.cs (11), CActImplBackground.cs (9).

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

Do thisHelpsEffortDimension
Resolve the 30 WriteOnlyPrivateField finding(s) in Explicit Debt — start with CActOptionPanel.cs (10), SoundManager.cs (2), MetalPresenter.cs (2).+4.2 ptsMediumExplicit Debt
Resolve the 99 CommentedOutCode finding(s) in Explicit Debt — start with CActImplCharacter.cs (15), HEasingMethods.cs (11), CActImplBackground.cs (9).+3.1 ptsMediumExplicit Debt
Resolve the 125 EmptyCatchBlock finding(s) in Explicit Debt — start with LuaNetworking.cs (41), CTraceLogListener.cs (8), VideoExporter.cs (8).+4.2 ptsHighExplicit Debt
Sync-over-async (deadlock risk) through `.Result`+2.9 ptsMediumAsync correctness
Add a SAST step to CI running 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 — so a security regression fails the build instead of landing.+2.8 ptsMediumSecurity & performance tooling
Bring the 2 bodies over 240 down to 240 or less in Cyclomatic Complexity — start with CSkin.tLoadFromString (cyclomatic 1318), CStagePlayScreenCommon.tProgressDraw_Chip (cyclomatic 391).+1.3 ptsMediumCyclomatic Complexity
Resolve the 8 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED, REDACTED.+1.2 ptsLowStatic Analysis (SAST)
Interpolated log message defeats structured logging+2.4 ptsMediumStructured logging

File quality

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

FileScoreBandWorst signal
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
OpenTaiko/src/Songs/CTja.cs1.0SlopExplicit Debt: WriteOnlyPrivateField
OpenTaiko/src/Songs/CSongManager.cs1.0SlopExplicit Debt: EmptyCatchBlock
FDK/src/03.Sound/SoundManager.cs1.0SlopExplicit Debt: EmptyCatchBlock
OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs1.2SlopExplicit Debt: WriteOnlyPrivateField
OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs1.5SlopExplicit Debt: WriteOnlyPrivateField
OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs1.6SlopExplicit Debt: EmptyCatchBlock
REDACTED1.9SlopExplicit Debt: EmptyCatchBlock
OpenTaiko/src/Components/CSongReplay.cs1.9SlopExplicit Debt: EmptyCatchBlock
OpenTaiko/src/Stages/CActOptionPanel.cs2.1SlopExplicit Debt: WriteOnlyPrivateField
OpenTaiko/src/Lua/Networking/LuaNetworking.cs2.2SlopExplicit Debt: EmptyCatchBlock
OpenTaiko/src/Common/VideoExporter.cs2.2SlopExplicit Debt: EmptyCatchBlock
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs2.4SlopExplicit Debt: EmptyCatchBlock
FDK/src/04.Graphics/CTexture.cs2.4SlopExplicit Debt: EmptyCatchBlock
OpenTaiko.Android/MainActivity.cs2.4SlopExplicit Debt: EmptyCatchBlock
OpenTaiko/src/Common/ImGuiDebugWindow.cs2.8SlopExplicit Debt: WriteOnlyPrivateField
OpenTaiko/src/Stages/02.Title/CEnumSongs.cs3.0SlopExplicit Debt: EmptyCatchBlock
OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs3.0SlopExplicit Debt: WriteOnlyPrivateField
FDK/src/02.Input/CInputManager.cs3.2SlopExplicit Debt: EmptyCatchBlock

How the grades work

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

Critical — 178

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 — 1382

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 — 163

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 66 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 — 66 dimensions across the health lenses
D1D2D3D4D5D6D10D11D13D14D15D16D17D18D19D20D21D24D26D27D29D35D36D43D44AX10AX2AX3AX4AX5AX6AX8C1C4GD1IC1M1M2M3M4P1P2P3P4P6P7P8PF3S1X1X12X13X14X16X18X19X2X21X24X27X28X29X3X30X4X5

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

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1e9a1-4279-784d-b528-63f1bbc7ae29.

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

Run transparency — what happened this run

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

  • D4 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 139 duplicated block group(s) on this row were found in the languages this pass could tokenize, and they do NOT cover all of this repository's production source: .lua (88,856 lines, 45% of production source) went unread, because no language model this pass could load exposed a clone-unit token stream for those file kinds. Duplication in that source is UNMEASURED — its absence from the count above is a gap in this analyzer's language coverage, not a finding that the code is free of duplication.
  • 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 (9,564 test / 107,537 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.
  • 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: /usr/share/dotnet/sdk/10.0.400/Sdks/Microsoft.NET.Sdk/targets/Microsoft.NET.Sdk.ImportWorkloads.targets(38,5): error NETSDK1178: The project depends on the following workload packs that do not exist in any of the workloads available in this installation: Microsoft.iOS.Sdk.net10.0_27.2 [/tmp/codeheal….
  • D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Msbuild failed when processing the file 'OpenTaiko.iOS/OpenTaiko.iOS.csproj' with message: The task "ResolveNativeReference" is not supported on the .NET Core version of MSBuild. Please use the .NET Framework version of MSBuild. See https://aka.ms/msbuild/MSB4803 for further details.
  • D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 294 deducted marker(s) and the 1.7/KLoC density on this row were taken over this repository's .NET projects ALONE: .lua (88,856 lines, 45% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
  • D18 Solution Shape — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The build did not finish within its budget on this run; structural metrics are reported, build/warning status is unknown.
  • 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.
  • 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 — 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. 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 — 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. 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 — 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. 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 (107,537 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 — 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. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not 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 3838 sampled here came from .cs files. This repository's .lua 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.
  • D28 Secrets (history) — 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. `gitleaks` TIMED OUT after 75s against a 75s budget, so we killed its process tree. The budget is ours; the work may simply be larger than it allows. Nothing about this repository is asserted by the absence of a result; the budget is ours to raise, and raising it is our backlog item, not an action for this repository's owner.
  • 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. `OpenTaiko/src/Common/CNotesSkins.cs`, `REDACTED`, `OpenTaiko/src/Lua/3D/GpuRasterizer.Shaders.cs`, `OpenTaiko/src/Lua/LuaSecurity.cs`, `OpenTaiko/src/Songs/CDTXStyleExtractor.cs`, … (+4 more) 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.
  • D34 Knowledge Freshness — 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. File-level freshness contradicts repo activity: 35 commits in the last 90 days, yet 306 of 334 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run.
  • AX2 Stateful singletons — 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. 73 further occurrence(s) are not listed individually; the score already reflects all 113.
  • AX6 Interface segregation — 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.
  • AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: a native UI project (OpenTaiko.iOS/Resources/LaunchScreen.storyboard). The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • 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.
  • 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. 473 further occurrence(s) are not listed individually; the score already reflects all 513.
  • 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.
  • P1 CI/CD gates — 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. A CI pipeline exists and the word "test" appears, but no explicit test-runner invocation (your stack's test command, or a test job) was matched — so either the gate runs tests through a step this pass could not recognise, or "test" is incidental here (a path, "latest", a reporter). Which of the two it is cannot be settled from this dimension's evidence; the coverage dimensions report whether a suite exists at all. You can widen what we reach: name the test runner explicitly in the pipeline step (your stack's test command, or a job named for the suite) so the gate is unambiguous to a reader and to this pass.
  • 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.
  • 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.
  • 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. 6 further occurrence(s) are not listed individually; the score already reflects all 46.
  • X19 Unrestored process-global state — 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.
  • X21 Side-effecting pattern 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.
  • X24 Document value interpolated into markup unescaped — 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. 101 further occurrence(s) are not listed individually; the score already reflects all 141.
  • 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.
  • X4 Structured logging — 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.
  • X7 Silent fallback defaults — 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. 17 further occurrence(s) are not listed individually; the score already reflects all 57.
  • Package restore incomplete — third-party types were unresolved in part of the solution — NuGet restore did not complete for OpenTaiko.iOS/OpenTaiko.iOS.csproj, OpenTaiko.Android/OpenTaiko.Android.csproj, so those projects were analysed with framework references only: every check keyed on a third-party type saw an error type there and reported nothing. Findings on those projects are a lower bound; run `dotnet restore` on them and rescan.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • 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.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
  • 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.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • 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.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • 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.
  • 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").
  • 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.
  • C4 Data Retention: This control is scored from in-repo evidence only — its real-world effectiveness, exercised only at runtime, is outside a static scan.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity2.0 / 10Critical✓ Tool-verified

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

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

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

260 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was CSkin.tLoadFromString at 1318. A further 14 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 CInputKeyboard_iOS.HIDUsageToSlimDXKey at 105 — they are counted neither in the figure above nor in this dimension's score. 5 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: OpenTaiko.Android/CInputKeyboard_Android.cs (CInputKeyboard_Android.HIDUsageToSlimDXKey at 105), OpenTaiko.iOS/CInputKeyboard_iOS.cs (CInputKeyboard_iOS.HIDUsageToSlimDXKey at 105), OpenTaiko/src/Components/CUnlockConditionFactory.cs (CUnlockConditionFactory.GenerateUnlockObjectFromJsonRaw at 20), OpenTaiko/src/Lua/3D/Lua3DScene.GrassTile.cs (Lua3DScene.GrassTileParam at 19), OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs (Lua3DScene.ObjSetTransform16 at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

CSkin.tLoadFromString (cyclomatic 1318)OpenTaiko/src/Common/CSkin.cs:1121
CStagePlayScreenCommon.tProgressDraw_Chip (cyclomatic 391)OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2837
CTja.ParseCommand (cyclomatic 172)OpenTaiko/src/Songs/CTja.cs:1835
GltfModel.LoadUncached (cyclomatic 148)OpenTaiko/src/Lua/3D/GltfModel.cs:869
Dan_Cert.UpdateReachStatus (cyclomatic 121)OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:320

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

What to do

  1. Bring the 2 bodies over 240 down to 240 or less in Cyclomatic Complexity — start with CSkin.tLoadFromString (cyclomatic 1318), CStagePlayScreenCommon.tProgressDraw_Chip (cyclomatic 391). — 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 2 together lifts Cyclomatic Complexity from 2.0 to about 3.5/10, projected with the scoring formula itself and assuming each lands exactly at 240; a cleaner split scores higher.

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

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

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

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

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

409 method(s) exceeded the cognitive complexity threshold of 15; the worst was CSkin.tLoadFromString at 2668.

CSkin.tLoadFromString (cognitive 2668)OpenTaiko/src/Common/CSkin.cs:1121
CStagePlayScreenCommon.tProgressDraw_Chip (cognitive 588)OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2837
GltfModel.LoadUncached (cognitive 377)OpenTaiko/src/Lua/3D/GltfModel.cs:869
CActImplGauge.Draw (cognitive 248)OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs:76
Dan_Cert.DrawExam (cognitive 248)OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:796

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

What to do

  1. Bring the 68 bodies over 60 down to 60 or less in Cognitive Complexity — start with CSkin.tLoadFromString (cognitive 2668), CStagePlayScreenCommon.tProgressDraw_Chip (cognitive 588), GltfModel.LoadUncached (cognitive 377). — 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 68 together lifts Cognitive Complexity from 2.0 to about 4.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes7.4 / 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.

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

111 god class(es) detected.

MethodTooLong: CSkin.tLoadFromString · ×48OpenTaiko/src/Common/CSkin.cs:1121
TooManyMethods: Lua3DScene · ×27OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs
FileTooLong: Common/CSkin.cs · ×24OpenTaiko/src/Common/CSkin.cs
ClassTooLong: Dan_Cert · ×12OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs

What to do

  1. Resolve the 48 MethodTooLong finding(s) in God Classes — start with CStagePlayScreenCommon.cs (5), CConfigIni.cs (4), CTja.cs (4). — One of this dimension's main actionable groups (48 warning-level).
  2. Resolve the 27 TooManyMethods finding(s) in God Classes — start with Lua3DScene.Objects.cs, CStagePlayScreenCommon.cs, GpuRasterizer.Shadows.cs. — One of this dimension's main actionable groups (27 warning-level).
  3. Resolve the 24 FileTooLong finding(s) in God Classes — start with CSkin.cs, CStagePlayScreenCommon.cs, CTja.cs. — One of this dimension's main actionable groups (24 warning-level).

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

D4 · Code Duplication8.2 / 10Strong✓ Tool-verified

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

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

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

139 duplicated block group(s) detected. 4.6 % of the production lines (4,902 of 107,537) are in a reported copy. A further 127 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. Measured on part of this repository only: .lua (45% of production source) was not exposed to the token comparison, so duplication there is unmeasured and is not in this count.

Duplicated block (5 lines × 2) · ×26OpenTaiko/src/Lua/3D/RtScene.cs:356
Duplicated block (6 lines × 2) · ×19OpenTaiko/src/Songs/CTja.cs:2173
Duplicated block (7 lines × 2) · ×11OpenTaiko/src/Songs/CSongManager.cs:405
Edited copy of a member (7 corresponding lines) · ×10OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:156
Edited copy of a member (6 corresponding lines) · ×9OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:85

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

What to do

  1. Resolve the 26 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with RtScene.cs (5), DBCharacter.cs (3), Rasterizer.cs (2). — One of this dimension's main actionable groups (26 warning-level).
  2. Resolve the 19 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with Rasterizer.cs (2), Dan_Cert.cs (2), CTja.cs. — One of this dimension's main actionable groups (19 warning-level).
  3. Resolve the 11 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with CStagePlayScreenCommon.cs (2), CSongManager.cs, CStageOnlineLounge.cs. — One of this dimension's main actionable groups (11 warning-level).

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

D5 · Coupling10.0 / 10Exemplary✓ 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.

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

6 projects, 0 dependency cycle(s), 0 unstable depended-on project(s).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.6 / 10Stronggated by 8 serious findings✓ Tool-verified

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

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

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

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

8 of 272 classes have LCOM4 above 3.

Low cohesion: Lua3DScene (LCOM4 39) · ×8OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:7

What to do

  1. Resolve the 8 Low cohesion finding(s) in Cohesion (LCOM4) — start with Lua3DScene.Objects.cs, PhysicsBody.cs, LuaInput.cs. — One of this dimension's main actionable groups (8 warning-level).

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

D10 · Test Quality10.0 / 10Stronggated by 7 serious findings✓ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

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

0 skipped, 0 zero-assertion, 7 synchronised by a fixed sleep, no mocking-framework packages referenced (hand-written doubles or no mocking) across 508 tests.

Fixed-sleep synchronisation: Host_SubscribesAgain_AfterTheBrokerDropsItsLink · ×7OpenTaiko.Tests/NetworkingConnectTests.cs:214

What to do

  1. Resolve the 7 Fixed-sleep synchronisation finding(s) in Test Quality — start with VideoAudioTests.cs (4), NetworkingConnectTests.cs (2), NetworkingTests.cs. — One of this dimension's main actionable groups (7 warning-level).

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

D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests pass reliably, with no flakiness.

Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.

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

0 flaky across 1 measured tier(s). unit: measured (0 flaky).

✓ On the Gold path — maintain.

Detailed fixes: d11_recommendation.md.

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

0 of 241 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 36 direct `PackageReference`(s), and 202 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.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots8.3 / 10Strong✓ Tool-verified

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

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

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

Top hotspots: OpenTaiko/src/Common/CSkin.cs (4×1318=5272); OpenTaiko/src/Common/OpenTaiko.cs (7×106=742); OpenTaiko/src/Songs/CTja.cs (4×172=688)

Hotspot: OpenTaiko/src/Common/CSkin.cs · ×15OpenTaiko/src/Common/CSkin.cs:1121

What to do

  1. Resolve the 15 Hotspot finding(s) in Churn × Complexity Hotspots — start with CSkin.cs, OpenTaiko.cs, CTja.cs. — One of this dimension's main actionable groups (15 warning-level).

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

D16 · Bus Factor9.9 / 10Exemplary✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

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

3 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is FDK/src/03.Sound/CSoundDeviceBASS.cs. Counted over 334 of the 500 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)

✓ On the Gold path — maintain.

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

D17 · Explicit Debt6.6 / 10Adequate✓ Tool-verified

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

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

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

294 deducted debt markers + unmeasured dead symbols across 107537 LoC in the .NET projects (1.7/KLoC) → score 6.6. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .lua (45% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).

EmptyCatchBlock · ×125FDK/src/00.Common/CTraceLogListener.cs:21
WriteOnlyPrivateField · ×30FDK/src/02.Input/CInputGamepad.cs:87
CommentedOutCode · ×99FDK/src/01.Framework/Core/Game.cs:408
TodoComment · ×11OpenTaiko/src/Character/PuchiChara.cs:88
Whole file has no live code — 10 debt markers inside it · ×3FDK/src/06.Tempo/CBeatDetect.cs:2

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

What to do

  1. Resolve the 125 EmptyCatchBlock finding(s) in Explicit Debt — start with LuaNetworking.cs (41), CTraceLogListener.cs (8), VideoExporter.cs (8). — One of this dimension's main actionable groups (125 issue-level).
  2. Resolve the 30 WriteOnlyPrivateField finding(s) in Explicit Debt — start with CActOptionPanel.cs (10), SoundManager.cs (2), MetalPresenter.cs (2). — One of this dimension's main actionable groups (30 issue-level).
  3. Resolve the 99 CommentedOutCode finding(s) in Explicit Debt — start with CActImplCharacter.cs (15), HEasingMethods.cs (11), CActImplBackground.cs (9). — One of this dimension's main actionable groups (99 warning-level).

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

D18 · Solution Shape10.0 / 10Exemplary✓ Tool-verified

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.

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

5 projects, 574 source files, 117101 hand-written lines of code (107537 production / 9564 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), 6 inter-project edges (build status unknown — did not finish).

✓ On the Gold path — maintain.

Detailed fixes: d18_recommendation.md.

D19 · Documentation Quality8.3 / 10Strong✓ Tool-verified

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.

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

1 of 2 documentation facets pass in full; short on: F2 example. 387 document(s) read across 5 unit(s).

Documentation: no build, run or usage exampleREADME.md:1

What to do

  1. 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.

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

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

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

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

No architecture decision records were found.

No ADRs foundOpenTaiko.Android/OpenTaiko.Android.csproj:4

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with OpenTaiko.Android.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.

D21 · Naming Consistency7.4 / 10Strong✓ Tool-verified

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.

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

8 naming inconsistencies among 307 declarations measured against a convention their peers follow.

`bChildBOXRecurse` spells `BOX` where 32 names in the project spell it `Box` · ×2OpenTaiko/src/Songs/CSongManager.cs:114
`ONorOFFToggle` spells `OFF` where 13 names in the project spell it `Off`OpenTaiko/src/Items/CItemBase.cs:20
`ONorOFForIndeterminateThreeState` spells `OF` where 55 names in the project spell it `Of`OpenTaiko/src/Items/CItemBase.cs:21
`bON` spells `ON` where 47 names in the project spell it `On`OpenTaiko/src/Items/CItemToggle.cs:9
`listBRANCH` spells `BRANCH` where 68 names in the project spell it `Branch`OpenTaiko/src/Songs/CTja.cs:388

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

What to do

  1. Resolve the 2 `bChildBOXRecurse` spells `BOX` where 32 names in the project spell it… finding(s) in Naming Consistency — start with CSongManager.cs (2). — One of this dimension's main actionable groups (2 recommendation-level).
  2. Resolve the 1 `ONorOFFToggle` spells `OFF` where 13 names in the project spell it… finding(s) in Naming Consistency — start with CItemBase.cs. — One of this dimension's main actionable groups (1 recommendation-level).
  3. Resolve the 1 `ONorOFForIndeterminateThreeState` spells `OF` where 55 names in the… finding(s) in Naming Consistency — start with CItemBase.cs. — One of this dimension's main actionable groups (1 recommendation-level).

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

D24 · Comment Value9.5 8.0 / 10Strong✓ Tool-verified

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 8.0 / 10 · rule-coverage 85% · ceiling Documented

26 of 4843 judged comments only repeat the code they sit on (0.5 %). 1092 comment(s) in another language or script were not judged.

redundant comment · ×26FDK/src/01.Framework/Rendering/Angle/Egl.cs:213
doc comments repeat the names · ×2FDK/src/00.Common/CConversion.cs:180

What to do

  1. Resolve the 26 redundant comment finding(s) in Comment Value — start with DBCharacter.cs (3), DBPuchichara.cs (3), CStagePlayScreenCommon.cs (3). — One of this dimension's main actionable groups (26 recommendation-level).

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

D26 · Project Cohesion6.7 / 10Adequate✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

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

1 of 6 projects flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesionOpenTaiko/OpenTaiko.csproj:1

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with OpenTaiko.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.

D27 · Navigability9.8 / 10Exemplary✓ Tool-verified

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.

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

81 % of calls cross a namespace and 0 % go through an interface, but 99 % 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 .lua was not sampled for call sites, so this score covers part of the tree, not all of it.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

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

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

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

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

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

28 finding(s): 0 critical, 21 high, 7 medium, 0 low. 6 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 16 file(s) — `OpenTaiko.Tests/DanCourseFileTests.cs` (line 44, line 57, line 75), `OpenTaiko.Tests/TowerChartFileTests.cs` (line 63, line 140), `OpenTaiko.iOS/scripts/build-appicons.sh` (line 29), `OpenTaiko.iOS/scripts/deploy.sh` (line 48), `OpenTaiko.iOS/scripts/logs.sh` (line 14, line 50), … (+11 more) — 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. In 2 of those file(s) — `REDACTED`, `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.AIHits.cs` — the break is a C# primary constructor, which semgrep's grammar cannot parse and which hides the type from every rule scoped to it; those files were re-scanned from a shadow copy with the constructor's parameter list blanked (line and column preserving), which restores the type to the rules, and 0 additional row(s) came from that pass. Only the header's own parameter list is unread in them. In 3 of those file(s) — `OpenTaiko/src/Lua/3D/GpuRasterizer.Shaders.cs`, `OpenTaiko/src/Songs/CDTXStyleExtractor.cs`, `OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs` — the break is at a TYPE DECLARATION (a C# primary constructor semgrep's grammar cannot parse), so the loss is wider than the named lines: rules scoped to that type see no type to scope to and are blind over its whole body, while rules matching statements keep working there. Absence of a type-scoped finding in those types is not evidence of anything. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

D35 · Change Coupling10.0 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

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

Strongest change-coupling: CBoxDef.cs↔CSongListNode.cs 60%

Change coupling: CBoxDef.cs ↔ CSongListNode.csOpenTaiko/src/Songs/CBoxDef.cs:1

What to do

  1. Resolve the 1 Change coupling finding(s) in Change Coupling — start with CBoxDef.cs. — 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.

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

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

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

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.

AX2 · Stateful singletons1.0 / 10Critical✓ Tool-verified

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.

  • `CConfigIni` is not registered, but `OpenTaiko` creates it and keeps it in the static `ConfigIni`, 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 (_applyLoudnessMetadata, _targetLoudness, _applySongVol, _masterLevel, _soundEffectLevel, _voiceLevel; e.g. `_applyLoudnessMetadata` at line 295). — OpenTaiko/src/Common/CConfigIni.cs:64
  • `TextureLoader` is not registered, but `OpenTaiko` creates it and keeps it in the static `Tx`, 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 (_warmNeeds, gameplayTextures, listTexture, _warmIndex, _playNeeds, nTexturesLoaded; e.g. `_warmNeeds` at line 91). — OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:7
  • `CTraceLogListener` is not registered, but `OpenTaiko` creates it and keeps it in the static `FileLogListener`, 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 (errorPending, LogStreamWriter; e.g. `errorPending` at line 17). — FDK/src/00.Common/CTraceLogListener.cs:5
  • `CSystemError` is not registered, but `OpenTaiko` creates it and keeps it in the static `SystemError`, 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 (GameCrashed, ErrorMessage, _pfText, _ttkText; e.g. `GameCrashed` at line 28). — OpenTaiko/src/Common/CSystemError.cs:6
  • `CVisualLogManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `VisualLogManager`, 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 (cards; e.g. `cards` at line 45). — OpenTaiko/src/Components/CVisualLogManager.cs:6
  • `Favorites` is not registered, but `OpenTaiko` creates it and keeps it in the static `Favorites`, 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 (data; e.g. `data` at line 42). — OpenTaiko/src/Common/Favorites.cs:3
  • `RecentlyPlayedSongs` is not registered, but `OpenTaiko` creates it and keeps it in the static `RecentlyPlayedSongs`, 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 (data; e.g. `data` at line 39). — OpenTaiko/src/Common/RecentlyPlayedSongs.cs:3
  • `Databases` is not registered, but `OpenTaiko` creates it and keeps it in the static `Databases`, 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 (DBCDN, DBNameplateUnlockables, DBSongUnlockables, DBThemeSettings, SkinLocaleManager; e.g. `DBCDN` at line 5). — OpenTaiko/src/Databases/Databases.cs:3
  • `CSkin` is not registered, but `OpenTaiko` creates it and keeps it in the static `Skin`, 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 (listSystemSound, MainMenuSettings, hsHitSoundsInformations, soundCursorMoveSound, soundDecideSFX, soundChangeSFX; e.g. `listSystemSound` at line 457). — OpenTaiko/src/Common/CSkin.cs:40
  • `CTimer` is not registered, but `OpenTaiko` creates it and keeps it in the static `Timer`, 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 (CurrentTimerType; e.g. `CurrentTimerType` at line 64). — FDK/src/00.Common/CTimer.cs:5
  • `CFPS` is not registered, but `OpenTaiko` creates it and keeps it in the static `FPS`, 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 (ChangedFPS, DeltaTime, PrevFrameTime, NowFPS, CoreFPS, BeginTime; e.g. `ChangedFPS` at line 36). — FDK/src/00.Common/CFPS.cs:3
  • `CTextConsole` is not registered, but `OpenTaiko` creates it and keeps it in the static `actTextConsole`, 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 (fontTextures, fontWidth, fontHeight, characterRectangles; e.g. `fontTextures` at line 53). — OpenTaiko/src/Common/CTextConsole.cs:6
  • `CInputManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `InputManager`, 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 (Context, Deadzone, InputDevices, _Keyboard, _Mouse; e.g. `Context` at line 46). — FDK/src/02.Input/CInputManager.cs:9
  • `CPad` is not registered, but `OpenTaiko` creates it and keeps it in the static `Pad`, 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 (detectedDevice, inputToPadCacheValid, inputToPadCache; e.g. `detectedDevice` at line 67). — OpenTaiko/src/Common/CPad.cs:6
  • `SoundGroupLevelController` is not registered, but `OpenTaiko` creates it and keeps it in the static `SoundGroupLevelController`, 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 (_levelBySoundGroup, _keyboardSoundLevelIncrement; e.g. `_levelBySoundGroup` at line 70). — FDK/src/03.Sound/SoundGroupLevelController.cs:34
  • `CActScanningLoudness` is not registered, but `OpenTaiko` creates it and keeps it in the static `actScanningLoudness`, 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 (ctNowScanningLoudness; e.g. `ctNowScanningLoudness` at line 16). — OpenTaiko/src/Stages/02.Title/CActScanningLoudness.cs:5
  • `CSongManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `SongManager`, 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 (_nScoresAppliedFromFile, _nSearchFileCount, nTotalSongFilesToSearch, nSearchScoreCount, nSearchSongNodeCount, listSongsDB; e.g. `_nScoresAppliedFromFile` at line 23). — OpenTaiko/src/Songs/CSongManager.cs:11
  • `CEnumSongs` is not registered, but `OpenTaiko` creates it and keeps it in the static `EnumSongs`, 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 (state, SongManager, thDTXFileEnumerate; e.g. `state` at line 46). — OpenTaiko/src/Stages/02.Title/CEnumSongs.cs:10
  • `CModalManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `ModalManager`, 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 (displayedModals, AllModalsDone; e.g. `displayedModals` at line 55). — OpenTaiko/src/Components/CModalManager.cs:3
  • `CPopupMenuManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `PopupMenuManager`, 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 (_items, _selected, _onDecide, _onCancel, _onUpdateSub, _escEnabled; e.g. `_items` at line 40). — OpenTaiko/src/Components/CPopupMenuManager.cs:15
  • `CStageStartup` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageStartup`, 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 (Background, listProgressString, _session, strCurrentProgress, _savedAutoFlush, es; e.g. `Background` at line 22). — OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs:6
  • `CStageConfig` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageConfig`, 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 (_leaving, _skinOrg, _renderOrg, _soundTypeOrg, _bassBufOrg, _wasapiBufOrg; e.g. `_leaving` at line 31). — OpenTaiko/src/Stages/04.Config/CStageConfig.cs:6
  • `CSongMount` is not registered, but `OpenTaiko` creates it and keeps it in the static `SongMount`, 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 (rPrevSelectedSong, _rCurrentlySelectedSong, nCurrentSongDifficulty, _nCurrentAnchorDifficulty; e.g. `rPrevSelectedSong` at line 18). — OpenTaiko/src/Common/CSongMount.cs:8
  • `CStageOnlineLounge` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageOnlineLounge`, 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 (eFadeOutCompleteWhenReturnValue, currentMenu, menus, dbCDN, dbCDNData, IsDownloading; e.g. `eFadeOutCompleteWhenReturnValue` at line 50). — OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:8
  • `CStageCutScene` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageCutScene`, 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 (cutScenes, returned, mode; e.g. `cutScenes` at line 25). — OpenTaiko/src/Stages/05.CutScene/CStageCutScene.cs:10
  • `CStageSongLoading` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageSongLoading`, 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 (_handedOver, strSongTitle, strSTAGEFILE, nBGMPlaybackStartTime, nBGMTotalPlaybackTimems, sdLoadSound; e.g. `_handedOver` at line 29). — OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:6
  • `CStagePlayDrumsScreen` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageGameScreen`, 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 (ctHandHold, replayCursor, ShownLyric2, pfReplayModeText, pfReplayModeTextSmall, ttkReplayMode; e.g. `ctHandHold` at line 179). — OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:11
  • `CStageResult` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageResults`, 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 (bAddedToRecentlyPlayedSongs, modalDuck, modalDuckFrom, modalDuckTo, IsScoreValid, ClearStatusesSaved; e.g. `bAddedToRecentlyPlayedSongs` at line 251). — OpenTaiko/src/Stages/08.Result/CStageResult.cs:7
  • `CStageChangeSkin` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageChangeSkin`, 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 (SavedPreviousStage, IsPreviousStageSaved, Background, _session, _savedAutoFlush; e.g. `SavedPreviousStage` at line 36). — OpenTaiko/src/Stages/10.ChangeSkin/CStageChangeSkin.cs:10
  • `CStageTransition` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageTransition`, 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 (_outgoing, Target, TargetDrawLoopReturnValue, _session, _loaderDrivesBar, _revealsGameplay; e.g. `_outgoing` at line 157). — OpenTaiko/src/Stages/11.Transition/CStageTransition.cs:85
  • `CStageShutdown` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageExit`, 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 (ctTimeStall; e.g. `ctTimeStall` at line 22). — OpenTaiko/src/Stages/09.Ending/CStageShutdown.cs:6
  • `CNamePlate` is not registered, but `OpenTaiko` creates it and keeps it in the static `NamePlate`, 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 (bIsPrevAI; e.g. `bIsPrevAI` at line 75). — OpenTaiko/src/Stages/CNamePlate.cs:5
  • `HttpEventReporter` is not registered, but `OpenTaiko` creates it and keeps it in the static `HttpEventReporter`, 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 (started, _listener, _noteOrdinalMappingByPlayer; e.g. `started` at line 25). — REDACTED:12
  • `FFVideoWriter` is not registered, but `VideoExporter` creates it and keeps it in the static `_video`, 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 (_pkt, _frame, _sws, _enc, _fmt, _stream; e.g. `_pkt` at line 599). — OpenTaiko/src/Common/VideoExporter.cs:508
  • `CLocalizationData` is not registered, but `CLangManager` creates it and keeps it in the static `_cachedLocs`, 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 (Strings; e.g. `Strings` at line 32). — OpenTaiko/src/Components/CLocalizationData.cs:5
  • `CSongReplay` is not registered, but `CStageSongLoading` creates it and keeps it in the static `OpenTaiko.ReplayInstances`, 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 (allInputs, DanSongCount, IndividualGoodCount, IndividualOkCount, IndividualBadCount, IndividualRollCount; e.g. `allInputs` at line 110). — OpenTaiko/src/Components/CSongReplay.cs:3
  • `CTexture` is not registered, but `Game` creates it and keeps it in the static `ImGuiFontAtlas`, 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 (_gradientMapTextureId, _gradientMapBlend, fZAxisCenterRotate, _opacity, _onUploaded, Pointer; e.g. `_gradientMapTextureId` at line 289). — FDK/src/04.Graphics/CTexture.cs:11
  • `AngleContext` is not registered, but `Game` creates it and keeps it in the static `Context`, 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 (_wlEglWindow; e.g. `_wlEglWindow` at line 218). — FDK/src/01.Framework/Rendering/Angle/AngleContext.cs:10
  • `CSoundDeviceBASS` is not registered, but `SoundManager` creates it and keeps it in the static `SoundDevice`, 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 (SoundDeviceType, SystemTimer, dbElapsedTimeMs, ElapsedTimeMs, UpdateSystemTimeMs, dbUpdateSystemTimeMs; e.g. `SoundDeviceType` at line 217). — FDK/src/03.Sound/Android/CSoundDeviceBASS.Android.cs:5
  • `CSoundDeviceWASAPI` is not registered, but `SoundManager` creates it and keeps it in the static `SoundDevice`, 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 (SoundDeviceType, SystemTimer; e.g. `SoundDeviceType` at line 394). — FDK/src/03.Sound/CSoundDeviceWASAPI.cs:8

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.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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

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

  • The namespaces OpenTaiko ↔ OpenTaiko.AviUtl2 depend on each other. The lightest dependency in the cycle is OpenTaiko.AviUtl2 → OpenTaiko (OpenTaiko.AviUtl2.Aup2MonoMix → OpenTaiko.CSystemSound, 2 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — OpenTaiko/src/Lua/AviUtl2/Aup2Audio.cs:58

What to do

  • Break namespace cycles inside a project by moving the shared type to a namespace both sides can use, or by inverting the back edge behind an interface.
AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

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

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

AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

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.

AX6 · Interface segregation9.4 / 10Exemplary✓ Tool-verified

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.

  • `IInputDevice` declares 20 members under just 15 distinct name(s): `DeviceGeneric`, `Device`, `DeviceMidi`, `CurrentType`, `GUID`, `ID`, `Name`, `InputEvents`, `Polling`, `KeyAvailable`, `KeyAvailable`, `KeyPressed`, `KeyPressed`, `KeyPressing`, `KeyPressing`, `KeyReleased`, `KeyReleased`, `KeyReleasing`, `KeyReleasing`, `GetButtonName`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 20 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 20 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface. — FDK/src/02.Input/IInputDevice.cs:5

What to do

  • Collapse overload sets (optional/default parameters, or an options object) — these interfaces are wide in SIGNATURES, not in responsibilities, so segregating them would relieve no caller.
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

C1 · Data Protection3.5 / 10Weak✓ Tool-verified

Other · Security — Whether sensitive data is encrypted at rest and in transit and keys are vaulted.

Method: Roslyn plus filesystem scan: encryption presence (EF ColumnEncryption, key-vault references, HTTPS enforcement) and key-derivation KDF detection. Deterministic.

What to do

  • Strengthen data-at-rest protection: vault your keys (Azure Key Vault / AWS KMS / IDataProtector key ring) and encrypt the most sensitive columns (EF HasConversion encryption or provider-native column encryption) — partial coverage still leaves gaps.
  • Enforce HTTPS (UseHttpsRedirection / RequireHttpsMetadata) so data in transit is always encrypted.
C4 · Data Retention9.0 / 10Exemplary✓ Tool-verified

Other · Security — Whether data has a defined lifetime — retention periods, TTLs, cleanup jobs (storage limitation).

Method: Roslyn scan: retention/TTL configuration presence in schema; CascadeDelete detected but not scored as retention control. Deterministic, gated by PII presence.

  • A retention mechanism is present, but the data-lifecycle is not yet complete — missing: a documented retention period / data-expiry.

What to do

  • Complete the data-lifecycle story: an expiry limit (a declared maximum age for the stored data — a retention-age setting, or a store-level TTL where your storage offers one), a scheduled purge/cleanup job that enforces it, and a documented retention period covering the personal data.
GD1 · Unfinished & placeholder code10.0 / 10Exemplary✓ Tool-verified

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.

  • A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface. — OpenTaiko/src/Animations/Animator.cs:60

What to do

  • Finish or delete NotImplementedException stubs and replace placeholder literals before shipping.
IC1 · Incompleteness & stubs7.3 / 10Strong✓ Tool-verified

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.

  • 1 guard above `return 0;` also returns `0`, so no input can make it matter. Implement the distinction that was intended, or delete the guard. — FDK/src/00.Common/CActivity.cs:147
  • `Window_Move` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FDK/src/01.Framework/Core/Game.cs:1232
  • `Window_FramebufferResize` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FDK/src/01.Framework/Core/Game.cs:1234
  • `KeyChar` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FDK/src/02.Input/CInputKeyboard.cs:39
  • `Mouse_Click` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FDK/src/02.Input/CInputMouse.cs:51
  • `Mouse_DoubleClick` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FDK/src/02.Input/CInputMouse.cs:55
  • `Generate` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongListSettings.cs:155
  • Code inside a `#if false` block is permanently excluded from the build — disabled code that should be removed or restored. — OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs:229
  • `tFadeIn` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:14
  • The `if` and its `else` contain the same 1 statement, so no input can make the condition matter. Implement the distinction that was intended, or drop the branch and keep the body. — OpenTaiko/src/Stages/CActFIFOStart.cs:31
  • A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers). (×28) — FDK/src/00.Common/CActivity.cs:51, FDK/src/00.Common/CActivity.cs:52, FDK/src/00.Common/CActivity.cs:67, …
  • 20 consecutive lines of code sit inside a `/* … */` block — a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers). — FDK/src/01.Framework/Core/Game.cs:713
  • 4 consecutive lines of code sit inside a `/* … */` block — a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers). — FDK/src/01.Framework/Core/Game.cs:1128

What to do

  • Finish or delete the unfinished stubs (NotImplementedException / empty / constant-returning bodies) — they are dead surface that looks live.
  • Clear the softer debt: remove commented-out code and dead branches, re-enable or delete skipped tests, and replace blanket warning suppressions with targeted ones.
M1 · Documentation (README)7.2 / 10Strong✓ Tool-verified

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

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

What to do

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

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

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

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

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

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

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

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

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.

P1 · CI/CD gates8.5 / 10Strong✓ 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.

What to do

  • Run the test suite in CI via an explicit runner step for your stack, and gate merges on it.
P2 · Observability7.8 / 10Strong✓ Tool-verified

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

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

  • `OpenTaiko/src/Common/OpenTaiko.cs` reports through `Console.Write…` at line 733 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — OpenTaiko/src/Common/OpenTaiko.cs:733
  • `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 490 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — FDK/src/01.Framework/Core/Game.cs:490
  • `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 491 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — FDK/src/01.Framework/Core/Game.cs:491
  • `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 677 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — FDK/src/01.Framework/Core/Game.cs:677
  • `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 931 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — FDK/src/01.Framework/Core/Game.cs:931
  • `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 1146 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — FDK/src/01.Framework/Core/Game.cs:1146
  • `OpenTaiko.iOS/GameViewController.cs` reports through `Console.Write…` at line 96 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — OpenTaiko.iOS/GameViewController.cs:96
  • `OpenTaiko.iOS/GameViewController.cs` reports through `Console.Write…` at line 110 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters. — OpenTaiko.iOS/GameViewController.cs:110

What to do

  • Replace `Console.Write…` in service code with the project's injected `ILogger<T>` (message templates with named properties), so delivery outcomes and failures reach the log pipeline with a level and a category.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • 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) as a CI step. What was searched, so you can tell an absence from a miss: the 1 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.
  • `FDK/FDK.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`. — FDK/FDK.csproj:9

What to do

  • Add a SAST step to CI running 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 — 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.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

  • The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.

What to do

  • Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

P7 · Outbound HTTP resilience3.0 / 10Weak✓ Tool-verified

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

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

  • `new HttpClient()` builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller — a build step, a CLI run, a UI thread — with no way out. — OpenTaiko/src/Stages/12.OnlineLounge/API.cs:106
  • `new System.Net.Http.HttpClient()` builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller — a build step, a CLI run, a UI thread — with no way out. — OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:540

What to do

  • Give every outbound call a bound the caller can rely on: set an explicit `HttpClient.Timeout` (or pass a `CancellationToken` from a `CancellationTokenSource` with a deadline) and flow the caller's own `CancellationToken` through, so a slow endpoint fails fast instead of hanging.
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. (×2) — REDACTED:112, REDACTED:232

What to do

  • Move each table the code creates at runtime into the versioned migrations the repository already applies.
PF3 · Async & latency hygiene6.0 / 10Adequate✓ Tool-verified

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

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

  • 13 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).
  • `_ready.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). — OpenTaiko/src/Common/VideoExporter.cs:556
  • `.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). (×8) — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1420, OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1453, OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1478, …
  • `_fetched.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). — OpenTaiko/src/Stages/12.OnlineLounge/API.cs:92
  • `decodeStopped.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). — FDK/src/04.Graphics/CVideoDecoder.cs:447
  • `done.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). (×2) — OpenTaiko.iOS/iOSSoundtrackDownloadHost.cs:34, OpenTaiko.Android/AndroidSoundtrackDownloadHost.cs:34

What to do

  • Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult().
S1 · Cryptographic Hygiene4.0 / 10Weak✓ Tool-verified

Other · Security — Cryptographic hygiene (weak hash/cipher, password key-derivation). This codebase has no web surface, so transport/header/cookie/CSRF controls are N/A and only crypto is scored.

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/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. (×5) — OpenTaiko/src/Components/CSongReplay.cs:88, OpenTaiko/src/Songs/CSongManager.cs:122, OpenTaiko/src/Songs/CSongManager.cs:399, …
  • `APP_KEY` is the AEAD cipher key 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. — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:98

What to do

  • 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 5 sites, not one: `OpenTaiko/src/Components/CSongReplay.cs:88` (MD5), `OpenTaiko/src/Songs/CSongManager.cs:122` (SHA1), `OpenTaiko/src/Songs/CSongManager.cs:399` (SHA1), `OpenTaiko/src/Songs/CSongManager.cs:1006` (SHA1), `OpenTaiko/src/Songs/SoundtrackDownloader.cs:221` (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.
X1 · Async correctness1.4 / 10Critical✓ Tool-verified

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.

  • Reading `.Result` of a task that has not completed blocks this thread until it does — the same block as `.Wait()`: under a synchronization context (Blazor, a UI thread, classic ASP.NET) it deadlocks, and on the thread pool it parks a thread for as long as the work runs. `await` the task instead (make the caller `async`); where a synchronous entry point must stay, keep the block in ONE documented bridge with a timeout. (×2) — OpenTaiko/src/Lua/3D/GltfModel.cs:805, FDK/src/02.Input/CInputManager.cs:79
  • 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. (×9) — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1420, OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1453, OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1478, …

What to do

  • Sync-over-async (deadlock risk) through `.Result`
X12 · Unreachable branch8.0 / 10Strong✓ Tool-verified

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.

  • `value < 0` can never be true where it stands: the guard on line 1272 (`OpenTaiko.Tx.DanC_MiniNumber == null || value < 0`) left this block when it was true. No value of `value` satisfies all of that, so this arm never runs. Reorder the tests, drop the dead branch, or fix the bound that was meant. — OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1276

What to do

  • Each finding names the span that makes the branch dead and the span it is dead because of. Confirm from the two, then delete the dead arm or fix the predicate that was meant to be reachable.
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.

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

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

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

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

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.

X18 · Disposal-pattern correctness5.2 / 10Adequate✓ Tool-verified

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.

  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 43). Every use of it in `FetchUnlockedDanTitles` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:43
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 63). Every use of it in `RegisterDanTitle` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:63
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 89). Every use of it in `FetchUnlockedNameplateIds` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:89
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 104). Every use of it in `RegisterUnlockedNameplate` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:104
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 120). Every use of it in `FetchStringUnlockedAsset` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:120
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 135). Every use of it in `RegisterStringUnlockedAsset` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:135
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 149). Every use of it in `FetchSaveInstances` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:149
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 191). Every use of it in `AlterCoinsAndTotalPlayCount` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:191
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 202). Every use of it in `RegisterAIBattleModePlay` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:202
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 211). Every use of it in `SetSelectedHitsounds` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:211
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 224). Every use of it in `ApplyChangesFromMyRoom` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:224
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 252). Every use of it in `GetGlobalCountersDict` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:252
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 314). Every use of it in `GetActiveTriggersSet` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:314
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 400). Every use of it in `GetBestPlaysAsDict` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:400
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 500). Every use of it in `RegisterPlay` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:500
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 579). Every use of it in `RegisterPlay` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:579
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 27). Every use of it in `DBSongUnlockables` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBSongUnlockables.cs:27
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 90). Every use of it in `GetSetting` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:90
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 107). Every use of it in `GetSettingForSave` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:107
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 119). Every use of it in `SetSetting` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:119
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 133). Every use of it in `SetSettingForSave` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:133
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 145). Every use of it in `GetRaw` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:145
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 153). Every use of it in `SetRaw` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:153
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 185). Every use of it in `EnsureSchema` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:185
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 208). Every use of it in `SeedGlobalDefaults` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Databases/DBThemeSettings.cs:208
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 81). Every use of it in `GetDBVersion` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:81
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 97). Every use of it in `SetDBVersion` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:97
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 111). Every use of it in `AddActiveCountersTable` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:111
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 254). Every use of it in `FixSaveDB_IdxUniquePlay` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:254
  • `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 20). Every use of it in `Query` 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 command = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Lua/Classes/DataPersistence/LuaSQL.cs:20
  • `CLuaScript` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `lfBindload` itself (line 91), which makes that instance its own. But `lfBindload` is named in none of the methods the disposal search covered: `Dispose` (line 532) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`lfBindload?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree. — OpenTaiko/src/Lua/CLuaScript.cs:91
  • `CLuaScript` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `lfLoadAssets` itself (line 92), which makes that instance its own. But `lfLoadAssets` is named in none of the methods the disposal search covered: `Dispose` (line 532) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`lfLoadAssets?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree. — OpenTaiko/src/Lua/CLuaScript.cs:92
  • `CLuaScript` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `lfReloadLanguage` itself (line 93), which makes that instance its own. But `lfReloadLanguage` is named in none of the methods the disposal search covered: `Dispose` (line 532) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`lfReloadLanguage?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree. — OpenTaiko/src/Lua/CLuaScript.cs:93
  • `done` is a `ManualResetEventSlim`, which implements `IDisposable`, and it is created here (line 887). Every use of it in `P2PJoin` 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 done = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:887
  • `reader` is a `StreamReader`, which implements `IDisposable`, and it is created here (line 60). Every use of it in `tLoad` 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 reader = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Songs/CBoxDef.cs:60
  • `reader` is a `StreamReader`, which implements `IDisposable`, and it is created here (line 35). Every use of it in `tInput` 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 reader = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Songs/CCourse.cs:35
  • `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 205). Every use of it in `ImportScoreInisToSavesDb3` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw. — REDACTED:205
  • `CWAV` declares a finalizer (line 203), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization. — OpenTaiko/src/Songs/CTja.cs:203
  • `sw` is a `StreamWriter`, which implements `IDisposable`, and it is created here (line 577). Every use of it in `DownloadSong` 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 sw = …;`), which releases it at the end of the scope on every path including a throw. — OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:577
  • `CSoundDeviceASIO` declares a finalizer (line 408), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization. — FDK/src/03.Sound/CSoundDeviceASIO.cs:408

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.
X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation4.0 / 10Weak✓ Tool-verified

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 0/1 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. — OpenTaiko/src/Stages/12.OnlineLounge/API.cs:104

What to do

  • Thread a CancellationToken through async methods so work stops promptly on cancellation.
X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

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

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

X24 · Document value interpolated into markup unescaped5.2 / 10Adequate✓ 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.

  • `_upnpServiceType` carries text this program read out of the document being converted, and it is written straight into the `xmlns:u` attribute of generated markup with nothing escaping it on the way. The value is chosen by whoever authored the file, not by this program, so it can close the attribute it sits in and open another — a crafted document becomes markup in the output this renderer produces. Escape `_upnpServiceType` at this site, or validate it against the shape the attribute accepts before interpolating it. — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1474

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.
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.

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.

X29 · Per-element action decided by a fixed element7.9 / 10Strong✓ Tool-verified

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.

  • This loop runs once per element of `metadatas`, and the statement it guards acts on the element it is on — `this.nowGameType = metadata.GameType;`. The test deciding whether that statement runs does not: `metadatas.FirstOrDefault() == this.PlayerSideMetadata` reads `metadatas.FirstOrDefault()`, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One `if` names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The `if` is in the wrong place under both readings. Give the test the loop variable, or hoist it out. — OpenTaiko/src/Songs/CTja.cs:3579

What to do

  • Each finding names the test and the statement it guards, which index the same collection at two different subscripts — one fixed, one the loop variable. Confirm from the two, then decide which subscript the test meant. If it was meant to be per-element, give it the loop variable so each element is judged on itself. If it really is one answer for the whole collection, hoist the test OUT of the loop, where a reader can see it is asked once and where it is not re-evaluated on every pass — leaving it inside, reading a fixed element, is the one arrangement that cannot be right under either reading.
X3 · Exception handling4.3 / 10Weak✓ Tool-verified

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. (×32) — OpenTaiko/src/Common/CLoadingScreen.cs:35, OpenTaiko/src/Common/CLoadingScreen.cs:66, OpenTaiko/src/Common/VideoExporter.cs:66, …
  • `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. (×5) — OpenTaiko/src/Common/VideoExporter.cs:325, OpenTaiko/src/Lua/AviUtl2/Aup2FiltersExtra.cs:255, OpenTaiko/src/Lua/Classes/LuaCharacter.cs:215, …
  • `catch (Exception)` 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. (×2) — OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:67, OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:438
  • 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). — OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:203

What to do

  • Swallowed exception (empty catch)
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.

X4 · Structured logging2.7 / 10Weak✓ Tool-verified

Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.

Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. 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 `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.

  • Logging an interpolated string (`$"..."`) collapses the event to plain text — you lose the named, queryable properties structured logging exists for. Use a message template with placeholders: `LogInformation("User {UserId} did {Action}", id, action)`. If these calls go through a logging wrapper that only accepts a pre-formatted string, give the wrapper a template+args overload that forwards to the underlying logger, then migrate call sites to it. (×2) — OpenTaiko/src/Songs/SoundtrackDownloader.cs:82, OpenTaiko/src/Songs/SoundtrackDownloader.cs:206

What to do

  • Interpolated log message defeats structured logging
X5 · Nullable reference types8.4 / 10Strong✓ Tool-verified

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 `t`: line 557 writes `t?.Drop`, which says `t` can be null, but line 561 then dereferences it directly as `t.Dispose` 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 `t` truly cannot be null here, the `?.` is misleading. Settle it one way — test `t` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side. — OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:561
  • This method contradicts itself about `songChart`: line 50 writes `songChart?.Parent`, which says `songChart` can be null, but line 48 then dereferences it directly as `songChart.Difficulty` 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 `songChart` truly cannot be null here, the `?.` is misleading. Settle it one way — test `songChart` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side. — OpenTaiko/src/Lua/Classes/SongsManagement/LuaBestScoreInfo.cs:48
  • This method contradicts itself about `cli`: line 1069 writes `cli?.Close`, which says `cli` can be null, but line 1022 then dereferences it directly as `cli.GetStream` 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 `cli` truly cannot be null here, the `?.` is misleading. Settle it one way — test `cli` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side. — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1022
  • ~2.1 `!` suppressions per 1k syntax nodes — 1678 suppression(s) across the 817765 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 `!`.

Reference — by lens

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

LensScoreRatingImpact
Code Health37.1Weak — gated by D1, D2, X1, X4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture71.1Adequate — gated by AX2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity65.3Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness39.6Weak — gated by P3, P7, P8Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security44.5Weak — gated by D29, D36, C1Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance60.0AdequateStrongest area.
Unscored — 4 check(s) recorded observations but carry no score

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

  • P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • SC1 Supply-chain hygiene — 5 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X10 Duplicated predicate — 28 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 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.

  • C3 Audit Trail — Repo shows no audit-logging mechanism (IAuditable, an immutable audit log, an EF SaveChanges interceptor) for sensitive changes — absence of evidence is not evidence of a working control. Record an audit trail in code (or document where it lives) so this dimension can be scored.
  • C5 Data-Subject Rights — Repo shows no corroborated data-subject-rights mechanism (erasure / export-portability / consent) tied to a subject id or GDPR vocabulary — absence of evidence is not evidence of a working control. Implement erasure, data export/portability and consent tracking over the subject's records.
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 44 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 web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — no DI registrations detected
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • D12 Dependency Hygiene — Dependency hygiene 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.
  • D25 ADR Conformance — no ADRs to check
  • D28 Secrets (history) — gitleaks killed before it finished — this repository's working tree not scanned
  • D30 Dependency Vulnerabilities — nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan
  • 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) — 9 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D34 Knowledge Freshness — knowledge concentrated in recent work — freshness signal contradicted by repo activity
  • 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 only 1 of the 3 signals this lens looks for (2 value object(s))
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • 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.
  • 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
  • X17 Uncapped recursion over a caller-supplied document — 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
  • X22 Contradicted release 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
  • X25 Inert configuration knob — 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
  • 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.

Critical — 178 finding(s)
D17 · Explicit Debt · EmptyCatchBlock · ×125
  • EmptyCatchBlock FDK/src/00.Common/CTraceLogListener.cs:21 — 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 FDK/src/00.Common/CTraceLogListener.cs:31 — 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 FDK/src/00.Common/CTraceLogListener.cs:41 — 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 FDK/src/00.Common/CTraceLogListener.cs:49 — 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 FDK/src/00.Common/CTraceLogListener.cs:57 — 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 FDK/src/00.Common/CTraceLogListener.cs:66 — 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 FDK/src/00.Common/CTraceLogListener.cs:102 — 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 FDK/src/00.Common/CTraceLogListener.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 FDK/src/01.Framework/Core/Game.GraphicsSelfTest.cs:18 — 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 FDK/src/01.Framework/Rendering/Angle/AngleContext.cs:218 — 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 FDK/src/02.Input/CInputManager.cs:40 — 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 FDK/src/02.Input/CInputMouse.cs:46 — 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 FDK/src/03.Sound/SoundManager.cs:60 — 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 FDK/src/04.Graphics/CTexture.Streaming.cs:71 — 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 FDK/src/04.Graphics/CTexture.Streaming.cs:187 — 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 FDK/src/04.Graphics/CTexture.Streaming.cs:226 — 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 FDK/src/04.Graphics/CTexture.cs:759 — 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 FDK/src/04.Graphics/CTexture.cs:809 — 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 FDK/src/04.Graphics/CTexture.cs:855 — 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 FDK/src/04.Graphics/CTexture.cs:911 — 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 FDK/src/04.Graphics/CTexture.cs:939 — 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 REDACTED:61 — 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 REDACTED:85 — 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 REDACTED:88 — 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 REDACTED:130 — 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.
  • + 100 more in this group — see findings.md.
D17 · Explicit Debt · WriteOnlyPrivateField · ×30
  • WriteOnlyPrivateField FDK/src/02.Input/CInputGamepad.cs:87 — private int ThumbstickCount — assigned 1 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 FDK/src/03.Sound/SoundManager.cs:63 — private IWindow Window_ — 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 FDK/src/03.Sound/SoundManager.cs:576 — private DateTime lastUpdateTime — assigned 1 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 OpenTaiko.Android/CrashLog.cs:11 — private FileStream? _nativeOut — assigned 1 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 OpenTaiko.Tests/AviUtl2ScriptTests.cs:19 — private ITestOutputHelper _output — assigned 1 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 OpenTaiko.iOS/MetalPresenter.cs:44 — private int _drawableWidth — assigned 1 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 OpenTaiko.iOS/MetalPresenter.cs:45 — private int _drawableHeight — assigned 1 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 OpenTaiko/src/Common/ImGuiDebugWindow.cs:21 — private Assembly assemblyinfo — assigned 1 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 OpenTaiko/src/Components/CSongReplay.cs:622 — private string? chartPath — assigned 1 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 OpenTaiko/src/Components/CVisualLogManager.cs:40 — private TraceEventType lct — assigned 1 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 OpenTaiko/src/Lua/CLuaScript.cs:95 — private CLuaInfo? luaInfo — assigned 1 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 OpenTaiko/src/Lua/Classes/SharedResources/LuaSharedResource.cs:134 — private string DirPath — assigned 1 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 OpenTaiko/src/Songs/CTja.cs:422 — private int[] nRollChip_temp — assigned 1 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 OpenTaiko/src/Stages/04.Config/CActCalibrationMode.cs:202 — private Rectangle[] BGs — assigned 1 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 OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:100 — private float[,] nPointsAnimeScale_Coord — assigned 1 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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:527 — private int currentCharacter — assigned 1 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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:198 — private CCounter? ctBalloonEnd — assigned 3 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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplRollEffect.cs:155 — private STRollChar[] stRollChar — assigned 1 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 OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1390 — private int notesremain — assigned 1 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 OpenTaiko/src/Stages/08.Result/CStageResult.cs:1043 — private CActOptionPanel actOption — assigned 1 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 OpenTaiko/src/Stages/CActOptionPanel.cs:85 — private Rectangle[] rcComboPos — assigned 1 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 OpenTaiko/src/Stages/CActOptionPanel.cs:86 — private Rectangle[] rcDark — assigned 1 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 OpenTaiko/src/Stages/CActOptionPanel.cs:87 — private Rectangle[] rcHS — assigned 1 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 OpenTaiko/src/Stages/CActOptionPanel.cs:95 — private Rectangle[] rcLeft — assigned 1 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 OpenTaiko/src/Stages/CActOptionPanel.cs:96 — private Rectangle[] rcLight — assigned 1 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.
  • + 5 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
AX3 · Project dependency cycles · Namespace dependency cycle · ×1
  • Namespace dependency cycle OpenTaiko/src/Lua/AviUtl2/Aup2Audio.cs:58 — The namespaces OpenTaiko ↔ OpenTaiko.AviUtl2 depend on each other. The lightest dependency in the cycle is OpenTaiko.AviUtl2 → OpenTaiko (OpenTaiko.AviUtl2.Aup2MonoMix → OpenTaiko.CSystemSound, 2 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
S1 · Cryptographic Hygiene · Cryptographic key material is a compile-time constant · ×1
  • Cryptographic key material is a compile-time constant OpenTaiko/src/Lua/Networking/LuaNetworking.cs:98 — `APP_KEY` is the AEAD cipher key 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 — 1382 finding(s)
D17 · Explicit Debt · CommentedOutCode · ×99
  • CommentedOutCode FDK/src/01.Framework/Core/Game.cs:408 — 3 consecutive commented-code lines
  • CommentedOutCode FDK/src/02.Input/CInputManager.cs:184 — 3 consecutive commented-code lines
  • CommentedOutCode FDK/src/03.Sound/CSound.cs:758 — 3 consecutive commented-code lines
  • CommentedOutCode FDK/src/03.Sound/CSound.cs:762 — 3 consecutive commented-code lines
  • CommentedOutCode FDK/src/03.Sound/CSoundDeviceWASAPI.cs:64 — 3 consecutive commented-code lines
  • CommentedOutCode FDK/src/03.Sound/CSoundDeviceWASAPI.cs:92 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Common/CConfigIni.cs:1504 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Common/ImGuiDebugWindow.cs:338 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Songs/CTja.cs:4497 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/02.Title/CEnumSongs.cs:324 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/02.Title/CEnumSongs.cs:349 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:331 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:211 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:321 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:471 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:639 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:835 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:785 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/CActOptionPanel.cs:42 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/CActOptionPanel.cs:47 — 3 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Stages/CActOptionPanel.cs:52 — 3 consecutive commented-code lines
  • CommentedOutCode FDK/src/01.Framework/Core/Game.cs:713 — 20 consecutive commented-code lines
  • CommentedOutCode OpenTaiko/src/Helpers/HEasingMethods.cs:232 — 20 consecutive commented-code lines
  • CommentedOutCode FDK/src/01.Framework/Core/Game.cs:1128 — 4 consecutive commented-code lines
  • CommentedOutCode FDK/src/03.Sound/CSound.cs:583 — 4 consecutive commented-code lines
  • + 74 more in this group — see findings.md.
D3 · God Classes · MethodTooLong · ×48
  • MethodTooLong: CSkin.tLoadFromString OpenTaiko/src/Common/CSkin.cs:1121 — MethodTooLong — tLoadFromString runs 3423 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3323 over it, 34.23× 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: CConfigIni.tExport OpenTaiko/src/Common/CConfigIni.cs:1104 — MethodTooLong — tExport runs 672 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 572 over it, 6.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: CStagePlayScreenCommon.tProgressDraw_Chip OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2837 — MethodTooLong — tProgressDraw_Chip runs 654 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 554 over it, 6.54× 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: CTja.ParseCommand OpenTaiko/src/Songs/CTja.cs:1835 — MethodTooLong — ParseCommand runs 572 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 472 over it, 5.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: LuaDanBuildFunc.BuildDanCtja OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs:143 — MethodTooLong — BuildDanCtja runs 309 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 209 over it, 3.09× 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: TextureLoader.LoadTexture OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:257 — MethodTooLong — LoadTexture runs 297 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 197 over it, 2.97× 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: CStageSongLoading.Draw OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:175 — MethodTooLong — Draw runs 289 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 189 over it, 2.89× 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: CStageResult.Activate OpenTaiko/src/Stages/08.Result/CStageResult.cs:247 — MethodTooLong — Activate runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 183 over it, 2.83× 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: OpenTaiko.Draw OpenTaiko/src/Common/OpenTaiko.cs:689 — MethodTooLong — Draw runs 277 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 177 over it, 2.77× 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: CConfigIni.ProcessSystemSection OpenTaiko/src/Common/CConfigIni.cs:2068 — MethodTooLong — ProcessSystemSection runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 173 over it, 2.73× 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: CConfigIni.ProcessPlayOptionSection OpenTaiko/src/Common/CConfigIni.cs:2455 — MethodTooLong — ProcessPlayOptionSection runs 255 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 155 over it, 2.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: OpenTaiko.tStartupProcess OpenTaiko/src/Common/OpenTaiko.cs:1422 — MethodTooLong — tStartupProcess runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.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: GltfModel.LoadUncached OpenTaiko/src/Lua/3D/GltfModel.cs:869 — MethodTooLong — LoadUncached runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.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: CTja.tProcessAllText OpenTaiko/src/Songs/CTja.cs:1113 — MethodTooLong — tProcessAllText runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31× 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: Dan_Cert.DrawExam OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:796 — MethodTooLong — DrawExam runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29× 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: Aup2Evaluator.Evaluate OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:573 — MethodTooLong — Evaluate runs 227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 127 over it, 2.27× 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: CStagePlayDrumsScreen.Draw OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:372 — MethodTooLong — Draw runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23× 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: VTTParser.ParseVTTFile OpenTaiko/src/Songs/VTTParser.cs:49 — MethodTooLong — ParseVTTFile runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 119 over it, 2.19× 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: Dan_Cert.UpdateReachStatus OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:320 — MethodTooLong — UpdateReachStatus runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.17× 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: CTja.ParseGlobalHeader OpenTaiko/src/Songs/CTja.cs:3778 — MethodTooLong — ParseGlobalHeader runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14× 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: CActImplMtaiko.Draw OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:49 — MethodTooLong — Draw runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.10× 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: CScoreIni_Importer.ImportScoreInisToSavesDb3 REDACTED:10 — MethodTooLong — ImportScoreInisToSavesDb3 runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98× 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: CSongManager.tSongSearchListCreate OpenTaiko/src/Songs/CSongManager.cs:297 — MethodTooLong — tSongSearchListCreate runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× 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: CStageOnlineLounge.Draw OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:145 — MethodTooLong — Draw runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× 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: CActImplGauge.Draw OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs:76 — MethodTooLong — Draw runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× 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.
  • + 23 more in this group — see findings.md.
AX2 · Stateful singletons · Stateful shared instance · ×40
  • Stateful shared instance: CConfigIni OpenTaiko/src/Common/CConfigIni.cs:64 — `CConfigIni` is not registered, but `OpenTaiko` creates it and keeps it in the static `ConfigIni`, 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 (_applyLoudnessMetadata, _targetLoudness, _applySongVol, _masterLevel, _soundEffectLevel, _voiceLevel; e.g. `_applyLoudnessMetadata` at line 295).
  • Stateful shared instance: TextureLoader OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:7 — `TextureLoader` is not registered, but `OpenTaiko` creates it and keeps it in the static `Tx`, 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 (_warmNeeds, gameplayTextures, listTexture, _warmIndex, _playNeeds, nTexturesLoaded; e.g. `_warmNeeds` at line 91).
  • Stateful shared instance: CTraceLogListener FDK/src/00.Common/CTraceLogListener.cs:5 — `CTraceLogListener` is not registered, but `OpenTaiko` creates it and keeps it in the static `FileLogListener`, 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 (errorPending, LogStreamWriter; e.g. `errorPending` at line 17).
  • Stateful shared instance: CSystemError OpenTaiko/src/Common/CSystemError.cs:6 — `CSystemError` is not registered, but `OpenTaiko` creates it and keeps it in the static `SystemError`, 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 (GameCrashed, ErrorMessage, _pfText, _ttkText; e.g. `GameCrashed` at line 28).
  • Stateful shared instance: CVisualLogManager OpenTaiko/src/Components/CVisualLogManager.cs:6 — `CVisualLogManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `VisualLogManager`, 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 (cards; e.g. `cards` at line 45).
  • Stateful shared instance: Favorites OpenTaiko/src/Common/Favorites.cs:3 — `Favorites` is not registered, but `OpenTaiko` creates it and keeps it in the static `Favorites`, 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 (data; e.g. `data` at line 42).
  • Stateful shared instance: RecentlyPlayedSongs OpenTaiko/src/Common/RecentlyPlayedSongs.cs:3 — `RecentlyPlayedSongs` is not registered, but `OpenTaiko` creates it and keeps it in the static `RecentlyPlayedSongs`, 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 (data; e.g. `data` at line 39).
  • Stateful shared instance: Databases OpenTaiko/src/Databases/Databases.cs:3 — `Databases` is not registered, but `OpenTaiko` creates it and keeps it in the static `Databases`, 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 (DBCDN, DBNameplateUnlockables, DBSongUnlockables, DBThemeSettings, SkinLocaleManager; e.g. `DBCDN` at line 5).
  • Stateful shared instance: CSkin OpenTaiko/src/Common/CSkin.cs:40 — `CSkin` is not registered, but `OpenTaiko` creates it and keeps it in the static `Skin`, 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 (listSystemSound, MainMenuSettings, hsHitSoundsInformations, soundCursorMoveSound, soundDecideSFX, soundChangeSFX; e.g. `listSystemSound` at line 457).
  • Stateful shared instance: CTimer FDK/src/00.Common/CTimer.cs:5 — `CTimer` is not registered, but `OpenTaiko` creates it and keeps it in the static `Timer`, 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 (CurrentTimerType; e.g. `CurrentTimerType` at line 64).
  • Stateful shared instance: CFPS FDK/src/00.Common/CFPS.cs:3 — `CFPS` is not registered, but `OpenTaiko` creates it and keeps it in the static `FPS`, 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 (ChangedFPS, DeltaTime, PrevFrameTime, NowFPS, CoreFPS, BeginTime; e.g. `ChangedFPS` at line 36).
  • Stateful shared instance: CTextConsole OpenTaiko/src/Common/CTextConsole.cs:6 — `CTextConsole` is not registered, but `OpenTaiko` creates it and keeps it in the static `actTextConsole`, 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 (fontTextures, fontWidth, fontHeight, characterRectangles; e.g. `fontTextures` at line 53).
  • Stateful shared instance: CInputManager FDK/src/02.Input/CInputManager.cs:9 — `CInputManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `InputManager`, 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 (Context, Deadzone, InputDevices, _Keyboard, _Mouse; e.g. `Context` at line 46).
  • Stateful shared instance: CPad OpenTaiko/src/Common/CPad.cs:6 — `CPad` is not registered, but `OpenTaiko` creates it and keeps it in the static `Pad`, 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 (detectedDevice, inputToPadCacheValid, inputToPadCache; e.g. `detectedDevice` at line 67).
  • Stateful shared instance: SoundGroupLevelController FDK/src/03.Sound/SoundGroupLevelController.cs:34 — `SoundGroupLevelController` is not registered, but `OpenTaiko` creates it and keeps it in the static `SoundGroupLevelController`, 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 (_levelBySoundGroup, _keyboardSoundLevelIncrement; e.g. `_levelBySoundGroup` at line 70).
  • Stateful shared instance: CActScanningLoudness OpenTaiko/src/Stages/02.Title/CActScanningLoudness.cs:5 — `CActScanningLoudness` is not registered, but `OpenTaiko` creates it and keeps it in the static `actScanningLoudness`, 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 (ctNowScanningLoudness; e.g. `ctNowScanningLoudness` at line 16).
  • Stateful shared instance: CSongManager OpenTaiko/src/Songs/CSongManager.cs:11 — `CSongManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `SongManager`, 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 (_nScoresAppliedFromFile, _nSearchFileCount, nTotalSongFilesToSearch, nSearchScoreCount, nSearchSongNodeCount, listSongsDB; e.g. `_nScoresAppliedFromFile` at line 23).
  • Stateful shared instance: CEnumSongs OpenTaiko/src/Stages/02.Title/CEnumSongs.cs:10 — `CEnumSongs` is not registered, but `OpenTaiko` creates it and keeps it in the static `EnumSongs`, 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 (state, SongManager, thDTXFileEnumerate; e.g. `state` at line 46).
  • Stateful shared instance: CModalManager OpenTaiko/src/Components/CModalManager.cs:3 — `CModalManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `ModalManager`, 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 (displayedModals, AllModalsDone; e.g. `displayedModals` at line 55).
  • Stateful shared instance: CPopupMenuManager OpenTaiko/src/Components/CPopupMenuManager.cs:15 — `CPopupMenuManager` is not registered, but `OpenTaiko` creates it and keeps it in the static `PopupMenuManager`, 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 (_items, _selected, _onDecide, _onCancel, _onUpdateSub, _escEnabled; e.g. `_items` at line 40).
  • Stateful shared instance: CStageStartup OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs:6 — `CStageStartup` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageStartup`, 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 (Background, listProgressString, _session, strCurrentProgress, _savedAutoFlush, es; e.g. `Background` at line 22).
  • Stateful shared instance: CStageConfig OpenTaiko/src/Stages/04.Config/CStageConfig.cs:6 — `CStageConfig` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageConfig`, 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 (_leaving, _skinOrg, _renderOrg, _soundTypeOrg, _bassBufOrg, _wasapiBufOrg; e.g. `_leaving` at line 31).
  • Stateful shared instance: CSongMount OpenTaiko/src/Common/CSongMount.cs:8 — `CSongMount` is not registered, but `OpenTaiko` creates it and keeps it in the static `SongMount`, 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 (rPrevSelectedSong, _rCurrentlySelectedSong, nCurrentSongDifficulty, _nCurrentAnchorDifficulty; e.g. `rPrevSelectedSong` at line 18).
  • Stateful shared instance: CStageOnlineLounge OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:8 — `CStageOnlineLounge` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageOnlineLounge`, 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 (eFadeOutCompleteWhenReturnValue, currentMenu, menus, dbCDN, dbCDNData, IsDownloading; e.g. `eFadeOutCompleteWhenReturnValue` at line 50).
  • Stateful shared instance: CStageCutScene OpenTaiko/src/Stages/05.CutScene/CStageCutScene.cs:10 — `CStageCutScene` is not registered, but `OpenTaiko` creates it and keeps it in the static `stageCutScene`, 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 (cutScenes, returned, mode; e.g. `cutScenes` at line 25).
  • + 15 more in this group — see findings.md.
X18 · Disposal-pattern correctness · Disposable created and abandoned in the method that made it · ×35
  • Disposable created and abandoned in the method that made it REDACTED:43 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 43). Every use of it in `FetchUnlockedDanTitles` 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 command = …;`), 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:63 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 63). Every use of it in `RegisterDanTitle` 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 command = …;`), 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:89 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 89). Every use of it in `FetchUnlockedNameplateIds` 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 command = …;`), 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:104 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 104). Every use of it in `RegisterUnlockedNameplate` 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 command = …;`), 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:120 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 120). Every use of it in `FetchStringUnlockedAsset` 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 command = …;`), 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:135 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 135). Every use of it in `RegisterStringUnlockedAsset` 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 command = …;`), 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:149 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 149). Every use of it in `FetchSaveInstances` 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 command = …;`), 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:191 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 191). Every use of it in `AlterCoinsAndTotalPlayCount` 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 command = …;`), 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:202 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 202). Every use of it in `RegisterAIBattleModePlay` 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 command = …;`), 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:211 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 211). Every use of it in `SetSelectedHitsounds` 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 command = …;`), 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:224 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 224). Every use of it in `ApplyChangesFromMyRoom` 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 command = …;`), 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:252 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 252). Every use of it in `GetGlobalCountersDict` 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 command = …;`), 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:314 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 314). Every use of it in `GetActiveTriggersSet` 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 command = …;`), 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:400 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 400). Every use of it in `GetBestPlaysAsDict` 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 command = …;`), 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:500 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 500). Every use of it in `RegisterPlay` 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 cmd = …;`), 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:579 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 579). Every use of it in `RegisterPlay` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBSongUnlockables.cs:27 — `command` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 27). Every use of it in `DBSongUnlockables` 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 command = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:90 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 90). Every use of it in `GetSetting` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:107 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 107). Every use of it in `GetSettingForSave` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:119 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 119). Every use of it in `SetSetting` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:133 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 133). Every use of it in `SetSettingForSave` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:145 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 145). Every use of it in `GetRaw` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:153 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 153). Every use of it in `SetRaw` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:185 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 185). Every use of it in `EnsureSchema` 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 cmd = …;`), 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 OpenTaiko/src/Databases/DBThemeSettings.cs:208 — `cmd` is a `SqliteCommand`, which implements `IDisposable`, and it is created here (line 208). Every use of it in `SeedGlobalDefaults` 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 cmd = …;`), which releases it at the end of the scope on every path including a throw.
  • + 10 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (empty catch) · ×33
  • Swallowed exception (empty catch) OpenTaiko/src/Common/CLoadingScreen.cs:35 — 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) OpenTaiko/src/Common/CLoadingScreen.cs:66 — 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) OpenTaiko/src/Common/VideoExporter.cs:66 — 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) OpenTaiko/src/Common/VideoExporter.cs:130 — 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) OpenTaiko/src/Common/VideoExporter.cs:134 — 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) OpenTaiko/src/Common/VideoExporter.cs:179 — 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) OpenTaiko/src/Common/VideoExporter.cs:371 — 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) OpenTaiko/src/Common/VideoExporter.cs:394 — 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) OpenTaiko/src/Common/VideoExporter.cs:398 — 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) OpenTaiko/src/Common/VideoExporter.cs:538 — 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) OpenTaiko/src/Components/CSongReplay.cs:217 — 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) OpenTaiko/src/Components/CSongReplay.cs:331 — 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) OpenTaiko/src/Components/CSongReplay.cs:415 — 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) OpenTaiko/src/Components/CSongReplay.cs:612 — 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) REDACTED:27 — 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) REDACTED:57 — 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) REDACTED:171 — 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) OpenTaiko/src/Lua/3D/GltfModel.cs:805 — 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) OpenTaiko/src/Lua/3D/Lua3DScene.Memory.cs:135 — 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) OpenTaiko/src/Lua/3D/LuaModelFunc.cs:36 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2Audio.cs:162 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:52 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:61 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:134 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:194 — 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.
  • + 8 more in this group — see findings.md.
D3 · God Classes · TooManyMethods · ×27
  • TooManyMethods: Lua3DScene OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs — TooManyMethods — 1271 significant lines (blank, comment-only and punctuation-only lines excluded), 228 methods, declared across 17 files: 3D/Lua3DScene.Objects.cs (37), 3D/Lua3DScene.Textures.cs (24), 3D/Lua3DScene.RaytraceModel.cs (22), 3D/Lua3DScene.Camera.cs (17), +13 more file(s). The bar is 30 methods; this is 198 over it, 7.60× 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: CStagePlayScreenCommon OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs — TooManyMethods — 3253 significant lines (blank, comment-only and punctuation-only lines excluded), 185 methods, declared across 2 files: 07.Game/CStagePlayScreenCommon.cs (177), 07.Game/CStagePlayScreenCommon.AIHits.cs (8). The bar is 30 methods; this is 155 over it, 6.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: GpuRasterizer OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs — TooManyMethods — 2523 significant lines (blank, comment-only and punctuation-only lines excluded), 171 methods, declared across 19 files: 3D/GpuRasterizer.Shadows.cs (19), 3D/GpuRasterizer.Shaders.cs (18), 3D/GpuRasterizer.Textures.cs (17), 3D/GpuRasterizer.World.cs (17), +15 more file(s). The bar is 30 methods; this is 141 over it, 5.70× 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: CTexture FDK/src/04.Graphics/CTexture.cs — TooManyMethods — 1097 significant lines (blank, comment-only and punctuation-only lines excluded), 124 methods, declared across 2 files: 04.Graphics/CTexture.cs (110), 04.Graphics/CTexture.Streaming.cs (14). The bar is 30 methods; this is 94 over it, 4.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: CTja OpenTaiko/src/Songs/CTja.cs — TooManyMethods — 3015 significant lines (blank, comment-only and punctuation-only lines excluded), 118 methods. The bar is 30 methods; this is 88 over it, 3.93× 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: LuaNetworking OpenTaiko/src/Lua/Networking/LuaNetworking.cs — TooManyMethods — 1026 significant lines (blank, comment-only and punctuation-only lines excluded), 92 methods. The bar is 30 methods; this is 62 over it, 3.07× 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: NotesManager OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs — TooManyMethods — 532 significant lines (blank, comment-only and punctuation-only lines excluded), 83 methods. The bar is 30 methods; this is 53 over it, 2.77× 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: Aup2ScriptLibrary OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs — TooManyMethods — 1037 significant lines (blank, comment-only and punctuation-only lines excluded), 81 methods. The bar is 30 methods; this is 51 over it, 2.70× 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: GltfModel OpenTaiko/src/Lua/3D/GltfModel.cs — TooManyMethods — 861 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 30 methods; this is 35 over it, 2.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: CSound FDK/src/03.Sound/CSound.cs — TooManyMethods — 563 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 30 methods; this is 32 over it, 2.07× 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: OpenTaiko OpenTaiko/src/Common/OpenTaiko.cs — TooManyMethods — 1324 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 30 methods; this is 30 over it, 2.00× 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: LuaAviUtl2Project OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs — TooManyMethods — 410 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods. The bar is 30 methods; this is 29 over it, 1.97× 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: Game FDK/src/01.Framework/Core/Game.cs — TooManyMethods — 707 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods. The bar is 30 methods; this is 28 over it, 1.93× 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: CStagePlayDrumsScreen OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs — TooManyMethods — 1147 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods, declared across 2 files: Taiko/CStagePlayDrumsScreen.cs (47), Taiko/CStagePlayDrumsScreen.Online.cs (2). The bar is 30 methods; this is 19 over it, 1.63× 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: Raytracer OpenTaiko/src/Lua/3D/Raytracer.cs — TooManyMethods — 462 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 30 methods; this is 17 over it, 1.57× 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: GameViewController OpenTaiko.iOS/GameViewController.cs — TooManyMethods — 573 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods, declared across 3 files: OpenTaiko.iOS/GameViewController.cs (30), OpenTaiko.iOS/GameViewController.TouchInput.cs (12), OpenTaiko.iOS/GameViewController.ExternalDisplay.cs (4). The bar is 30 methods; this is 16 over it, 1.53× 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: RtScene OpenTaiko/src/Lua/3D/RtScene.cs — TooManyMethods — 662 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. 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: CSkin OpenTaiko/src/Common/CSkin.cs — TooManyMethods — 4899 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23× 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: LuaCharacter OpenTaiko/src/Lua/Classes/LuaCharacter.cs — TooManyMethods — 115 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. 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: SoundManager FDK/src/03.Sound/SoundManager.cs — TooManyMethods — 307 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. 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: CConfigIni OpenTaiko/src/Common/CConfigIni.cs — TooManyMethods — 2091 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: Aup2Renderer OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs — TooManyMethods — 571 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: LuaCanvas OpenTaiko/src/Lua/Classes/LuaCanvas.cs — TooManyMethods — 376 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: CCharacter OpenTaiko/src/Character/CCharacter.cs — TooManyMethods — 224 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. 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: HGaugeMethods OpenTaiko/src/Helpers/HGaugeMethods.cs — TooManyMethods — 413 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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.
  • + 2 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×26
  • Duplicated block (5 lines × 2) OpenTaiko/src/Lua/3D/RtScene.cs:356 — OpenTaiko/src/Lua/3D/RtScene.cs:356-360 | OpenTaiko/src/Lua/3D/RtScene.cs:371-375 — 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 `OpenTaiko/src/Lua/3D/RtScene.cs:356` 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) OpenTaiko/src/Lua/3D/RtScene.cs:415 — OpenTaiko/src/Lua/3D/RtScene.cs:415-419 | OpenTaiko/src/Lua/3D/RtScene.cs:428-432 — 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 `OpenTaiko/src/Lua/3D/RtScene.cs:415` 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) OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:199 — OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:199-203 | OpenTaiko/src/Lua/Classes/GlyphQuadBatch.cs:105-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:199` 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) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:971 — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:971-975 | OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1535-1539 — 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 `OpenTaiko/src/Lua/Networking/LuaNetworking.cs:971` 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 (5 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1061 — OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1061-1065 | OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1071-1075 — 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 (5 lines × 2) OpenTaiko/src/Helpers/SevenZipHelper.cs:72 — OpenTaiko/src/Helpers/SevenZipHelper.cs:72-76 | OpenTaiko/src/Helpers/SevenZipHelper.cs:93-98 — 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 `OpenTaiko/src/Helpers/SevenZipHelper.cs:72` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:187 — OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:187-191 | OpenTaiko/src/Lua/3D/GpuRasterizer.Terrain.cs:118-122 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. 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) OpenTaiko/src/Lua/3D/GpuRasterizer.Surfaces.cs:82 — OpenTaiko/src/Lua/3D/GpuRasterizer.Surfaces.cs:82-86 | OpenTaiko/src/Lua/3D/GpuRasterizer.Terrain.cs:154-158 — 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.
  • Duplicated block (5 lines × 2) OpenTaiko/src/Lua/3D/Lua3DScene.Reflections.cs:44 — OpenTaiko/src/Lua/3D/Lua3DScene.Reflections.cs:44-54 | OpenTaiko/src/Lua/3D/Lua3DScene.Reflections.cs:118-122 — 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 `OpenTaiko/src/Lua/3D/Lua3DScene.Reflections.cs:44` 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) OpenTaiko/src/Lua/3D/Rasterizer.cs:357 — OpenTaiko/src/Lua/3D/Rasterizer.cs:357-361 | OpenTaiko/src/Lua/3D/Rasterizer.cs:390-394 — 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 `OpenTaiko/src/Lua/3D/Rasterizer.cs:357` 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 × 2) OpenTaiko/src/Lua/3D/Rasterizer.cs:474 — OpenTaiko/src/Lua/3D/Rasterizer.cs:474-478 | OpenTaiko/src/Lua/3D/Rasterizer.cs:492-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. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Lua/3D/Rasterizer.cs:474` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `OpenTaiko/src/Lua/3D/Rasterizer.cs:472` calls `ToCam` and `OpenTaiko/src/Lua/3D/Rasterizer.cs:491` 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 (5 lines × 2) OpenTaiko/src/Lua/3D/RtScene.cs:324 — OpenTaiko/src/Lua/3D/RtScene.cs:324-328 | OpenTaiko/src/Lua/3D/RtScene.cs:387-391 — 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 `OpenTaiko/src/Lua/3D/RtScene.cs:324` 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) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:51 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:51-55 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:62-66 — 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 (5 lines × 2) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:269 — OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:269-273 | OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:337-341 — 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 `OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:269` 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 (5 lines × 2) FDK/src/02.Input/CInputManager.cs:36 — FDK/src/02.Input/CInputManager.cs:36-40 | FDK/src/02.Input/CInputManager.cs:87-91 — 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 `FDK/src/02.Input/CInputManager.cs:36` 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 × 2) FDK/src/04.Graphics/CGradientMap.cs:103 — FDK/src/04.Graphics/CGradientMap.cs:103-107 | FDK/src/04.Graphics/CTexture.cs:1007-1014 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `FDK/src/04.Graphics/CGradientMap.cs:103` 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) OpenTaiko/src/Databases/DBCharacter.cs:49 — OpenTaiko/src/Databases/DBCharacter.cs:49-53 | OpenTaiko/src/Databases/DBPuchichara.cs:46-50 — before extracting anything, compare `OpenTaiko/src/Databases/DBCharacter.cs` and `OpenTaiko/src/Databases/DBPuchichara.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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. 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 (5 lines × 2) OpenTaiko/src/Databases/DBCharacter.cs:55 — OpenTaiko/src/Databases/DBCharacter.cs:55-59 | OpenTaiko/src/Databases/DBPuchichara.cs:52-56 — before extracting anything, compare `OpenTaiko/src/Databases/DBCharacter.cs` and `OpenTaiko/src/Databases/DBPuchichara.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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. 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 (5 lines × 2) OpenTaiko/src/Databases/DBCharacter.cs:61 — OpenTaiko/src/Databases/DBCharacter.cs:61-65 | OpenTaiko/src/Databases/DBPuchichara.cs:58-62 — before extracting anything, compare `OpenTaiko/src/Databases/DBCharacter.cs` and `OpenTaiko/src/Databases/DBPuchichara.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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. 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 (5 lines × 2) OpenTaiko/src/Stages/12.OnlineLounge/API.cs:44 — OpenTaiko/src/Stages/12.OnlineLounge/API.cs:44-48 | OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:512-516 — 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. 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 (5 lines × 2) OpenTaiko/src/Lua/3D/GpuRasterizer.cs:65 — OpenTaiko/src/Lua/3D/GpuRasterizer.cs:65-69 | OpenTaiko/src/Lua/3D/GpuRasterizer.cs:115-119 — 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 (5 lines × 2) OpenTaiko/src/Lua/3D/GpuRasterizer.Sprites.cs:96 — OpenTaiko/src/Lua/3D/GpuRasterizer.Sprites.cs:96-100 | OpenTaiko/src/Lua/3D/GpuRasterizer.Sprites.cs:108-112 — 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 `OpenTaiko/src/Lua/3D/GpuRasterizer.Sprites.cs:96` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) OpenTaiko/src/Lua/3D/RtScene.cs:831 — OpenTaiko/src/Lua/3D/RtScene.cs:831-835 | OpenTaiko/src/Lua/3D/RtScene.cs:841-845 — 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 (5 lines × 2) OpenTaiko/src/Lua/3D/RtScene.cs:901 — OpenTaiko/src/Lua/3D/RtScene.cs:901-905 | OpenTaiko/src/Lua/3D/RtScene.cs:907-911 — 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 `OpenTaiko/src/Lua/3D/RtScene.cs:901` 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. 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) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:427 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:427-431 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:441-445 — 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 `OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:427` 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.
  • + 1 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×24
  • FileTooLong: Common/CSkin.cs OpenTaiko/src/Common/CSkin.cs — FileTooLong — 5119 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4619 over it, 10.24× 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: 07.Game/CStagePlayScreenCommon.cs OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs — FileTooLong — 3383 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2883 over it, 6.77× 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: Songs/CTja.cs OpenTaiko/src/Songs/CTja.cs — FileTooLong — 3195 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2695 over it, 6.39× 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: Common/CConfigIni.cs OpenTaiko/src/Common/CConfigIni.cs — FileTooLong — 2357 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1857 over it, 4.71× 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: Common/OpenTaiko.cs OpenTaiko/src/Common/OpenTaiko.cs — FileTooLong — 1338 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 838 over it, 2.68× 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: Taiko/CStagePlayDrumsScreen.cs OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs — FileTooLong — 1131 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 631 over it, 2.26× 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: Networking/LuaNetworking.cs OpenTaiko/src/Lua/Networking/LuaNetworking.cs — FileTooLong — 1083 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 583 over it, 2.17× 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: AviUtl2/Aup2ScriptHost.cs OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs — FileTooLong — 1049 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 549 over it, 2.10× 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: 04.Graphics/CTexture.cs FDK/src/04.Graphics/CTexture.cs — FileTooLong — 967 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 467 over it, 1.93× 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: Taiko/Dan_Cert.cs OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs — FileTooLong — 893 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 393 over it, 1.79× 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: 3D/GltfModel.cs OpenTaiko/src/Lua/3D/GltfModel.cs — FileTooLong — 872 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 372 over it, 1.74× 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: 3D/Rasterizer.cs OpenTaiko/src/Lua/3D/Rasterizer.cs — FileTooLong — 833 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 333 over it, 1.67× 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: 01.StartUp/TextureLoader.cs OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs — FileTooLong — 763 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 263 over it, 1.53× 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: Core/Game.cs FDK/src/01.Framework/Core/Game.cs — FileTooLong — 727 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 227 over it, 1.45× 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: 3D/RtScene.cs OpenTaiko/src/Lua/3D/RtScene.cs — FileTooLong — 682 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 182 over it, 1.36× 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: Common/VideoExporter.cs OpenTaiko/src/Common/VideoExporter.cs — FileTooLong — 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 over it, 1.35× 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: 08.Result/CStageResult.cs OpenTaiko/src/Stages/08.Result/CStageResult.cs — FileTooLong — 665 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 165 over it, 1.33× 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: AviUtl2/Aup2Frame.cs OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs — FileTooLong — 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27× 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: Songs/CSongManager.cs OpenTaiko/src/Songs/CSongManager.cs — FileTooLong — 627 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 127 over it, 1.25× 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: AviUtl2/Aup2Renderer.cs OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs — FileTooLong — 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22× 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: Common/ImGuiDebugWindow.cs OpenTaiko/src/Common/ImGuiDebugWindow.cs — FileTooLong — 606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 106 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.
  • FileTooLong: 03.Sound/CSound.cs FDK/src/03.Sound/CSound.cs — FileTooLong — 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15× 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: Taiko/NotesManager.cs OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs — FileTooLong — 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 over it, 1.08× 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: 04.Graphics/CVideoDecoder.cs FDK/src/04.Graphics/CVideoDecoder.cs — FileTooLong — 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08× 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 · Duplicated block (6 lines × 2) · ×19
  • Duplicated block (6 lines × 2) OpenTaiko/src/Songs/CTja.cs:2173 — OpenTaiko/src/Songs/CTja.cs:2173-2178 | OpenTaiko/src/Songs/CTja.cs:2182-2187 — 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) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:43 — OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:43-48 | OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:71-76 — 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) OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:43 — OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:43-48 | OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:71-76 — 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) OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:39 — OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:39-44 | OpenTaiko/src/Lua/3D/Rasterizer.cs:659-664 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:39` 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 (6 lines × 2) OpenTaiko/src/Lua/Classes/LuaText.cs:87 — OpenTaiko/src/Lua/Classes/LuaText.cs:87-92 | OpenTaiko/src/Lua/Classes/LuaText.cs:101-106 — 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 `OpenTaiko/src/Lua/Classes/LuaText.cs:87` 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 (6 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1216 — OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1216-1221 | OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1300-1305 — 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) OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:42 — OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:42-47 | OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:67-72 — 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 `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:42` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) OpenTaiko/src/Helpers/SevenZipHelper.cs:120 — OpenTaiko/src/Helpers/SevenZipHelper.cs:120-125 | OpenTaiko/src/Helpers/SevenZipHelper.cs:153-158 — 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 `OpenTaiko/src/Helpers/SevenZipHelper.cs:120` 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 × 2) OpenTaiko/src/Lua/3D/GpuRasterizer.cs:135 — OpenTaiko/src/Lua/3D/GpuRasterizer.cs:135-140 | OpenTaiko/src/Lua/3D/GpuRaytracer.cs:357-362 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Lua/3D/GpuRasterizer.cs:135` 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 (6 lines × 2) OpenTaiko/src/Lua/3D/Rasterizer.cs:111 — OpenTaiko/src/Lua/3D/Rasterizer.cs:111-116 | OpenTaiko/src/Lua/3D/Rasterizer.cs:147-152 — 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 `OpenTaiko/src/Lua/3D/Rasterizer.cs:111` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) OpenTaiko/src/Lua/3D/Rasterizer.cs:946 — OpenTaiko/src/Lua/3D/Rasterizer.cs:946-952 | OpenTaiko/src/Lua/3D/Rasterizer.cs:1024-1029 — 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 `OpenTaiko/src/Lua/3D/Rasterizer.cs:946` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:794 — OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:794-799 | OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:808-813 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:508 — OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:508-513 | OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:631-636 — 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 `OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:508` 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 (6 lines × 2) OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:219 — OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:219-224 | OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:243-248 — 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 `OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:219` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:925 — OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:925-930 | OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:931-936 — 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 `OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:925` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:370 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:370-375 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersExtra.cs:238-243 — 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. 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 (6 lines × 2) OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:60 — OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:60-65 | OpenTaiko/src/Lua/Scripts/CLuaStageScript.cs:71-76 — 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.
  • Duplicated block (6 lines × 2) OpenTaiko/src/Lua/3D/GpuRasterizer.Terrain.cs:147 — OpenTaiko/src/Lua/3D/GpuRasterizer.Terrain.cs:147-152 | OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:392-397 — 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. 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 × 2) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:671 — OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:671-676 | OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:756-761 — 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 `OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:671` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:678` calls `CCounter` and `OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:763` 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×15
  • Hotspot: OpenTaiko/src/Common/CSkin.cs OpenTaiko/src/Common/CSkin.cs:1121 — OpenTaiko/src/Common/CSkin.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 1318 in CSkin.tLoadFromString at line 1121. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Common/CSkin.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: OpenTaiko/src/Common/OpenTaiko.cs OpenTaiko/src/Common/OpenTaiko.cs:689 — OpenTaiko/src/Common/OpenTaiko.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in OpenTaiko.Draw at line 689. 3 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Common/OpenTaiko.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: OpenTaiko/src/Songs/CTja.cs OpenTaiko/src/Songs/CTja.cs:1835 — OpenTaiko/src/Songs/CTja.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 172 in CTja.ParseCommand at line 1835. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Songs/CTja.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: OpenTaiko/src/Stages/08.Result/CStageResult.cs OpenTaiko/src/Stages/08.Result/CStageResult.cs:247 — OpenTaiko/src/Stages/08.Result/CStageResult.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in CStageResult.Activate at line 247. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Stages/08.Result/CStageResult.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: OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:372 — OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in CStagePlayDrumsScreen.Draw at line 372. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.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: OpenTaiko/src/Lua/3D/GltfModel.cs OpenTaiko/src/Lua/3D/GltfModel.cs:869 — OpenTaiko/src/Lua/3D/GltfModel.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 148 in GltfModel.LoadUncached at line 869. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Lua/3D/GltfModel.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: OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:49 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in CActImplMtaiko.Draw at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.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: OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:57 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in CActImplLaneTaiko.Draw at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.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: FDK/src/03.Sound/CSoundDeviceWASAPI.cs FDK/src/03.Sound/CSoundDeviceWASAPI.cs:113 — FDK/src/03.Sound/CSoundDeviceWASAPI.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in CSoundDeviceWASAPI.CSoundDeviceWASAPI.ctor at line 113. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- FDK/src/03.Sound/CSoundDeviceWASAPI.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: OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs:317 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CActImplClearAnimation.Draw at line 317. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.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: OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:257 — OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TextureLoader.LoadTexture at line 257. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Stages/01.StartUp/TextureLoader.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: FDK/src/01.Framework/Core/Game.cs FDK/src/01.Framework/Core/Game.cs:486 — FDK/src/01.Framework/Core/Game.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Game.Game.ctor at line 486. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- FDK/src/01.Framework/Core/Game.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: OpenTaiko/src/Common/Program.cs OpenTaiko/src/Common/Program.cs:76 — OpenTaiko/src/Common/Program.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Program.Main at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Common/Program.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: OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:514 — OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in NotesManager.DisplayNote at line 514. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.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: OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:150 — OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in GpuRasterizer.TexFor at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 14:31:52 +00:00' --until='2026-11-16 14:31:52 +00:00' --full-history --no-merges -- OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.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.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×14
  • Sync-over-async blocking — 13 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 OpenTaiko/src/Common/VideoExporter.cs:556 — `_ready.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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1420 — `.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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1453 — `.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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1478 — `.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 OpenTaiko/src/Songs/SoundtrackDownloader.cs:100 — `.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 OpenTaiko/src/Songs/SoundtrackDownloader.cs:197 — `.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 OpenTaiko/src/Songs/SoundtrackDownloader.cs:199 — `.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 OpenTaiko/src/Songs/SoundtrackDownloader.cs:201 — `.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 OpenTaiko/src/Stages/12.OnlineLounge/API.cs:92 — `_fetched.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 OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:541 — `.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 FDK/src/04.Graphics/CVideoDecoder.cs:447 — `decodeStopped.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 OpenTaiko.iOS/iOSSoundtrackDownloadHost.cs:34 — `done.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 OpenTaiko.Android/AndroidSoundtrackDownloadHost.cs:34 — `done.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).
D3 · God Classes · ClassTooLong · ×12
  • ClassTooLong: Dan_Cert OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs — ClassTooLong — 870 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 470 over it, 2.18× 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.
  • ClassTooLong: TextureLoader OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs — ClassTooLong — 745 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 345 over it, 1.86× 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.
  • ClassTooLong: CStageResult OpenTaiko/src/Stages/08.Result/CStageResult.cs — ClassTooLong — 661 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 261 over it, 1.65× 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.
  • ClassTooLong: CSongManager OpenTaiko/src/Songs/CSongManager.cs — ClassTooLong — 619 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 219 over it, 1.55× 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.
  • ClassTooLong: ImGuiDebugWindow OpenTaiko/src/Common/ImGuiDebugWindow.cs — ClassTooLong — 598 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 198 over it, 1.50× 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: CVideoDecoder FDK/src/04.Graphics/CVideoDecoder.cs — ClassTooLong — 470 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 70 over it, 1.18× 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.
  • ClassTooLong: CSongReplay OpenTaiko/src/Components/CSongReplay.cs — ClassTooLong — 449 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 49 over it, 1.12× 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.
  • ClassTooLong: Rasterizer OpenTaiko/src/Lua/3D/Rasterizer.cs — ClassTooLong — 427 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 27 over it, 1.07× 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.
  • ClassTooLong: CStageSongLoading OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs — ClassTooLong — 425 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 25 over it, 1.06× 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.
  • ClassTooLong: Aup2Gpu OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs — ClassTooLong — 423 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 23 over it, 1.06× 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.
  • ClassTooLong: LuaDanBuildFunc OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs — ClassTooLong — 419 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 19 over it, 1.05× 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.
  • ClassTooLong: Aup2Evaluator OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs — ClassTooLong — 403 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 3 over it, 1.01× 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.
D17 · Explicit Debt · TodoComment · ×11
  • TodoComment OpenTaiko/src/Character/PuchiChara.cs:88 — /* Todo : — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Common/OpenTaiko.cs:2150 — // TODO: check whether this condition is necessary with MacOS build — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:216 — // TODO: Generate backboxes here instead of on generation to avoid weird gaps — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Songs/CTja.cs:360 — // TODO: Calculate the proper score automatically — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Songs/CTja.cs:1949 — // TODO: If end at-or-after the 1st next BPM change, move the stop to start at that BPM change — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Songs/CTja.cs:2961 — // TODO: TaikoJiro 1 behavior: Make BPM work cross-branch — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Songs/CTja.cs:3015 — // TODO: TaikoJiro 1 behavior: Make `#BPMCHANGE`s work cross-branch for notes' timing — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Songs/VTTParser.cs:12 — // TODO : timestamp tag support — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Songs/VTTParser.cs:22 — // TODO: WIP, only first timestamp is accounted for — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:241 — // TODO: add Explosion_Big for 可/OK — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:307 — // TODO: add dedicated texture for more-type Low — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×11
  • Duplicated block (7 lines × 2) OpenTaiko/src/Songs/CSongManager.cs:405 — OpenTaiko/src/Songs/CSongManager.cs:405-411 | OpenTaiko/src/Songs/CSongManager.cs:1012-1018 — 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 `OpenTaiko/src/Songs/CSongManager.cs:405` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:341 — OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:341-347 | OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:375-381 — 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 `OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:341` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) OpenTaiko/src/Songs/CTci.cs:121 — OpenTaiko/src/Songs/CTci.cs:121-127 | OpenTaiko/src/Songs/CTcm.cs:153-159 — 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.
  • Duplicated block (7 lines × 2) OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:24 — OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:24-30 | OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:39-45 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) OpenTaiko/src/Lua/3D/Rasterizer.cs:204 — OpenTaiko/src/Lua/3D/Rasterizer.cs:204-210 | OpenTaiko/src/Lua/3D/Rasterizer.cs:219-225 — 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 `OpenTaiko/src/Lua/3D/Rasterizer.cs:204` 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 (7 lines × 2) OpenTaiko/src/Helpers/SevenZipHelper.cs:54 — OpenTaiko/src/Helpers/SevenZipHelper.cs:54-60 | OpenTaiko/src/Helpers/SevenZipHelper.cs:76-82 — 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 `OpenTaiko/src/Helpers/SevenZipHelper.cs:54` 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) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:122 — OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:122-128 | OpenTaiko/src/Lua/3D/Rasterizer.cs:407-413 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:122` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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 (7 lines × 2) OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:228 — OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:228-234 | OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:252-258 — 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 `OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:228` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1561 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1561-1567 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1571-1577 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1561` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1619 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1619-1625 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4162-4168 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1619` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersBlur.cs:416 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersBlur.cs:416-422 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersBlur.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.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×10
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:156 — OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:156-162 | OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:163-174 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/3D/IModel.cs:47 — OpenTaiko/src/Lua/3D/IModel.cs:47-53 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:66-73 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:193 — OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:193-199 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:203-209 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/3D/GpuRasterizer.Overlay2D.cs:25 — OpenTaiko/src/Lua/3D/GpuRasterizer.Overlay2D.cs:25-31 | OpenTaiko/src/Lua/3D/GpuRasterizer.Overlay2D.cs:32-39 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:255 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:255-261 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:263-269 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko.Android/MainActivity.cs:356 — OpenTaiko.Android/MainActivity.cs:356-362 | OpenTaiko.Android/MainActivity.cs:364-370 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:232 — OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:232-238 | OpenTaiko/src/Lua/AviUtl2/Aup2Track.cs:205-211 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:295 — OpenTaiko/src/Lua/3D/GpuRaytracer.cs:295-301 | OpenTaiko/src/Lua/3D/GpuRasterizer.Shaders.cs:201-207 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/LuaActivityWrapper.cs:27 — OpenTaiko/src/Lua/LuaActivityWrapper.cs:27-33 | OpenTaiko/src/Lua/LuaStageWrapper.cs:40-46 — 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.
  • Edited copy of a member (7 corresponding lines) OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:38 — OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:38-44 | OpenTaiko/src/Lua/Scripts/CLuaStageScript.cs:48-55 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×9
  • Edited copy of a member (6 corresponding lines) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:85 — OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:85-90 | OpenTaiko/src/Lua/3D/Rasterizer.cs:242-251 — 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) OpenTaiko/src/Lua/Classes/Math/LuaMatrix.cs:26 — OpenTaiko/src/Lua/Classes/Math/LuaMatrix.cs:26-31 | OpenTaiko/src/Lua/Classes/Math/LuaMatrix.cs:32-37 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:71 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:71-76 | OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:518-523 — 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) OpenTaiko.iOS/TouchDrumEditorViewController.cs:234 — OpenTaiko.iOS/TouchDrumEditorViewController.cs:234-239 | OpenTaiko.iOS/TouchDrumShape.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) OpenTaiko/src/Lua/Classes/LuaHeightmap.cs:29 — OpenTaiko/src/Lua/Classes/LuaHeightmap.cs:29-34 | OpenTaiko/src/Lua/Classes/LuaHeightmap.cs:215-220 — 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) OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:35 — OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:35-40 | OpenTaiko/src/Lua/Classes/Math/LuaMatrix4.cs:36-41 — 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) OpenTaiko/src/Lua/3D/Lua3DScene.Textures.cs:185 — OpenTaiko/src/Lua/3D/Lua3DScene.Textures.cs:185-190 | OpenTaiko/src/Lua/3D/Lua3DScene.Textures.cs:195-200 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:422 — OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:422-427 | OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:429-434 — 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) OpenTaiko/src/Stages/04.Config/CLuaKeyConfigService.cs:106 — OpenTaiko/src/Stages/04.Config/CLuaKeyConfigService.cs:106-111 | OpenTaiko/src/Stages/04.Config/CLuaKeyConfigService.cs:117-122 — 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.
X1 · Async correctness · Sync-over-async (deadlock risk) · ×9
  • Sync-over-async (deadlock risk) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1420 — 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) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1453 — 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) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1478 — 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) OpenTaiko/src/Songs/SoundtrackDownloader.cs:100 — 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) OpenTaiko/src/Songs/SoundtrackDownloader.cs:196 — 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) OpenTaiko/src/Songs/SoundtrackDownloader.cs:199 — 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) OpenTaiko/src/Songs/SoundtrackDownloader.cs:201 — 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) OpenTaiko/src/Stages/12.OnlineLounge/API.cs:92 — 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) OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:541 — 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.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×8
  • Edited copy of a member (10 corresponding lines) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:711 — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:711-720 | OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1366-1380 — 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) OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:14 — OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:14-23 | OpenTaiko/src/Lua/Classes/Math/LuaMatrix4.cs:14-23 — 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) OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:23 — OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:23-32 | OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:38-47 — 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) OpenTaiko/src/Databases/DBThemeSettings.cs:116 — OpenTaiko/src/Databases/DBThemeSettings.cs:116-125 | OpenTaiko/src/Databases/DBThemeSettings.cs:130-140 — 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) OpenTaiko/src/Components/UnlockConditions/CUnlockAndComb.cs:47 — OpenTaiko/src/Components/UnlockConditions/CUnlockAndComb.cs:47-56 | OpenTaiko/src/Components/UnlockConditions/CUnlockOrComb.cs:58-67 — 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) FDK/src/03.Sound/CSoundDeviceASIO.cs:89 — FDK/src/03.Sound/CSoundDeviceASIO.cs:89-98 | FDK/src/03.Sound/CSoundDeviceWASAPI.cs:77-103 — 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:185 — REDACTED:185-194 | REDACTED:196-205 — 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) OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:10 — OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:10-19 | OpenTaiko/src/Stages/XX.Templates/CStageTemplate.cs:5-14 — 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×8
  • Low cohesion: Lua3DScene (LCOM4 39) OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:7 — Lua3DScene's methods fall into 39 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 39 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.
  • Low cohesion: PhysicsBody (LCOM4 11) OpenTaiko/src/Lua/3D/Physics/PhysicsBody.cs:19 — PhysicsBody's methods fall into 11 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 11 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.
  • Low cohesion: LuaInputFunc (LCOM4 7) OpenTaiko/src/Lua/Classes/LuaInput.cs:5 — LuaInputFunc's methods fall into 7 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 7 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.
  • Low cohesion: LuaSongListSettings (LCOM4 6) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongListSettings.cs:4 — LuaSongListSettings's methods fall into 6 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 6 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.
  • Low cohesion: CInputMouse (LCOM4 5) FDK/src/02.Input/CInputMouse.cs:7 — CInputMouse's methods fall into 5 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 5 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.
  • Low cohesion: CSkin (LCOM4 4) OpenTaiko/src/Common/CSkin.cs:40 — CSkin'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.
  • Low cohesion: LuaSharedResourceFunc (LCOM4 4) OpenTaiko/src/Lua/Classes/SharedResources/LuaSharedResource.cs:127 — LuaSharedResourceFunc'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.
  • Low cohesion: CActPlayPauseMenu (LCOM4 4) OpenTaiko/src/Stages/07.Game/CActPlayPauseMenu.cs:9 — CActPlayPauseMenu'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.
D10 · Test Quality · Fixed-sleep synchronisation · ×7
  • Fixed-sleep synchronisation: Host_SubscribesAgain_AfterTheBrokerDropsItsLink OpenTaiko.Tests/NetworkingConnectTests.cs:214 — This test starts a thread through `LuaNetworking.CreateRoom` and then orders itself against it with `Thread.Sleep(400)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
  • Fixed-sleep synchronisation: JoinAgain_WhileTheFirstJoinStillRuns_GivesTheHostOnePlayer OpenTaiko.Tests/NetworkingConnectTests.cs:455 — This test starts a thread through `LuaNetworking.CreateRoom` and then orders itself against it with `Thread.Sleep(350)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
  • Fixed-sleep synchronisation: LoadBarrier_ToleratesEarlyLd OpenTaiko.Tests/NetworkingTests.cs:167 — This test starts a thread through `LuaNetworking.CreateRoom` and then orders itself against it with `Thread.Sleep(400)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
  • Fixed-sleep synchronisation: AudioTrack_IsDecodedPushedAndClocksTheVideo OpenTaiko.Tests/VideoAudioTests.cs:50 — This test starts a spawned process and then orders itself against it with `Thread.Sleep(400)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
  • Fixed-sleep synchronisation: AudioTrack_PlaysThroughAMixer OpenTaiko.Tests/VideoAudioTests.cs:92 — This test starts a spawned process and then orders itself against it with `Thread.Sleep(400)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
  • Fixed-sleep synchronisation: AudioTrack_PlaysThroughADecodeMixerFromAWorkerThread OpenTaiko.Tests/VideoAudioTests.cs:124 — This test starts a background task and then orders itself against it with `Thread.Sleep(400)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
  • Fixed-sleep synchronisation: VideoPacketsMuxedAheadOfAudio_StillStart OpenTaiko.Tests/VideoAudioTests.cs:169 — This test starts a background task and then orders itself against it with `Thread.Sleep(500)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×7
  • Edited copy of a member (12 corresponding lines) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:80 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:80-91 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:93-106 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:423 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:423-434 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:437-448 — 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) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:222 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:222-234 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplComboBalloon.cs:142-153 — 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) OpenTaiko/src/Lua/Classes/DataPersistence/LuaDataStorage.cs:39 — OpenTaiko/src/Lua/Classes/DataPersistence/LuaDataStorage.cs:39-51 | OpenTaiko/src/Lua/Classes/DataPersistence/LuaDataStorage.cs:85-96 — 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) OpenTaiko/src/Common/VideoExporter.cs:688 — OpenTaiko/src/Common/VideoExporter.cs:688-699 | OpenTaiko/src/Common/VideoExporter.cs:760-771 — 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) OpenTaiko/src/Common/CVirtualSlotManager.cs:137 — OpenTaiko/src/Common/CVirtualSlotManager.cs:137-150 | OpenTaiko/src/Common/CVirtualSlotManager.cs:155-166 — 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) FDK/src/03.Sound/CSoundDeviceASIO.cs:77 — FDK/src/03.Sound/CSoundDeviceASIO.cs:77-88 | FDK/src/03.Sound/CSoundDeviceWASAPI.cs:62-76 — 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 (1 corresponding lines) · ×7
  • Edited copy of a member (1 corresponding lines) OpenTaiko/src/Lua/3D/Raytracer.cs:30 — OpenTaiko/src/Lua/3D/Raytracer.cs:30-30 | OpenTaiko/src/Lua/Classes/Math/LuaVector3.cs:31-34 — 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) OpenTaiko/src/Lua/3D/Raytracer.cs:28 — OpenTaiko/src/Lua/3D/Raytracer.cs:28-28 | OpenTaiko/src/Lua/Classes/Math/LuaVector3.cs:20-23 — 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) OpenTaiko/src/Lua/Classes/Math/LuaVector3.cs:35 — OpenTaiko/src/Lua/Classes/Math/LuaVector3.cs:35-35 | OpenTaiko/src/Lua/Classes/Math/LuaVector4.cs:33-33 — 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) OpenTaiko/src/Lua/3D/Lua3DScene.Lighting.cs:60 — OpenTaiko/src/Lua/3D/Lua3DScene.Lighting.cs:60-60 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:93-95 — 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) OpenTaiko/src/Lua/3D/Lua3DScene.Lighting.cs:64 — OpenTaiko/src/Lua/3D/Lua3DScene.Lighting.cs:64-64 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:100-102 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:656 — OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:656-656 | OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1023-1023 — 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) OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:9 — OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:9-9 | OpenTaiko/src/Lua/Classes/Math/LuaMatrix4.cs:9-9 — 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 · Duplicated block (8 lines × 2) · ×7
  • Duplicated block (8 lines × 2) OpenTaiko/src/Lua/3D/GltfModel.cs:166 — OpenTaiko/src/Lua/3D/GltfModel.cs:166-173 | OpenTaiko/src/Lua/3D/GltfModel.cs:536-543 — 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 `OpenTaiko/src/Lua/3D/GltfModel.cs:166` 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 (8 lines × 2) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:389 — OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:389-396 | OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:540-547 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) OpenTaiko/src/Helpers/HGaugeMethods.cs:505 — OpenTaiko/src/Helpers/HGaugeMethods.cs:505-512 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs:317-324 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Helpers/HGaugeMethods.cs:505` 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) OpenTaiko/src/Helpers/HGaugeMethods.cs:524 — OpenTaiko/src/Helpers/HGaugeMethods.cs:524-531 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs:283-290 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Helpers/HGaugeMethods.cs:524` 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) OpenTaiko/src/Lua/3D/Rasterizer.cs:923 — OpenTaiko/src/Lua/3D/Rasterizer.cs:923-930 | OpenTaiko/src/Lua/3D/Rasterizer.cs:1000-1007 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) OpenTaiko/src/Lua/3D/Rasterizer.cs:725 — OpenTaiko/src/Lua/3D/Rasterizer.cs:725-732 | OpenTaiko/src/Lua/3D/Rasterizer.cs:740-747 — 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 `OpenTaiko/src/Lua/3D/Rasterizer.cs:725` 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 (8 lines × 2) OpenTaiko/src/Common/ImGuiDebugWindow.cs:151 — OpenTaiko/src/Common/ImGuiDebugWindow.cs:151-158 | OpenTaiko/src/Common/ImGuiDebugWindow.cs:159-166 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×7
  • Swallowed exception (caught, then discarded) OpenTaiko/src/Common/VideoExporter.cs:325 — `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) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:67 — `catch (Exception)` 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) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersExtra.cs:255 — `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) OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:438 — `catch (Exception)` 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) OpenTaiko/src/Lua/Classes/LuaCharacter.cs:215 — `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) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:114 — `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) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:122 — `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.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×6
  • Edited copy of a member (8 corresponding lines) OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:256 — OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:256-264 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:322-329 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:108 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:108-118 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:140-147 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:759 — OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:759-768 | OpenTaiko/src/Lua/AviUtl2/Aup2SceneChanges.cs:33-40 — 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) OpenTaiko/src/Common/CNotesSkins.cs:85 — OpenTaiko/src/Common/CNotesSkins.cs:85-92 | OpenTaiko/src/Common/CNotesSkins.cs:95-102 — 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) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:374 — OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:374-381 | OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:383-390 — 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) OpenTaiko/src/Songs/TJA/TriggersCounters/CLocalCounters.cs:20 — OpenTaiko/src/Songs/TJA/TriggersCounters/CLocalCounters.cs:20-27 | OpenTaiko/src/Songs/TJA/TriggersCounters/CLocalTriggers.cs:20-27 — 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 · Duplicated block (12 lines × 2) · ×6
  • Duplicated block (12 lines × 2) FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:82 — FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:82-93 | FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:136-147 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:82` 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 (12 lines × 2) OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs:788 — OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs:788-799 | OpenTaiko/src/Songs/CTcm.cs:310-321 — 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 (12 lines × 2) OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:28 — OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:28-39 | OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs:28-39 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3453 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3453-3465 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3471-3482 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3453` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:258 — OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:258-269 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:316-327 — 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 `OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:258` 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 (12 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:160 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:160-171 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:223-234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×6
  • Duplicated block (9 lines × 2) OpenTaiko/src/Stages/07.Game/CActPlayPanelString.cs:198 — OpenTaiko/src/Stages/07.Game/CActPlayPanelString.cs:198-206 | OpenTaiko/src/Stages/07.Game/CActPlayPanelString.cs:229-237 — 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 (9 lines × 2) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1342 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1342-1350 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1395-1403 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1342` 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) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1917 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1917-1925 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1969-1977 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1917` 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) FDK/src/00.Common/CCounter.cs:131 — FDK/src/00.Common/CCounter.cs:131-139 | FDK/src/00.Common/CCounter.cs:191-199 — 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 `FDK/src/00.Common/CCounter.cs:131` 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) FDK/src/00.Common/CCounter.cs:154 — FDK/src/00.Common/CCounter.cs:154-162 | FDK/src/00.Common/CCounter.cs:214-222 — 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 `FDK/src/00.Common/CCounter.cs:154` 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) OpenTaiko/src/Stages/07.Game/Taiko/CActImplChipEffects.cs:73 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplChipEffects.cs:73-82 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplChipEffects.cs:85-93 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×6
  • Duplicated block (6 lines × 3) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:196 — OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:196-201 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:287-292 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:338-345 — 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 `OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:196` 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 (6 lines × 3) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1921 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1921-1926 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1973-1978 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2028-2033 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1921` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 3) OpenTaiko/src/Components/UnlockConditions/CUnlockCH.cs:27 — OpenTaiko/src/Components/UnlockConditions/CUnlockCH.cs:27-32 | OpenTaiko/src/Components/UnlockConditions/CUnlockCM.cs:25-30 | OpenTaiko/src/Components/UnlockConditions/CUnlockCS.cs:25-30 — 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 all 3 call sites, so a change lands once. 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 (6 lines × 3) OpenTaiko/src/Songs/CTci.cs:79 — OpenTaiko/src/Songs/CTci.cs:79-84 | OpenTaiko/src/Songs/CTcm.cs:75-80 | OpenTaiko/src/Songs/CTct.cs:42-47 — 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 all 3 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 (6 lines × 3) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:232 — OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:232-237 | OpenTaiko/src/Lua/3D/Rasterizer.cs:504-509 | OpenTaiko/src/Lua/3D/RtScene.cs:556-561 — 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 all 3 call sites, so a change lands once. 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 first that the copies are not typed on the same thing: the declarations holding them bind `x` to `out double` in one and `double` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (6 lines × 3) OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:454 — OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:454-459 | OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:463-468 | OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:470-475 — 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 `OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:454` 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.
IC1 · Incompleteness & stubs · Empty method body · ×6
  • Empty method body — does nothing with its inputs FDK/src/01.Framework/Core/Game.cs:1232 — `Window_Move` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs FDK/src/01.Framework/Core/Game.cs:1234 — `Window_FramebufferResize` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs FDK/src/02.Input/CInputKeyboard.cs:39 — `KeyChar` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs FDK/src/02.Input/CInputMouse.cs:51 — `Mouse_Click` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs FDK/src/02.Input/CInputMouse.cs:55 — `Mouse_DoubleClick` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:14 — `tFadeIn` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
D29 · Static Analysis (SAST) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×5
  • Edited copy of a member (13 corresponding lines) OpenTaiko/src/Lua/3D/Lua3DScene.Textures.cs:217 — OpenTaiko/src/Lua/3D/Lua3DScene.Textures.cs:217-229 | OpenTaiko/src/Lua/3D/Lua3DScene.Textures.cs:232-247 — 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.
  • Edited copy of a member (13 corresponding lines) OpenTaiko/src/Lua/Classes/LuaIniLoader.cs:40 — OpenTaiko/src/Lua/Classes/LuaIniLoader.cs:40-52 | OpenTaiko/src/Lua/Classes/LuaIniLoader.cs:54-66 — 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.
  • Edited copy of a member (13 corresponding lines) FDK/src/00.Common/CUtility.cs:58 — FDK/src/00.Common/CUtility.cs:58-72 | FDK/src/00.Common/CUtility.cs:73-85 — 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.
  • Edited copy of a member (13 corresponding lines) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:312 — OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:312-324 | OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:330-343 — 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.
  • Edited copy of a member (13 corresponding lines) OpenTaiko/src/Lua/Classes/LuaText.cs:151 — OpenTaiko/src/Lua/Classes/LuaText.cs:151-167 | OpenTaiko/src/Lua/Classes/LuaText.cs:173-185 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×5
  • Edited copy of a member (9 corresponding lines) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:702 — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:702-710 | OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1357-1365 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) OpenTaiko/src/Lua/3D/GltfModel.cs:925 — OpenTaiko/src/Lua/3D/GltfModel.cs:925-933 | OpenTaiko/src/Lua/3D/GltfModel.cs:934-942 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:124 — OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:124-132 | OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:134-142 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:720 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:720-728 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:736-744 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) OpenTaiko/src/Common/CSkin.cs:290 — OpenTaiko/src/Common/CSkin.cs:290-298 | OpenTaiko/src/Common/CSkin.cs:300-308 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×5
  • Edited copy of a member (11 corresponding lines) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:488 — OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:488-515 | OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:517-527 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:248 — OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:248-258 | OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:35-47 — 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) OpenTaiko/src/Databases/DBThemeSettings.cs:85 — OpenTaiko/src/Databases/DBThemeSettings.cs:85-95 | OpenTaiko/src/Databases/DBThemeSettings.cs:102-113 — 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) FDK/src/00.Common/CCounter.cs:173 — FDK/src/00.Common/CCounter.cs:173-184 | FDK/src/00.Common/CCounter.cs:233-243 — 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) FDK/src/01.Framework/Core/CFrameProfiler.cs:147 — FDK/src/01.Framework/Core/CFrameProfiler.cs:147-157 | FDK/src/01.Framework/Core/CFrameProfiler.cs:183-196 — 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.
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×5
  • Edited copy of a member (4 corresponding lines) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:224 — OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:224-227 | OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:229-232 — 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) OpenTaiko/src/Lua/Classes/Math/LuaQuaternion.cs:24 — OpenTaiko/src/Lua/Classes/Math/LuaQuaternion.cs:24-29 | OpenTaiko/src/Lua/Classes/Math/LuaVector4.cs:28-31 — 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) OpenTaiko/src/Lua/Classes/Math/LuaVector3.cs:26 — OpenTaiko/src/Lua/Classes/Math/LuaVector3.cs:26-29 | OpenTaiko/src/Lua/Classes/Math/LuaVector4.cs:23-26 — 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) OpenTaiko/src/Lua/3D/Physics/PhysicsColliders.cs:22 — OpenTaiko/src/Lua/3D/Physics/PhysicsColliders.cs:22-25 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:76-79 — 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) OpenTaiko/src/Lua/Classes/Math/LuaMatrix2.cs:33 — OpenTaiko/src/Lua/Classes/Math/LuaMatrix2.cs:33-36 | OpenTaiko/src/Lua/Classes/Math/LuaVector2.cs:29-32 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×5
  • Duplicated block (15 lines × 2) OpenTaiko/src/Songs/CTja.cs:4343 — OpenTaiko/src/Songs/CTja.cs:4343-4357 | OpenTaiko/src/Songs/CTja.cs:4374-4388 — 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 `OpenTaiko/src/Songs/CTja.cs:4343` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (15 lines × 2) OpenTaiko/src/Common/CSongDict.cs:178 — OpenTaiko/src/Common/CSongDict.cs:178-192 | OpenTaiko/src/Common/CSongDict.cs:199-213 — 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 `OpenTaiko/src/Common/CSongDict.cs:178` 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. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (15 lines × 2) FDK/src/00.Common/CCounter.cs:133 — FDK/src/00.Common/CCounter.cs:133-147 | FDK/src/00.Common/CCounter.cs:156-170 — 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 `FDK/src/00.Common/CCounter.cs:133` 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 (15 lines × 2) FDK/src/00.Common/CCounter.cs:193 — FDK/src/00.Common/CCounter.cs:193-207 | FDK/src/00.Common/CCounter.cs:216-230 — 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 `FDK/src/00.Common/CCounter.cs:193` 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 (15 lines × 2) OpenTaiko/src/Lua/3D/Rasterizer.cs:907 — OpenTaiko/src/Lua/3D/Rasterizer.cs:907-921 | OpenTaiko/src/Lua/3D/Rasterizer.cs:980-994 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×5
  • Duplicated block (11 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:262 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:262-272 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplRunner.cs:170-180 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:262` 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 (11 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:463 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:463-473 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:487-497 — 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 (11 lines × 2) OpenTaiko/src/Components/UnlockConditions/CUnlockAndComb.cs:8 — OpenTaiko/src/Components/UnlockConditions/CUnlockAndComb.cs:8-18 | OpenTaiko/src/Components/UnlockConditions/CUnlockOrComb.cs:8-18 — 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.
  • Duplicated block (11 lines × 2) OpenTaiko/src/Songs/CTja.cs:3653 — OpenTaiko/src/Songs/CTja.cs:3653-3663 | OpenTaiko/src/Songs/CTja.cs:3758-3769 — 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 `OpenTaiko/src/Songs/CTja.cs:3653` 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 (11 lines × 2) FDK/src/04.Graphics/CTexture.cs:1393 — FDK/src/04.Graphics/CTexture.cs:1393-1403 | FDK/src/04.Graphics/CTexture.cs:1583-1593 — 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.
S1 · Cryptographic Hygiene · Weak hash algorithm · ×5
  • Weak hash algorithm OpenTaiko/src/Components/CSongReplay.cs:88 — 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 OpenTaiko/src/Songs/CSongManager.cs:122 — 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 OpenTaiko/src/Songs/CSongManager.cs:399 — 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 OpenTaiko/src/Songs/CSongManager.cs:1006 — 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 OpenTaiko/src/Songs/SoundtrackDownloader.cs:221 — 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.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×5
  • NuGet dependencies are not locked FDK/FDK.csproj:9 — FDK/FDK.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 OpenTaiko.Android/OpenTaiko.Android.csproj:66 — OpenTaiko.Android/OpenTaiko.Android.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 OpenTaiko.Tests/OpenTaiko.Tests.csproj:11 — OpenTaiko.Tests/OpenTaiko.Tests.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 OpenTaiko.iOS/OpenTaiko.iOS.csproj:26 — OpenTaiko.iOS/OpenTaiko.iOS.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 OpenTaiko/OpenTaiko.csproj:8 — OpenTaiko/OpenTaiko.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 (19 corresponding lines) · ×4
  • Edited copy of a member (19 corresponding lines) OpenTaiko/src/Lua/Classes/LuaInput.cs:20 — OpenTaiko/src/Lua/Classes/LuaInput.cs:20-38 | OpenTaiko/src/Lua/Classes/LuaInput.cs:98-116 — 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) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:311 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:311-345 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:348-366 — 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) OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:75 — OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:75-93 | OpenTaiko/src/Lua/Scripts/CLuaStageScript.cs:124-147 — 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:249 — REDACTED:249-268 | REDACTED:311-329 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (5 corresponding lines) · ×4
  • Edited copy of a member (5 corresponding lines) OpenTaiko/src/Common/CHitSounds.cs:35 — OpenTaiko/src/Common/CHitSounds.cs:35-39 | OpenTaiko/src/Common/CHitSounds.cs:42-46 — 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.
  • Edited copy of a member (5 corresponding lines) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:856 — OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:856-860 | OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:659-664 — 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.
  • Edited copy of a member (5 corresponding lines) OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:30 — OpenTaiko/src/Lua/Classes/Math/LuaMatrix3.cs:30-34 | OpenTaiko/src/Lua/Classes/Math/LuaMatrix4.cs:31-35 — 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.
  • Edited copy of a member (5 corresponding lines) OpenTaiko/src/Songs/CSongManager.cs:121 — OpenTaiko/src/Songs/CSongManager.cs:121-125 | OpenTaiko/src/Songs/SoundtrackDownloader.cs:220-224 — 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 · Duplicated block (10 lines × 2) · ×4
  • Duplicated block (10 lines × 2) OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:11 — OpenTaiko/src/Lua/Scripts/CLuaActivityScript.cs:11-20 | OpenTaiko/src/Lua/Scripts/CLuaStageScript.cs:17-26 — 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.
  • Duplicated block (10 lines × 2) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:67 — OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:67-76 | OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:67-76 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:67` 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) OpenTaiko/src/Lua/3D/Rasterizer.cs:121 — OpenTaiko/src/Lua/3D/Rasterizer.cs:121-130 | OpenTaiko/src/Lua/3D/Rasterizer.cs:157-166 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Lua/3D/Rasterizer.cs:121` 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 (10 lines × 2) OpenTaiko/src/Songs/CSongListNodeComparers/CSongListNodeComparerLevel.cs:10 — OpenTaiko/src/Songs/CSongListNodeComparers/CSongListNodeComparerLevel.cs:10-19 | OpenTaiko/src/Songs/CSongListNodeComparers/CSongListNodeComparerLevelIcon.cs:10-19 — 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. 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.
D17 · Explicit Debt · Whole file has no live code · ×3
  • Whole file has no live code — 10 debt markers inside it FDK/src/06.Tempo/CBeatDetect.cs:2 — Every line in this file is a comment or blank — it declares no type, member, using or attribute, so nothing in it reaches the build. Its 10 debt markers (10 CommentedOutCode) all sit inside that dead text: one decision to leave the whole file switched off, not 10 independent debts. It records no note anywhere: the file is switched off with nothing in it saying why, so a reader cannot tell whether it is waiting on something or was simply abandoned — which is the harder of the two to bring back. Decide the FILE rather than its lines — restore it, or delete it and let version control hold the history. (Every occurrence still counts toward the score and metrics.)
  • Whole file has no live code — 6 debt markers inside it OpenTaiko/src/Character/CMenuCharacter.cs:14 — Every line in this file is a comment or blank — it declares no type, member, using or attribute, so nothing in it reaches the build. Its 6 debt markers (6 CommentedOutCode) all sit inside that dead text: one decision to leave the whole file switched off, not 6 independent debts. It records no note anywhere: the file is switched off with nothing in it saying why, so a reader cannot tell whether it is waiting on something or was simply abandoned — which is the harder of the two to bring back. Decide the FILE rather than its lines — restore it, or delete it and let version control hold the history. (Every occurrence still counts toward the score and metrics.)
  • Whole file has no live code — 6 debt markers inside it OpenTaiko/src/Character/CResultCharacter.cs:12 — Every line in this file is a comment or blank — it declares no type, member, using or attribute, so nothing in it reaches the build. Its 6 debt markers (6 CommentedOutCode) all sit inside that dead text: one decision to leave the whole file switched off, not 6 independent debts. It records no note anywhere: the file is switched off with nothing in it saying why, so a reader cannot tell whether it is waiting on something or was simply abandoned — which is the harder of the two to bring back. Decide the FILE rather than its lines — restore it, or delete it and let version control hold the history. (Every occurrence still counts toward the score and metrics.)
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×3
  • Edited copy of a member (14 corresponding lines) OpenTaiko/src/Lua/3D/Rasterizer.cs:195 — OpenTaiko/src/Lua/3D/Rasterizer.cs:195-210 | OpenTaiko/src/Lua/3D/Rasterizer.cs:212-225 — 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) OpenTaiko/src/Lua/Classes/LuaText.cs:86 — OpenTaiko/src/Lua/Classes/LuaText.cs:86-99 | OpenTaiko/src/Lua/Classes/LuaText.cs:100-113 — 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) OpenTaiko/src/I18N/ILang.cs:66 — OpenTaiko/src/I18N/ILang.cs:66-79 | OpenTaiko/src/I18N/ILang.cs:81-94 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×3
  • Edited copy of a member (15 corresponding lines) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:98 — OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:98-115 | OpenTaiko/src/Lua/3D/RtScene.cs:273-287 — 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.
  • Edited copy of a member (15 corresponding lines) OpenTaiko/src/Common/TitleTextureKey.cs:57 — OpenTaiko/src/Common/TitleTextureKey.cs:57-71 | OpenTaiko/src/Common/TitleTextureKey.cs:74-88 — 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.
  • Edited copy of a member (15 corresponding lines) REDACTED:84 — REDACTED:84-98 | REDACTED:115-129 — 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 (17 corresponding lines) · ×3
  • Edited copy of a member (17 corresponding lines) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:969 — OpenTaiko/src/Lua/Networking/LuaNetworking.cs:969-986 | OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1533-1549 — 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.
  • Edited copy of a member (17 corresponding lines) OpenTaiko/src/Songs/CTja.cs:2749 — OpenTaiko/src/Songs/CTja.cs:2749-2765 | OpenTaiko/src/Songs/CTja.cs:2767-2788 — 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.
  • Edited copy of a member (17 corresponding lines) OpenTaiko/src/Common/CConfigIni.cs:621 — OpenTaiko/src/Common/CConfigIni.cs:621-637 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:586-604 — 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 copy of a member (3 corresponding lines) · ×3
  • Edited copy of a member (3 corresponding lines) OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:26 — OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:26-28 | OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:80-83 — These two members are one piece of code written twice and then edited apart: 3 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 (3 corresponding lines) FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:38 — FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:38-40 | FDK/src/04.Graphics/TextRenderer/CFontRenderer.cs:136-138 — These two members are one piece of code written twice and then edited apart: 3 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 (3 corresponding lines) FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:62 — FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:62-64 | FDK/src/04.Graphics/TextRenderer/CFontRenderer.cs:144-146 — These two members are one piece of code written twice and then edited apart: 3 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, 1+ corresponding lines) · ×3
  • Edited copies of one member (3 members, 1+ corresponding lines) OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:86 — OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:86-88 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:122-122 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:125-125 — These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) OpenTaiko/src/Lua/3D/Lua3DScene.Lighting.cs:20 — OpenTaiko/src/Lua/3D/Lua3DScene.Lighting.cs:20-24 | OpenTaiko/src/Lua/3D/Physics/PhysicsBody.cs:65-65 | OpenTaiko/src/Lua/3D/Physics/PhysicsColliders.cs:43-43 — These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) OpenTaiko/src/Lua/Classes/DataPersistence/LuaDataStorage.cs:71 — OpenTaiko/src/Lua/Classes/DataPersistence/LuaDataStorage.cs:71-71 | OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:606-606 | OpenTaiko/src/Lua/Classes/LuaVideo.cs:143-143 — These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart.
X18 · Disposal-pattern correctness · Owned disposable field is never released · ×3
  • Owned disposable field is never released OpenTaiko/src/Lua/CLuaScript.cs:91 — `CLuaScript` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `lfBindload` itself (line 91), which makes that instance its own. But `lfBindload` is named in none of the methods the disposal search covered: `Dispose` (line 532) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`lfBindload?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree.
  • Owned disposable field is never released OpenTaiko/src/Lua/CLuaScript.cs:92 — `CLuaScript` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `lfLoadAssets` itself (line 92), which makes that instance its own. But `lfLoadAssets` is named in none of the methods the disposal search covered: `Dispose` (line 532) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`lfLoadAssets?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree.
  • Owned disposable field is never released OpenTaiko/src/Lua/CLuaScript.cs:93 — `CLuaScript` implements `IDisposable` — so it has told every caller it holds something worth releasing — and it constructs `lfReloadLanguage` itself (line 93), which makes that instance its own. But `lfReloadLanguage` is named in none of the methods the disposal search covered: `Dispose` (line 532) — that is `Dispose` plus every method `Dispose` calls BY NAME, so a release reached through an interface, a delegate or a base class is not followed and is worth checking before acting. On what was read, the type's disposal releases everything except the one thing it owns. A disposable the owner never disposes is held until finalization if its type has a finalizer, and forever if it does not — which for a synchronisation primitive, a timer, a stream or a handle means the resource accumulates once per instance for the life of the process. Release it in `Dispose` (`lfReloadLanguage?.Dispose();`), or, if it truly does not need releasing, drop `IDisposable` from the type so the claim and the behaviour agree.
X5 · Nullable reference types · Symbol treated as nullable, then dereferenced unguarded · ×3
  • Symbol treated as nullable, then dereferenced unguarded OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:561 — This method contradicts itself about `t`: line 557 writes `t?.Drop`, which says `t` can be null, but line 561 then dereferences it directly as `t.Dispose` 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 `t` truly cannot be null here, the `?.` is misleading. Settle it one way — test `t` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side.
  • Symbol treated as nullable, then dereferenced unguarded OpenTaiko/src/Lua/Classes/SongsManagement/LuaBestScoreInfo.cs:48 — This method contradicts itself about `songChart`: line 50 writes `songChart?.Parent`, which says `songChart` can be null, but line 48 then dereferences it directly as `songChart.Difficulty` 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 `songChart` truly cannot be null here, the `?.` is misleading. Settle it one way — test `songChart` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side.
  • Symbol treated as nullable, then dereferenced unguarded OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1022 — This method contradicts itself about `cli`: line 1069 writes `cli?.Close`, which says `cli` can be null, but line 1022 then dereferences it directly as `cli.GetStream` 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 `cli` truly cannot be null here, the `?.` is misleading. Settle it one way — test `cli` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side.
D17 · Explicit Debt · FixmeComment · ×2
  • FixmeComment OpenTaiko/src/Common/CConfigIni.cs:287 — // FIXME: Negation should be removed and booleans flipped — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment OpenTaiko/src/Common/CConfigIni.cs:532 — // FIXME: should be flipped — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D17 · Explicit Debt · DeadPreprocessorBranch · ×2
  • DeadPreprocessorBranch OpenTaiko/src/Songs/CSongManager.cs:916 — #if TEST_SORTBGM — no definition of that symbol was found anywhere this analysis looks: not in a <DefineConstants> in any project file, props or targets under any condition, not on a build script's command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles — including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code.
  • DeadPreprocessorBranch OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs:229 — #if false — no definition of that symbol was found anywhere this analysis looks: not in a <DefineConstants> in any project file, props or targets under any condition, not on a build script's command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles — including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code.
D17 · Explicit Debt · HackComment · ×2
  • HackComment OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:242 — // HACK: made whiter — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
  • HackComment OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1069 — // hack: make the texture white — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (6 members, 50+ identical tokens) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:28 — OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:28-63 | OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:65-85 | OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:28-63 | OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:65-85 | OpenTaiko/src/Components/UnlockConditions/CUnlockSP.cs:26-74 | OpenTaiko/src/Components/UnlockConditions/CUnlockSP.cs:76-104 — These 6 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 6 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 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:57 — OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:57-125 | OpenTaiko/src/Lua/3D/GpuRasterizer.LightGrid.cs:25-85 | OpenTaiko/src/Lua/3D/GpuRasterizer.Reflections.cs:27-71 | OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:71-89 | OpenTaiko/src/Lua/3D/GpuRaytracer.cs:346-355 | OpenTaiko/src/Lua/3D/GpuRaytracer.cs:411-459 — These 6 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 6 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 6 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:175 — OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:175-617 | OpenTaiko/src/Stages/CActFIFOBlack.cs:16-29 | OpenTaiko/src/Stages/CActFIFOResult.cs:15-37 | OpenTaiko/src/Stages/CActFIFOWhite.cs:15-28 — 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) FDK/src/00.Common/CCounter.cs:130 — FDK/src/00.Common/CCounter.cs:130-147 | FDK/src/00.Common/CCounter.cs:153-170 | FDK/src/00.Common/CCounter.cs:190-207 | FDK/src/00.Common/CCounter.cs:213-230 — 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 copies of one member (3 members, 6+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 6+ corresponding lines) OpenTaiko/src/Lua/3D/GpuRasterizer.Merge.cs:173 — OpenTaiko/src/Lua/3D/GpuRasterizer.Merge.cs:173-178 | OpenTaiko/src/Lua/3D/GpuRasterizer.Merge.cs:179-185 | OpenTaiko/src/Lua/3D/GpuRasterizer.Merge.cs:186-192 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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, 6+ corresponding lines) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:259 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:259-264 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:266-273 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:275-282 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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 (24 corresponding lines) · ×2
  • Edited copy of a member (24 corresponding lines) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:404 — OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:404-427 | OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:446-490 — 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.
  • Edited copy of a member (24 corresponding lines) OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:33 — OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:33-56 | OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:242-265 — 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 copy of a member (18 corresponding lines) · ×2
  • Edited copy of a member (18 corresponding lines) FDK/src/01.Framework/Rendering/ShaderHelper.cs:24 — FDK/src/01.Framework/Rendering/ShaderHelper.cs:24-44 | FDK/src/01.Framework/Rendering/ShaderHelper.cs:62-79 — These two members are one piece of code written twice and then edited apart: 18 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 (18 corresponding lines) OpenTaiko/src/Components/CUnlockCondition.cs:68 — OpenTaiko/src/Components/CUnlockCondition.cs:68-85 | OpenTaiko/src/Components/CUnlockCondition.cs:87-104 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×2
  • Duplicated block (24 lines × 2) FDK/src/04.Graphics/CTexture.cs:1408 — FDK/src/04.Graphics/CTexture.cs:1408-1431 | FDK/src/04.Graphics/CTexture.cs:1597-1620 — 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 `FDK/src/04.Graphics/CTexture.cs:1408` 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 (24 lines × 2) FDK/src/03.Sound/CSoundDeviceASIO.cs:49 — FDK/src/03.Sound/CSoundDeviceASIO.cs:49-72 | FDK/src/03.Sound/CSoundDeviceBASS.cs:23-46 — 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.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×2
  • Duplicated block (13 lines × 2) OpenTaiko/src/Songs/CSongManager.cs:415 — OpenTaiko/src/Songs/CSongManager.cs:415-427 | OpenTaiko/src/Songs/CSongManager.cs:1024-1036 — 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 `OpenTaiko/src/Songs/CSongManager.cs:415` 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. 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) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3373 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3373-3385 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3389-3401 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3373` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×2
  • Duplicated block (10 lines × 3) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:89 — OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:89-98 | OpenTaiko/src/Lua/Classes/LuaText.cs:20-29 | OpenTaiko/src/Lua/Classes/LuaText.cs:38-47 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
  • Duplicated block (10 lines × 3) OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:298 — OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:298-308 | OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:317-326 | OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:335-344 — 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 `OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:298` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×2
  • Duplicated block (7 lines × 3) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:65 — OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:65-71 | OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:65-71 | OpenTaiko/src/Components/UnlockConditions/CUnlockSP.cs:76-82 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:65` 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 × 3) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:221 — OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:221-227 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:257-263 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:315-321 — 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 `OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:221` 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.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×2
  • Outbound HTTP without resilience OpenTaiko/src/Stages/12.OnlineLounge/API.cs:106 — `new HttpClient()` builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller — a build step, a CLI run, a UI thread — with no way out.
  • Outbound HTTP without resilience OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:540 — `new System.Net.Http.HttpClient()` builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller — a build step, a CLI run, a UI thread — with no way out.
P8 · Schema migrations · Schema created by a CREATE TABLE statement outside the migrations · ×2
  • Schema created by a CREATE TABLE statement outside the migrations REDACTED:112 — 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:232 — 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.
X1 · Async correctness · Sync-over-async (deadlock risk) through `.Result` · ×2
  • Sync-over-async (deadlock risk) through `.Result` OpenTaiko/src/Lua/3D/GltfModel.cs:805 — Reading `.Result` of a task that has not completed blocks this thread until it does — the same block as `.Wait()`: under a synchronization context (Blazor, a UI thread, classic ASP.NET) it deadlocks, and on the thread pool it parks a thread for as long as the work runs. `await` the task instead (make the caller `async`); where a synchronous entry point must stay, keep the block in ONE documented bridge with a timeout.
  • Sync-over-async (deadlock risk) through `.Result` FDK/src/02.Input/CInputManager.cs:79 — Reading `.Result` of a task that has not completed blocks this thread until it does — the same block as `.Wait()`: under a synchronization context (Blazor, a UI thread, classic ASP.NET) it deadlocks, and on the thread pool it parks a thread for as long as the work runs. `await` the task instead (make the caller `async`); where a synchronous entry point must stay, keep the block in ONE documented bridge with a timeout.
X18 · Disposal-pattern correctness · Finalizer on a type that owns no unmanaged resource · ×2
  • Finalizer on a type that owns no unmanaged resource OpenTaiko/src/Songs/CTja.cs:203 — `CWAV` declares a finalizer (line 203), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization.
  • Finalizer on a type that owns no unmanaged resource FDK/src/03.Sound/CSoundDeviceASIO.cs:408 — `CSoundDeviceASIO` declares a finalizer (line 408), but nothing in the type is unmanaged: no `IntPtr`/`UIntPtr` or pointer field, no `SafeHandle`, no `HandleRef`, no `extern`/`DllImport` member and no `Marshal`/`GCHandle`/`NativeMemory` use. A finalizer can only release what the garbage collector cannot, so on a purely-managed type it releases nothing and costs something: every instance is put on the finalizer queue, survives at least one extra collection, and is then finalized on a thread that is NOT the disposing one — where the managed objects it touches may already have been finalized themselves. Delete the finalizer (and the `GC.SuppressFinalize` that exists to defuse it); if a handle is added later, wrap it in a `SafeHandle`, which brings its own correct finalization.
D1 · Cyclomatic Complexity · CSkin.tLoadFromString (cyclomatic 1318) · ×1
  • CSkin.tLoadFromString (cyclomatic 1318) OpenTaiko/src/Common/CSkin.cs:1121 — CSkin.tLoadFromString has cyclomatic complexity 1318 (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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tProgressDraw_Chip (cyclomatic 391) · ×1
  • CStagePlayScreenCommon.tProgressDraw_Chip (cyclomatic 391) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2837 — CStagePlayScreenCommon.tProgressDraw_Chip has cyclomatic complexity 391 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CTja.ParseCommand (cyclomatic 172) · ×1
  • CTja.ParseCommand (cyclomatic 172) OpenTaiko/src/Songs/CTja.cs:1835 — CTja.ParseCommand has cyclomatic complexity 172 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GltfModel.LoadUncached (cyclomatic 148) · ×1
  • GltfModel.LoadUncached (cyclomatic 148) OpenTaiko/src/Lua/3D/GltfModel.cs:869 — GltfModel.LoadUncached has cyclomatic complexity 148 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dan_Cert.UpdateReachStatus (cyclomatic 121) · ×1
  • Dan_Cert.UpdateReachStatus (cyclomatic 121) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:320 — Dan_Cert.UpdateReachStatus has cyclomatic complexity 121 (threshold 15). Of this number, 95 points are the body's own statements and 26 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · OpenTaiko.Draw (cyclomatic 106) · ×1
  • OpenTaiko.Draw (cyclomatic 106) OpenTaiko/src/Common/OpenTaiko.cs:689 — OpenTaiko.Draw has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CTja.ParseGlobalHeader (cyclomatic 101) · ×1
  • CTja.ParseGlobalHeader (cyclomatic 101) OpenTaiko/src/Songs/CTja.cs:3778 — CTja.ParseGlobalHeader has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayDrumsScreen.Draw (cyclomatic 101) · ×1
  • CStagePlayDrumsScreen.Draw (cyclomatic 101) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:372 — CStagePlayDrumsScreen.Draw has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CTja.tProcessAllText (cyclomatic 100) · ×1
  • CTja.tProcessAllText (cyclomatic 100) OpenTaiko/src/Songs/CTja.cs:1113 — CTja.tProcessAllText has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dan_Cert.DrawExam (cyclomatic 98) · ×1
  • Dan_Cert.DrawExam (cyclomatic 98) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:796 — Dan_Cert.DrawExam has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2Evaluator.Evaluate (cyclomatic 97) · ×1
  • Aup2Evaluator.Evaluate (cyclomatic 97) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:573 — Aup2Evaluator.Evaluate has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStageSongLoading.Draw (cyclomatic 94) · ×1
  • CStageSongLoading.Draw (cyclomatic 94) OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:175 — CStageSongLoading.Draw has cyclomatic complexity 94 (threshold 15). Of this number, 86 points are the body's own statements and 8 belong to 6 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.
D1 · Cyclomatic Complexity · CStageResult.Activate (cyclomatic 91) · ×1
  • CStageResult.Activate (cyclomatic 91) OpenTaiko/src/Stages/08.Result/CStageResult.cs:247 — CStageResult.Activate has cyclomatic complexity 91 (threshold 15). Of this number, 90 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.
D1 · Cyclomatic Complexity · CConfigIni.ProcessSystemSection (cyclomatic 86) · ×1
  • CConfigIni.ProcessSystemSection (cyclomatic 86) OpenTaiko/src/Common/CConfigIni.cs:2068 — CConfigIni.ProcessSystemSection has cyclomatic complexity 86 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · VTTParser.ParseVTTFile (cyclomatic 81) · ×1
  • VTTParser.ParseVTTFile (cyclomatic 81) OpenTaiko/src/Songs/VTTParser.cs:49 — VTTParser.ParseVTTFile has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActImplMtaiko.Draw (cyclomatic 80) · ×1
  • CActImplMtaiko.Draw (cyclomatic 80) OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:49 — CActImplMtaiko.Draw has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActImplGauge.Draw (cyclomatic 73) · ×1
  • CActImplGauge.Draw (cyclomatic 73) OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs:76 — CActImplGauge.Draw has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CScoreIni_Importer.ImportScoreInisToSavesDb3 (cyclomatic 72) · ×1
  • CScoreIni_Importer.ImportScoreInisToSavesDb3 (cyclomatic 72) REDACTED:10 — CScoreIni_Importer.ImportScoreInisToSavesDb3 has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CTja.tSenotes_Core_V2 (cyclomatic 72) · ×1
  • CTja.tSenotes_Core_V2 (cyclomatic 72) OpenTaiko/src/Songs/CTja.cs:4247 — CTja.tSenotes_Core_V2 has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CConfigIni.tExport (cyclomatic 70) · ×1
  • CConfigIni.tExport (cyclomatic 70) OpenTaiko/src/Common/CConfigIni.cs:1104 — CConfigIni.tExport has cyclomatic complexity 70 (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: CConfigIni.ProcessPlayOptionSection (cyclomatic 73) 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.
D1 · Cyclomatic Complexity · CTja.InsertNoteAtDefCursor (cyclomatic 70) · ×1
  • CTja.InsertNoteAtDefCursor (cyclomatic 70) OpenTaiko/src/Songs/CTja.cs:3331 — CTja.InsertNoteAtDefCursor has cyclomatic complexity 70 (threshold 15). Of this number, 69 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.
D1 · Cyclomatic Complexity · CActImplLaneTaiko.Draw (cyclomatic 70) · ×1
  • CActImplLaneTaiko.Draw (cyclomatic 70) OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:57 — CActImplLaneTaiko.Draw 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.
D1 · Cyclomatic Complexity · LuaDanBuildFunc.BuildDanCtja (cyclomatic 65) · ×1
  • LuaDanBuildFunc.BuildDanCtja (cyclomatic 65) OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs:143 — LuaDanBuildFunc.BuildDanCtja has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStageOnlineLounge.Draw (cyclomatic 65) · ×1
  • CStageOnlineLounge.Draw (cyclomatic 65) OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:145 — CStageOnlineLounge.Draw has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CSongManager.tSongSearchListCreate (cyclomatic 62) · ×1
  • CSongManager.tSongSearchListCreate (cyclomatic 62) OpenTaiko/src/Songs/CSongManager.cs:297 — CSongManager.tSongSearchListCreate has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Builder.Build (cyclomatic 61) · ×1
  • Builder.Build (cyclomatic 61) OpenTaiko/src/Lua/3D/Rasterizer.cs:327 — Builder.Build has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CTextShaper.Shape (cyclomatic 61) · ×1
  • CTextShaper.Shape (cyclomatic 61) FDK/src/04.Graphics/TextRenderer/CTextShaper.cs:109 — CTextShaper.Shape has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CTExprVariables.ResolveVariable (cyclomatic 59) · ×1
  • CTExprVariables.ResolveVariable (cyclomatic 59) OpenTaiko/src/Songs/TJA/TriggersCounters/CTExprVariables.cs:3 — CTExprVariables.ResolveVariable has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tChipHitProcess (cyclomatic 58) · ×1
  • CStagePlayScreenCommon.tChipHitProcess (cyclomatic 58) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1635 — CStagePlayScreenCommon.tChipHitProcess has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ImGuiDebugWindow.Stage (cyclomatic 57) · ×1
  • ImGuiDebugWindow.Stage (cyclomatic 57) OpenTaiko/src/Common/ImGuiDebugWindow.cs:359 — ImGuiDebugWindow.Stage has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.AddScore (cyclomatic 56) · ×1
  • CStagePlayScreenCommon.AddScore (cyclomatic 56) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2102 — CStagePlayScreenCommon.AddScore has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayDrumsScreen.tProgressDraw_Chip_TaikoRoll (cyclomatic 55) · ×1
  • CStagePlayDrumsScreen.tProgressDraw_Chip_TaikoRoll (cyclomatic 55) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1252 — CStagePlayDrumsScreen.tProgressDraw_Chip_TaikoRoll has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActImplScore.Draw (cyclomatic 53) · ×1
  • CActImplScore.Draw (cyclomatic 53) OpenTaiko/src/Stages/07.Game/Taiko/CActImplScore.cs:16 — CActImplScore.Draw has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RtScene.Update (cyclomatic 52) · ×1
  • RtScene.Update (cyclomatic 52) OpenTaiko/src/Lua/3D/RtScene.cs:150 — RtScene.Update has cyclomatic complexity 52 (threshold 15). Of this number, 50 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.GetChipToJudgeIgnoringRollBody (cyclomatic 52) · ×1
  • CStagePlayScreenCommon.GetChipToJudgeIgnoringRollBody (cyclomatic 52) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2284 — CStagePlayScreenCommon.GetChipToJudgeIgnoringRollBody has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.UpdateJudgeCount (cyclomatic 51) · ×1
  • CStagePlayScreenCommon.UpdateJudgeCount (cyclomatic 51) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1898 — CStagePlayScreenCommon.UpdateJudgeCount has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActImplFireworks.Draw (cyclomatic 51) · ×1
  • CActImplFireworks.Draw (cyclomatic 51) OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:134 — CActImplFireworks.Draw has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LuaNetworking.P2PJoin (cyclomatic 50) · ×1
  • LuaNetworking.P2PJoin (cyclomatic 50) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:856 — LuaNetworking.P2PJoin has cyclomatic complexity 50 (threshold 15). Of this number, 41 points are the body's own statements and 9 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.
D1 · Cyclomatic Complexity · Rasterizer.RasterTexBand (cyclomatic 49) · ×1
  • Rasterizer.RasterTexBand (cyclomatic 49) OpenTaiko/src/Lua/3D/Rasterizer.cs:975 — Rasterizer.RasterTexBand has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActImplTrainingMode.Draw (cyclomatic 49) · ×1
  • CActImplTrainingMode.Draw (cyclomatic 49) OpenTaiko/src/Stages/07.Game/Taiko/CActImplTrainingMode.cs:86 — CActImplTrainingMode.Draw has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActPlayComboCommon.tComboDisplay_Taiko (cyclomatic 48) · ×1
  • CActPlayComboCommon.tComboDisplay_Taiko (cyclomatic 48) OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:308 — CActPlayComboCommon.tComboDisplay_Taiko has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2ScriptFile.ReadSetting (cyclomatic 47) · ×1
  • Aup2ScriptFile.ReadSetting (cyclomatic 47) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptFile.cs:143 — Aup2ScriptFile.ReadSetting has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CDTXStyleExtractor.GetRanker (cyclomatic 46) · ×1
  • CDTXStyleExtractor.GetRanker (cyclomatic 46) OpenTaiko/src/Songs/CDTXStyleExtractor.cs:77 — CDTXStyleExtractor.GetRanker has cyclomatic 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 2 function literals inside it that branch (lines 106, 78). 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.
D1 · Cyclomatic Complexity · Aup2Renderer.Materialize (cyclomatic 43) · ×1
  • Aup2Renderer.Materialize (cyclomatic 43) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:199 — Aup2Renderer.Materialize has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tKeyInput (cyclomatic 43) · ×1
  • CStagePlayScreenCommon.tKeyInput (cyclomatic 43) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2432 — CStagePlayScreenCommon.tKeyInput has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStageResult.Draw (cyclomatic 42) · ×1
  • CStageResult.Draw (cyclomatic 42) OpenTaiko/src/Stages/08.Result/CStageResult.cs:842 — CStageResult.Draw has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RtScene.UpdateTextures (cyclomatic 41) · ×1
  • RtScene.UpdateTextures (cyclomatic 41) OpenTaiko/src/Lua/3D/RtScene.cs:457 — RtScene.UpdateTextures has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2FiltersMotion.Emit (cyclomatic 41) · ×1
  • Aup2FiltersMotion.Emit (cyclomatic 41) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:305 — Aup2FiltersMotion.Emit has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LuaNetworking.HostHandshake (cyclomatic 41) · ×1
  • LuaNetworking.HostHandshake (cyclomatic 41) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:489 — LuaNetworking.HostHandshake has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ImGuiDebugWindow.Inputs (cyclomatic 39) · ×1
  • ImGuiDebugWindow.Inputs (cyclomatic 39) OpenTaiko/src/Common/ImGuiDebugWindow.cs:111 — ImGuiDebugWindow.Inputs 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.
D1 · Cyclomatic Complexity · RtScene.Build (cyclomatic 39) · ×1
  • RtScene.Build (cyclomatic 39) OpenTaiko/src/Lua/3D/RtScene.cs:783 — RtScene.Build 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.
D1 · Cyclomatic Complexity · CTja.tRandomizeTaikoChips (cyclomatic 39) · ×1
  • CTja.tRandomizeTaikoChips (cyclomatic 39) OpenTaiko/src/Songs/CTja.cs:850 — CTja.tRandomizeTaikoChips has cyclomatic complexity 39 (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.
D1 · Cyclomatic Complexity · Rasterizer.Render (cyclomatic 37) · ×1
  • Rasterizer.Render (cyclomatic 37) OpenTaiko/src/Lua/3D/Rasterizer.cs:541 — Rasterizer.Render has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body's own statements and 2 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.ActivateSteps (cyclomatic 37) · ×1
  • CStagePlayScreenCommon.ActivateSteps (cyclomatic 37) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:67 — CStagePlayScreenCommon.ActivateSteps has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GltfModel.PoseJoints (cyclomatic 36) · ×1
  • GltfModel.PoseJoints (cyclomatic 36) OpenTaiko/src/Lua/3D/GltfModel.cs:402 — GltfModel.PoseJoints has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActPlayGaugeCommon.Init (cyclomatic 36) · ×1
  • CActPlayGaugeCommon.Init (cyclomatic 36) OpenTaiko/src/Stages/07.Game/CActPlayGaugeCommon.cs:64 — CActPlayGaugeCommon.Init has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CActImplClearAnimation.Start (cyclomatic 36) · ×1
  • CActImplClearAnimation.Start (cyclomatic 36) OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs:15 — CActImplClearAnimation.Start has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RtScene.BuildBlock (cyclomatic 35) · ×1
  • RtScene.BuildBlock (cyclomatic 35) OpenTaiko/src/Lua/3D/RtScene.cs:590 — RtScene.BuildBlock 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.UpdateGauge (cyclomatic 35) · ×1
  • CStagePlayScreenCommon.UpdateGauge (cyclomatic 35) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1790 — CStagePlayScreenCommon.UpdateGauge 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.
D1 · Cyclomatic Complexity · CSkiaSharpTextRenderer.Tokenize (cyclomatic 35) · ×1
  • CSkiaSharpTextRenderer.Tokenize (cyclomatic 35) FDK/src/04.Graphics/TextRenderer/CSkiaSharpTextRenderer.cs:122 — CSkiaSharpTextRenderer.Tokenize 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.
D1 · Cyclomatic Complexity · LuaSongList.GatherTree (cyclomatic 34) · ×1
  • LuaSongList.GatherTree (cyclomatic 34) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:99 — LuaSongList.GatherTree has cyclomatic complexity 34 (threshold 15). Of this number, 33 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.
D1 · Cyclomatic Complexity · LuaNetworking.JoinRoom (cyclomatic 34) · ×1
  • LuaNetworking.JoinRoom (cyclomatic 34) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:231 — LuaNetworking.JoinRoom has cyclomatic complexity 34 (threshold 15). Of this number, 21 points are the body's own statements and 13 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CTcm.Parse (cyclomatic 34) · ×1
  • CTcm.Parse (cyclomatic 34) OpenTaiko/src/Songs/CTcm.cs:218 — CTcm.Parse 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.
D1 · Cyclomatic Complexity · CActImplBackground.Draw (cyclomatic 34) · ×1
  • CActImplBackground.Draw (cyclomatic 34) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:268 — CActImplBackground.Draw 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.
D1 · Cyclomatic Complexity · CActImplDancer.Draw (cyclomatic 34) · ×1
  • CActImplDancer.Draw (cyclomatic 34) OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:130 — CActImplDancer.Draw 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.
D1 · Cyclomatic Complexity · CStagePlayDrumsScreen.tTotalControlMethod (cyclomatic 34) · ×1
  • CStagePlayDrumsScreen.tTotalControlMethod (cyclomatic 34) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1527 — CStagePlayDrumsScreen.tTotalControlMethod 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.
D1 · Cyclomatic Complexity · AngleContext.AngleContext.ctor (cyclomatic 34) · ×1
  • AngleContext.AngleContext.ctor (cyclomatic 34) FDK/src/01.Framework/Rendering/Angle/AngleContext.cs:27 — AngleContext.AngleContext.ctor has cyclomatic complexity 34 (threshold 15). Of this number, 31 points are the body's own statements and 3 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.
D1 · Cyclomatic Complexity · Lua3DScene.ApplyOutline (cyclomatic 33) · ×1
  • Lua3DScene.ApplyOutline (cyclomatic 33) OpenTaiko/src/Lua/3D/Lua3DScene.Display.cs:103 — Lua3DScene.ApplyOutline has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PhysicsWorld.Step (cyclomatic 33) · ×1
  • PhysicsWorld.Step (cyclomatic 33) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:359 — PhysicsWorld.Step has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2ScriptLibrary.Own (cyclomatic 33) · ×1
  • Aup2ScriptLibrary.Own (cyclomatic 33) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1046 — Aup2ScriptLibrary.Own has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.ProcessRollEnd (cyclomatic 33) · ×1
  • CStagePlayScreenCommon.ProcessRollEnd (cyclomatic 33) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4062 — CStagePlayScreenCommon.ProcessRollEnd has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActImplLaneTaiko.GoGoFlame (cyclomatic 33) · ×1
  • CActImplLaneTaiko.GoGoFlame (cyclomatic 33) OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:445 — CActImplLaneTaiko.GoGoFlame has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TextureLoader.LoadTexture (cyclomatic 32) · ×1
  • TextureLoader.LoadTexture (cyclomatic 32) OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:257 — TextureLoader.LoadTexture has cyclomatic complexity 32 (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.
D1 · Cyclomatic Complexity · CSoundDeviceWASAPI.CSoundDeviceWASAPI.ctor (cyclomatic 32) · ×1
  • CSoundDeviceWASAPI.CSoundDeviceWASAPI.ctor (cyclomatic 32) FDK/src/03.Sound/CSoundDeviceWASAPI.cs:113 — CSoundDeviceWASAPI.CSoundDeviceWASAPI.ctor has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ImGuiDebugWindow.Profile (cyclomatic 30) · ×1
  • ImGuiDebugWindow.Profile (cyclomatic 30) OpenTaiko/src/Common/ImGuiDebugWindow.cs:206 — ImGuiDebugWindow.Profile 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.AutorollBalloon (cyclomatic 30) · ×1
  • CStagePlayScreenCommon.AutorollBalloon (cyclomatic 30) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1361 — CStagePlayScreenCommon.AutorollBalloon has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tValueInitialize (cyclomatic 30) · ×1
  • CStagePlayScreenCommon.tValueInitialize (cyclomatic 30) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4583 — CStagePlayScreenCommon.tValueInitialize has cyclomatic complexity 30 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 29) · ×1
  • Program.Main (cyclomatic 29) OpenTaiko/src/Common/Program.cs:76 — Program.Main has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GpuRasterizer.BuildParticles (cyclomatic 29) · ×1
  • GpuRasterizer.BuildParticles (cyclomatic 29) OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:33 — GpuRasterizer.BuildParticles has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GpuRasterizer.BuildPieces (cyclomatic 29) · ×1
  • GpuRasterizer.BuildPieces (cyclomatic 29) OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:30 — GpuRasterizer.BuildPieces has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Rasterizer.RasterFlatBand (cyclomatic 29) · ×1
  • Rasterizer.RasterFlatBand (cyclomatic 29) OpenTaiko/src/Lua/3D/Rasterizer.cs:902 — Rasterizer.RasterFlatBand has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2ScriptLibrary.Load (cyclomatic 29) · ×1
  • Aup2ScriptLibrary.Load (cyclomatic 29) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:823 — Aup2ScriptLibrary.Load has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2ScriptLibrary.GetOption (cyclomatic 29) · ×1
  • Aup2ScriptLibrary.GetOption (cyclomatic 29) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:972 — Aup2ScriptLibrary.GetOption has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LuaHeightmapFunc.BuildTerrain (cyclomatic 29) · ×1
  • LuaHeightmapFunc.BuildTerrain (cyclomatic 29) OpenTaiko/src/Lua/Classes/LuaHeightmap.cs:86 — LuaHeightmapFunc.BuildTerrain has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LuaNetworking.OnJoinerOffer (cyclomatic 29) · ×1
  • LuaNetworking.OnJoinerOffer (cyclomatic 29) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:765 — LuaNetworking.OnJoinerOffer has cyclomatic complexity 29 (threshold 15). Of this number, 19 points are the body's own statements and 10 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.
D1 · Cyclomatic Complexity · CTja.ParseQueryableCourseMetadata (cyclomatic 29) · ×1
  • CTja.ParseQueryableCourseMetadata (cyclomatic 29) OpenTaiko/src/Songs/CTja.cs:3570 — CTja.ParseQueryableCourseMetadata has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body's own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CActImplClearAnimation.Draw (cyclomatic 29) · ×1
  • CActImplClearAnimation.Draw (cyclomatic 29) OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs:317 — CActImplClearAnimation.Draw has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Dan_Cert.Draw (cyclomatic 29) · ×1
  • Dan_Cert.Draw (cyclomatic 29) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:643 — Dan_Cert.Draw has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GpuRasterizer.BuildLightGrid (cyclomatic 28) · ×1
  • GpuRasterizer.BuildLightGrid (cyclomatic 28) OpenTaiko/src/Lua/3D/GpuRasterizer.LightGrid.cs:25 — GpuRasterizer.BuildLightGrid has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2Renderer.Compose (cyclomatic 28) · ×1
  • Aup2Renderer.Compose (cyclomatic 28) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:303 — Aup2Renderer.Compose has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2ScriptLibrary.Poly (cyclomatic 28) · ×1
  • Aup2ScriptLibrary.Poly (cyclomatic 28) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:727 — Aup2ScriptLibrary.Poly has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2TextRaster.Tag (cyclomatic 28) · ×1
  • Aup2TextRaster.Tag (cyclomatic 28) OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:189 — Aup2TextRaster.Tag has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LuaAviUtl2Project.SyncMedia (cyclomatic 28) · ×1
  • LuaAviUtl2Project.SyncMedia (cyclomatic 28) OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:476 — LuaAviUtl2Project.SyncMedia has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStageConfig.Draw (cyclomatic 28) · ×1
  • CStageConfig.Draw (cyclomatic 28) OpenTaiko/src/Stages/04.Config/CStageConfig.cs:153 — CStageConfig.Draw has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.ReduceMultiplayerNotes (cyclomatic 28) · ×1
  • CStagePlayScreenCommon.ReduceMultiplayerNotes (cyclomatic 28) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:339 — CStagePlayScreenCommon.ReduceMultiplayerNotes has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tPlayPositionChange (cyclomatic 28) · ×1
  • CStagePlayScreenCommon.tPlayPositionChange (cyclomatic 28) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4790 — CStagePlayScreenCommon.tPlayPositionChange has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dan_Cert.Update (cyclomatic 28) · ×1
  • Dan_Cert.Update (cyclomatic 28) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:194 — Dan_Cert.Update has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GltfModel.Register (cyclomatic 27) · ×1
  • GltfModel.Register (cyclomatic 27) OpenTaiko/src/Lua/3D/GltfModel.cs:94 — GltfModel.Register 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.
D1 · Cyclomatic Complexity · GpuRasterizer.RebuildMerged (cyclomatic 27) · ×1
  • GpuRasterizer.RebuildMerged (cyclomatic 27) OpenTaiko/src/Lua/3D/GpuRasterizer.Merge.cs:60 — GpuRasterizer.RebuildMerged 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.
D1 · Cyclomatic Complexity · GpuRasterizer.GatherObjects (cyclomatic 27) · ×1
  • GpuRasterizer.GatherObjects (cyclomatic 27) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:243 — GpuRasterizer.GatherObjects 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.
D1 · Cyclomatic Complexity · ObjModel.LoadUncached (cyclomatic 27) · ×1
  • ObjModel.LoadUncached (cyclomatic 27) OpenTaiko/src/Lua/3D/ObjModel.cs:95 — ObjModel.LoadUncached 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.
D1 · Cyclomatic Complexity · Raytracer.Trace (cyclomatic 27) · ×1
  • Raytracer.Trace (cyclomatic 27) OpenTaiko/src/Lua/3D/Raytracer.cs:153 — Raytracer.Trace 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.
D1 · Cyclomatic Complexity · RtScene.AnyTri (cyclomatic 27) · ×1
  • RtScene.AnyTri (cyclomatic 27) OpenTaiko/src/Lua/3D/RtScene.cs:385 — RtScene.AnyTri 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.
D1 · Cyclomatic Complexity · Aup2Renderer.Draw (cyclomatic 27) · ×1
  • Aup2Renderer.Draw (cyclomatic 27) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:773 — Aup2Renderer.Draw 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.
D1 · Cyclomatic Complexity · LuaNetworking.ClientHandshake (cyclomatic 27) · ×1
  • LuaNetworking.ClientHandshake (cyclomatic 27) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1018 — LuaNetworking.ClientHandshake has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CBoxDef.tLoad (cyclomatic 27) · ×1
  • CBoxDef.tLoad (cyclomatic 27) OpenTaiko/src/Songs/CBoxDef.cs:59 — CBoxDef.tLoad 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.
D1 · Cyclomatic Complexity · CConfigOptionBuilder.BuildThemeOptions (cyclomatic 27) · ×1
  • CConfigOptionBuilder.BuildThemeOptions (cyclomatic 27) OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:307 — CConfigOptionBuilder.BuildThemeOptions has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · AIHitPlanner.PlanNote (cyclomatic 27) · ×1
  • AIHitPlanner.PlanNote (cyclomatic 27) OpenTaiko/src/Stages/07.Game/AIBattle/AIHitPlanner.cs:211 — AIHitPlanner.PlanNote 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.
D1 · Cyclomatic Complexity · CStagePlayDrumsScreen.tProgressDraw_Chip_Taiko (cyclomatic 27) · ×1
  • CStagePlayDrumsScreen.tProgressDraw_Chip_Taiko (cyclomatic 27) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1178 — CStagePlayDrumsScreen.tProgressDraw_Chip_Taiko 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.
D1 · Cyclomatic Complexity · NotesManager.DisplayRoll (cyclomatic 27) · ×1
  • NotesManager.DisplayRoll (cyclomatic 27) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:568 — NotesManager.DisplayRoll 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.
D1 · Cyclomatic Complexity · BestPlayRecords.tGenerateBestPlayStats (cyclomatic 26) · ×1
  • BestPlayRecords.tGenerateBestPlayStats (cyclomatic 26) OpenTaiko/src/Common/BestPlayRecords.cs:148 — BestPlayRecords.tGenerateBestPlayStats 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.
D1 · Cyclomatic Complexity · DBNameplateUnlockables.tLoadPack (cyclomatic 26) · ×1
  • DBNameplateUnlockables.tLoadPack (cyclomatic 26) OpenTaiko/src/Databases/DBNameplateUnlockables.cs:158 — DBNameplateUnlockables.tLoadPack 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.
D1 · Cyclomatic Complexity · GpuRasterizer.EnsureGrass (cyclomatic 26) · ×1
  • GpuRasterizer.EnsureGrass (cyclomatic 26) OpenTaiko/src/Lua/3D/GpuRasterizer.Grass.cs:25 — GpuRasterizer.EnsureGrass 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.
D1 · Cyclomatic Complexity · Aup2ScriptLibrary.ClearBuffer (cyclomatic 26) · ×1
  • Aup2ScriptLibrary.ClearBuffer (cyclomatic 26) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1278 — Aup2ScriptLibrary.ClearBuffer 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.
D1 · Cyclomatic Complexity · Aup2TextRaster.Layout (cyclomatic 26) · ×1
  • Aup2TextRaster.Layout (cyclomatic 26) OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:99 — Aup2TextRaster.Layout 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.
D1 · Cyclomatic Complexity · Aup2Track.Parse (cyclomatic 26) · ×1
  • Aup2Track.Parse (cyclomatic 26) OpenTaiko/src/Lua/AviUtl2/Aup2Track.cs:39 — Aup2Track.Parse 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.
D1 · Cyclomatic Complexity · OnlinePlaySync.Tick (cyclomatic 26) · ×1
  • OnlinePlaySync.Tick (cyclomatic 26) OpenTaiko/src/Lua/Networking/OnlinePlaySync.cs:88 — OnlinePlaySync.Tick 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.
D1 · Cyclomatic Complexity · CTja.tInput_LineParseChart_V4 (cyclomatic 26) · ×1
  • CTja.tInput_LineParseChart_V4 (cyclomatic 26) OpenTaiko/src/Songs/CTja.cs:3137 — CTja.tInput_LineParseChart_V4 has cyclomatic complexity 26 (threshold 15). Of this number, 14 points are the body's own statements and 12 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStageStartup.Draw (cyclomatic 26) · ×1
  • CStageStartup.Draw (cyclomatic 26) OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs:63 — CStageStartup.Draw 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.
D1 · Cyclomatic Complexity · CActPlayComboCommon.Draw (cyclomatic 26) · ×1
  • CActPlayComboCommon.Draw (cyclomatic 26) OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:553 — CActPlayComboCommon.Draw 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tCheckBgmDrift (cyclomatic 26) · ×1
  • CStagePlayScreenCommon.tCheckBgmDrift (cyclomatic 26) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2570 — CStagePlayScreenCommon.tCheckBgmDrift 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.
D1 · Cyclomatic Complexity · CActImplComboBalloon.Draw (cyclomatic 26) · ×1
  • CActImplComboBalloon.Draw (cyclomatic 26) OpenTaiko/src/Stages/07.Game/Taiko/CActImplComboBalloon.cs:52 — CActImplComboBalloon.Draw 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.
D1 · Cyclomatic Complexity · NotesManager.DisplayNote (cyclomatic 26) · ×1
  • NotesManager.DisplayNote (cyclomatic 26) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:514 — NotesManager.DisplayNote 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.
D1 · Cyclomatic Complexity · OpenTaiko.tExitProcess (cyclomatic 25) · ×1
  • OpenTaiko.tExitProcess (cyclomatic 25) OpenTaiko/src/Common/OpenTaiko.cs:1823 — OpenTaiko.tExitProcess 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.
D1 · Cyclomatic Complexity · GltfModel.FitQuat (cyclomatic 25) · ×1
  • GltfModel.FitQuat (cyclomatic 25) OpenTaiko/src/Lua/3D/GltfModel.cs:291 — GltfModel.FitQuat has cyclomatic complexity 25 (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.
D1 · Cyclomatic Complexity · GltfModel.EnsureJoints (cyclomatic 25) · ×1
  • GltfModel.EnsureJoints (cyclomatic 25) OpenTaiko/src/Lua/3D/GltfModel.cs:339 — GltfModel.EnsureJoints has cyclomatic complexity 25 (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.
D1 · Cyclomatic Complexity · GpuRasterizer.GatherCasters (cyclomatic 25) · ×1
  • GpuRasterizer.GatherCasters (cyclomatic 25) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:180 — GpuRasterizer.GatherCasters 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.
D1 · Cyclomatic Complexity · Aup2ScriptFile.Portable (cyclomatic 25) · ×1
  • Aup2ScriptFile.Portable (cyclomatic 25) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptFile.cs:319 — Aup2ScriptFile.Portable 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.
D1 · Cyclomatic Complexity · TextureLoader.LoadNotesSkinTexturesCore (cyclomatic 25) · ×1
  • TextureLoader.LoadNotesSkinTexturesCore (cyclomatic 25) OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:772 — TextureLoader.LoadNotesSkinTexturesCore has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tBranchProcess (cyclomatic 25) · ×1
  • CStagePlayScreenCommon.tBranchProcess (cyclomatic 25) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4383 — CStagePlayScreenCommon.tBranchProcess 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.
D1 · Cyclomatic Complexity · CommandLineArgs.Parse (cyclomatic 24) · ×1
  • CommandLineArgs.Parse (cyclomatic 24) OpenTaiko/src/Common/CommandLineArgs.cs:39 — CommandLineArgs.Parse has cyclomatic complexity 24 (threshold 15). Of this number, 23 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.
D1 · Cyclomatic Complexity · GlyphTextLayout.Wrap (cyclomatic 24) · ×1
  • GlyphTextLayout.Wrap (cyclomatic 24) OpenTaiko/src/Common/GlyphTextLayout.cs:88 — GlyphTextLayout.Wrap 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.
D1 · Cyclomatic Complexity · GpuRasterizer.BuildSprites (cyclomatic 24) · ×1
  • GpuRasterizer.BuildSprites (cyclomatic 24) OpenTaiko/src/Lua/3D/GpuRasterizer.Sprites.cs:13 — GpuRasterizer.BuildSprites 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.
D1 · Cyclomatic Complexity · Rasterizer.RenderParticleBand (cyclomatic 24) · ×1
  • Rasterizer.RenderParticleBand (cyclomatic 24) OpenTaiko/src/Lua/3D/Rasterizer.cs:694 — Rasterizer.RenderParticleBand 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. Note what this body is, though: it works in explicit hardware vector and instruction-set types, and it works in raw pointers or stack-allocated memory, whose lifetime is this stack frame. 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. Anything extracted from it has to take that memory as a parameter rather than reach for it. 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.
D1 · Cyclomatic Complexity · Aup2Evaluator.Survey (cyclomatic 24) · ×1
  • Aup2Evaluator.Survey (cyclomatic 24) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:399 — Aup2Evaluator.Survey 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.
D1 · Cyclomatic Complexity · Aup2TextRaster.Render (cyclomatic 24) · ×1
  • Aup2TextRaster.Render (cyclomatic 24) OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:242 — Aup2TextRaster.Render 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.
D1 · Cyclomatic Complexity · Aup2Track.Evaluate (cyclomatic 24) · ×1
  • Aup2Track.Evaluate (cyclomatic 24) OpenTaiko/src/Lua/AviUtl2/Aup2Track.cs:102 — Aup2Track.Evaluate 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.
D1 · Cyclomatic Complexity · COsu.Parse (cyclomatic 24) · ×1
  • COsu.Parse (cyclomatic 24) OpenTaiko/src/Songs/COsu.cs:96 — COsu.Parse has cyclomatic complexity 24 (threshold 15). Of this number, 17 points are the body's own statements and 7 belong to 6 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.
D1 · Cyclomatic Complexity · CTja.tInput_V4 (cyclomatic 24) · ×1
  • CTja.tInput_V4 (cyclomatic 24) OpenTaiko/src/Songs/CTja.cs:1608 — CTja.tInput_V4 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.
D1 · Cyclomatic Complexity · CActPlayPanelString.Draw (cyclomatic 24) · ×1
  • CActPlayPanelString.Draw (cyclomatic 24) OpenTaiko/src/Stages/07.Game/CActPlayPanelString.cs:185 — CActPlayPanelString.Draw 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tRollProcess (cyclomatic 24) · ×1
  • CStagePlayScreenCommon.tRollProcess (cyclomatic 24) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1446 — CStagePlayScreenCommon.tRollProcess 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.
D1 · Cyclomatic Complexity · CActImplBackground.Activate (cyclomatic 24) · ×1
  • CActImplBackground.Activate (cyclomatic 24) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:78 — CActImplBackground.Activate 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.
D1 · Cyclomatic Complexity · CActImplScoreRank.displayScoreRank (cyclomatic 24) · ×1
  • CActImplScoreRank.displayScoreRank (cyclomatic 24) OpenTaiko/src/Stages/07.Game/Taiko/CActImplScoreRank.cs:43 — CActImplScoreRank.displayScoreRank 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.
D1 · Cyclomatic Complexity · CStagePlayDrumsScreen.HideObscuringRoll (cyclomatic 24) · ×1
  • CStagePlayDrumsScreen.HideObscuringRoll (cyclomatic 24) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1402 — CStagePlayDrumsScreen.HideObscuringRoll has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · CVideoDecoder.EnqueueFrames (cyclomatic 24) · ×1
  • CVideoDecoder.EnqueueFrames (cyclomatic 24) FDK/src/04.Graphics/CVideoDecoder.cs:460 — CVideoDecoder.EnqueueFrames 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.
D1 · Cyclomatic Complexity · CConfigIni.LoadFromString (cyclomatic 23) · ×1
  • CConfigIni.LoadFromString (cyclomatic 23) OpenTaiko/src/Common/CConfigIni.cs:2016 — CConfigIni.LoadFromString 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 is NOT this file's highest cyclomatic complexity: CConfigIni.ProcessPlayOptionSection (cyclomatic 73) 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.
D1 · Cyclomatic Complexity · OpenTaiko.tStartupProcess (cyclomatic 23) · ×1
  • OpenTaiko.tStartupProcess (cyclomatic 23) OpenTaiko/src/Common/OpenTaiko.cs:1422 — OpenTaiko.tStartupProcess 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.
D1 · Cyclomatic Complexity · FFVideoWriter.MuxWithAudio (cyclomatic 23) · ×1
  • FFVideoWriter.MuxWithAudio (cyclomatic 23) OpenTaiko/src/Common/VideoExporter.cs:706 — FFVideoWriter.MuxWithAudio has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body's own statements and 10 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DBSaves.RegisterPlay (cyclomatic 23) · ×1
  • DBSaves.RegisterPlay (cyclomatic 23) REDACTED:447 — DBSaves.RegisterPlay has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GpuRasterizer.DrawTerrainObj (cyclomatic 23) · ×1
  • GpuRasterizer.DrawTerrainObj (cyclomatic 23) OpenTaiko/src/Lua/3D/GpuRasterizer.Terrain.cs:109 — GpuRasterizer.DrawTerrainObj has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PhysicsWorld.CollideStaticSmooth (cyclomatic 23) · ×1
  • PhysicsWorld.CollideStaticSmooth (cyclomatic 23) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:251 — PhysicsWorld.CollideStaticSmooth has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Aup2ScriptLibrary.PushSettings (cyclomatic 23) · ×1
  • Aup2ScriptLibrary.PushSettings (cyclomatic 23) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:457 — Aup2ScriptLibrary.PushSettings has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: Aup2ScriptLibrary.Call (cyclomatic 24) 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.AutorollRoll (cyclomatic 23) · ×1
  • CStagePlayScreenCommon.AutorollRoll (cyclomatic 23) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1323 — CStagePlayScreenCommon.AutorollRoll has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · AIBattle.Draw (cyclomatic 23) · ×1
  • AIBattle.Draw (cyclomatic 23) OpenTaiko/src/Stages/07.Game/Taiko/AIBattle.cs:40 — AIBattle.Draw has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CStageTransition.Draw (cyclomatic 23) · ×1
  • CStageTransition.Draw (cyclomatic 23) OpenTaiko/src/Stages/11.Transition/CStageTransition.cs:185 — CStageTransition.Draw has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CFontRenderer.DrawText_V (cyclomatic 23) · ×1
  • CFontRenderer.DrawText_V (cyclomatic 23) FDK/src/04.Graphics/TextRenderer/CFontRenderer.cs:193 — CFontRenderer.DrawText_V has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VideoExporter.Tick (cyclomatic 22) · ×1
  • VideoExporter.Tick (cyclomatic 22) OpenTaiko/src/Common/VideoExporter.cs:165 — VideoExporter.Tick has cyclomatic complexity 22 (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.
D1 · Cyclomatic Complexity · HGaugeMethods.UNSAFE_DrawGaugeFast (cyclomatic 22) · ×1
  • HGaugeMethods.UNSAFE_DrawGaugeFast (cyclomatic 22) OpenTaiko/src/Helpers/HGaugeMethods.cs:465 — HGaugeMethods.UNSAFE_DrawGaugeFast has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · LuaCanvas.FillPolygon (cyclomatic 22) · ×1
  • LuaCanvas.FillPolygon (cyclomatic 22) OpenTaiko/src/Lua/Classes/LuaCanvas.cs:479 — LuaCanvas.FillPolygon 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.
D1 · Cyclomatic Complexity · LuaGlyphText.Compose (cyclomatic 22) · ×1
  • LuaGlyphText.Compose (cyclomatic 22) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:409 — LuaGlyphText.Compose 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.
D1 · Cyclomatic Complexity · CStageResult.tDanResultInfo (cyclomatic 22) · ×1
  • CStageResult.tDanResultInfo (cyclomatic 22) OpenTaiko/src/Stages/08.Result/CStageResult.cs:156 — CStageResult.tDanResultInfo has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body's own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GpuRasterizer.DrawWorld (cyclomatic 21) · ×1
  • GpuRasterizer.DrawWorld (cyclomatic 21) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:291 — GpuRasterizer.DrawWorld 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.
D1 · Cyclomatic Complexity · GpuRaytracer.BuildAtlas (cyclomatic 21) · ×1
  • GpuRaytracer.BuildAtlas (cyclomatic 21) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:411 — GpuRaytracer.BuildAtlas 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.
D1 · Cyclomatic Complexity · VehicleBody.UpdateWheels (cyclomatic 21) · ×1
  • VehicleBody.UpdateWheels (cyclomatic 21) OpenTaiko/src/Lua/3D/Physics/PhysicsVehicle.cs:83 — VehicleBody.UpdateWheels 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.
D1 · Cyclomatic Complexity · Rasterizer.ProjectParticles (cyclomatic 21) · ×1
  • Rasterizer.ProjectParticles (cyclomatic 21) OpenTaiko/src/Lua/3D/Rasterizer.cs:650 — Rasterizer.ProjectParticles 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.
D1 · Cyclomatic Complexity · RtScene.ClosestTri (cyclomatic 21) · ×1
  • RtScene.ClosestTri (cyclomatic 21) OpenTaiko/src/Lua/3D/RtScene.cs:320 — RtScene.ClosestTri 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.
D1 · Cyclomatic Complexity · Aup2FiltersExtra.Mesh (cyclomatic 21) · ×1
  • Aup2FiltersExtra.Mesh (cyclomatic 21) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersExtra.cs:312 — Aup2FiltersExtra.Mesh has cyclomatic complexity 21 (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.
D1 · Cyclomatic Complexity · Aup2Objects.Waveform (cyclomatic 21) · ×1
  • Aup2Objects.Waveform (cyclomatic 21) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:668 — Aup2Objects.Waveform 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.
D1 · Cyclomatic Complexity · CSongManager.tSongListPostprocessing (cyclomatic 21) · ×1
  • CSongManager.tSongListPostprocessing (cyclomatic 21) OpenTaiko/src/Songs/CSongManager.cs:702 — CSongManager.tSongListPostprocessing 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.
D1 · Cyclomatic Complexity · CActCalibrationMode.Update (cyclomatic 21) · ×1
  • CActCalibrationMode.Update (cyclomatic 21) OpenTaiko/src/Stages/04.Config/CActCalibrationMode.cs:41 — CActCalibrationMode.Update has cyclomatic complexity 21 (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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.ProcessBalloonBroke (cyclomatic 21) · ×1
  • CStagePlayScreenCommon.ProcessBalloonBroke (cyclomatic 21) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4146 — CStagePlayScreenCommon.ProcessBalloonBroke 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.
D1 · Cyclomatic Complexity · CActImplBalloon.OnProgressDraw (cyclomatic 21) · ×1
  • CActImplBalloon.OnProgressDraw (cyclomatic 21) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:99 — CActImplBalloon.OnProgressDraw 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.
D1 · Cyclomatic Complexity · CActImplDancer.Activate (cyclomatic 21) · ×1
  • CActImplDancer.Activate (cyclomatic 21) OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:14 — CActImplDancer.Activate 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.
D1 · Cyclomatic Complexity · CStagePlayDrumsScreen.IsReplayValid (cyclomatic 21) · ×1
  • CStagePlayDrumsScreen.IsReplayValid (cyclomatic 21) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:994 — CStagePlayDrumsScreen.IsReplayValid has cyclomatic complexity 21 (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.
D1 · Cyclomatic Complexity · Game.Game.ctor (cyclomatic 21) · ×1
  • Game.Game.ctor (cyclomatic 21) FDK/src/01.Framework/Core/Game.cs:486 — Game.Game.ctor has cyclomatic 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CSoundDeviceASIO.CSoundDeviceASIO.ctor (cyclomatic 21) · ×1
  • CSoundDeviceASIO.CSoundDeviceASIO.ctor (cyclomatic 21) FDK/src/03.Sound/CSoundDeviceASIO.cs:103 — CSoundDeviceASIO.CSoundDeviceASIO.ctor has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CTexture.UpdatePixelBufferRegion (cyclomatic 21) · ×1
  • CTexture.UpdatePixelBufferRegion (cyclomatic 21) FDK/src/04.Graphics/CTexture.cs:536 — CTexture.UpdatePixelBufferRegion has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · GpuRasterizer.Invalidate (cyclomatic 20) · ×1
  • GpuRasterizer.Invalidate (cyclomatic 20) OpenTaiko/src/Lua/3D/GpuRasterizer.cs:291 — GpuRasterizer.Invalidate 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.
D1 · Cyclomatic Complexity · GpuRasterizer.EnsureGrassTile (cyclomatic 20) · ×1
  • GpuRasterizer.EnsureGrassTile (cyclomatic 20) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:57 — GpuRasterizer.EnsureGrassTile has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · GpuRasterizer.BuildQueue (cyclomatic 20) · ×1
  • GpuRasterizer.BuildQueue (cyclomatic 20) OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:121 — GpuRasterizer.BuildQueue 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.
D1 · Cyclomatic Complexity · Lua3DScene.DrawLine (cyclomatic 20) · ×1
  • Lua3DScene.DrawLine (cyclomatic 20) OpenTaiko/src/Lua/3D/Lua3DScene.Display.cs:24 — Lua3DScene.DrawLine 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.
D1 · Cyclomatic Complexity · Aup2Objects.Trail (cyclomatic 20) · ×1
  • Aup2Objects.Trail (cyclomatic 20) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:747 — Aup2Objects.Trail 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.
D1 · Cyclomatic Complexity · LuaCanvas.PasteTextureTransformed (cyclomatic 20) · ×1
  • LuaCanvas.PasteTextureTransformed (cyclomatic 20) OpenTaiko/src/Lua/Classes/LuaCanvas.cs:155 — LuaCanvas.PasteTextureTransformed 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.
D1 · Cyclomatic Complexity · PaletteManager.RestoreFromSave (cyclomatic 20) · ×1
  • PaletteManager.RestoreFromSave (cyclomatic 20) OpenTaiko/src/Lua/Classes/PaletteManager.cs:106 — PaletteManager.RestoreFromSave 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.
D1 · Cyclomatic Complexity · CTja.tWAVLoad (cyclomatic 20) · ×1
  • CTja.tWAVLoad (cyclomatic 20) OpenTaiko/src/Songs/CTja.cs:733 — CTja.tWAVLoad 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.
D1 · Cyclomatic Complexity · CSkiaSharpTextRenderer.DrawText (cyclomatic 20) · ×1
  • CSkiaSharpTextRenderer.DrawText (cyclomatic 20) FDK/src/04.Graphics/TextRenderer/CSkiaSharpTextRenderer.cs:219 — CSkiaSharpTextRenderer.DrawText 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.
D1 · Cyclomatic Complexity · GameViewController.OnFrame (cyclomatic 20) · ×1
  • GameViewController.OnFrame (cyclomatic 20) OpenTaiko.iOS/GameViewController.cs:355 — GameViewController.OnFrame 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.
D1 · Cyclomatic Complexity · CSystemError.LoadError (cyclomatic 19) · ×1
  • CSystemError.LoadError (cyclomatic 19) OpenTaiko/src/Common/CSystemError.cs:27 — CSystemError.LoadError 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.
D1 · Cyclomatic Complexity · GpuRasterizer.UploadTexture (cyclomatic 19) · ×1
  • GpuRasterizer.UploadTexture (cyclomatic 19) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:17 — GpuRasterizer.UploadTexture 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.
D1 · Cyclomatic Complexity · GpuRasterizer.TexFor (cyclomatic 19) · ×1
  • GpuRasterizer.TexFor (cyclomatic 19) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:150 — GpuRasterizer.TexFor has cyclomatic complexity 19 (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.
D1 · Cyclomatic Complexity · PhysicsWorld.CollideStatic (cyclomatic 19) · ×1
  • PhysicsWorld.CollideStatic (cyclomatic 19) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:308 — PhysicsWorld.CollideStatic 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.
D1 · Cyclomatic Complexity · Aup2MonoMix.Set (cyclomatic 19) · ×1
  • Aup2MonoMix.Set (cyclomatic 19) OpenTaiko/src/Lua/AviUtl2/Aup2Audio.cs:70 — Aup2MonoMix.Set 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.
D1 · Cyclomatic Complexity · Aup2SampleTable.Decode (cyclomatic 19) · ×1
  • Aup2SampleTable.Decode (cyclomatic 19) OpenTaiko/src/Lua/AviUtl2/Aup2Audio.cs:174 — Aup2SampleTable.Decode 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.
D1 · Cyclomatic Complexity · Aup2Objects.Polygon (cyclomatic 19) · ×1
  • Aup2Objects.Polygon (cyclomatic 19) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:197 — Aup2Objects.Polygon 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.
D1 · Cyclomatic Complexity · LuaNetworking.RecoverLoop (cyclomatic 19) · ×1
  • LuaNetworking.RecoverLoop (cyclomatic 19) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1151 — LuaNetworking.RecoverLoop 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.
D1 · Cyclomatic Complexity · CTja.tDanExamLoad (cyclomatic 19) · ×1
  • CTja.tDanExamLoad (cyclomatic 19) OpenTaiko/src/Songs/CTja.cs:3669 — CTja.tDanExamLoad has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CConfigOptionBuilder.Build (cyclomatic 19) · ×1
  • CConfigOptionBuilder.Build (cyclomatic 19) OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:60 — CConfigOptionBuilder.Build 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.
D1 · Cyclomatic Complexity · CActImplCharacter.Draw (cyclomatic 19) · ×1
  • CActImplCharacter.Draw (cyclomatic 19) OpenTaiko/src/Stages/07.Game/Taiko/CActImplCharacter.cs:143 — CActImplCharacter.Draw 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.
D1 · Cyclomatic Complexity · CActImplDancer.LoadDancerConifg (cyclomatic 19) · ×1
  • CActImplDancer.LoadDancerConifg (cyclomatic 19) OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:244 — CActImplDancer.LoadDancerConifg 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.
D1 · Cyclomatic Complexity · CActImplRoll.OnProgressDraw (cyclomatic 19) · ×1
  • CActImplRoll.OnProgressDraw (cyclomatic 19) OpenTaiko/src/Stages/07.Game/Taiko/CActImplRoll.cs:48 — CActImplRoll.OnProgressDraw 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.
D1 · Cyclomatic Complexity · Game.InitializeGraphics (cyclomatic 19) · ×1
  • Game.InitializeGraphics (cyclomatic 19) FDK/src/01.Framework/Core/Game.cs:916 — Game.InitializeGraphics has cyclomatic complexity 19 (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.
D1 · Cyclomatic Complexity · CSoundDeviceBASS.CSoundDeviceBASS.ctor (cyclomatic 19) · ×1
  • CSoundDeviceBASS.CSoundDeviceBASS.ctor (cyclomatic 19) FDK/src/03.Sound/CSoundDeviceBASS.cs:79 — CSoundDeviceBASS.CSoundDeviceBASS.ctor 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.
D1 · Cyclomatic Complexity · CSongReplay.tResultsRegisterReplayInformations (cyclomatic 18) · ×1
  • CSongReplay.tResultsRegisterReplayInformations (cyclomatic 18) OpenTaiko/src/Components/CSongReplay.cs:422 — CSongReplay.tResultsRegisterReplayInformations 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.
D1 · Cyclomatic Complexity · GltfModel.SampleNode (cyclomatic 18) · ×1
  • GltfModel.SampleNode (cyclomatic 18) OpenTaiko/src/Lua/3D/GltfModel.cs:671 — GltfModel.SampleNode 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.
D1 · Cyclomatic Complexity · GpuRasterizer.GatherGrassTile (cyclomatic 18) · ×1
  • GpuRasterizer.GatherGrassTile (cyclomatic 18) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:140 — GpuRasterizer.GatherGrassTile 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.
D1 · Cyclomatic Complexity · GpuRasterizer.SpreadColour (cyclomatic 18) · ×1
  • GpuRasterizer.SpreadColour (cyclomatic 18) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:72 — GpuRasterizer.SpreadColour 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.
D1 · Cyclomatic Complexity · Aup2FiltersBlur.Glow (cyclomatic 18) · ×1
  • Aup2FiltersBlur.Glow (cyclomatic 18) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersBlur.cs:445 — Aup2FiltersBlur.Glow 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.
D1 · Cyclomatic Complexity · Aup2FiltersColor.Mask (cyclomatic 18) · ×1
  • Aup2FiltersColor.Mask (cyclomatic 18) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersColor.cs:372 — Aup2FiltersColor.Mask 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.
D1 · Cyclomatic Complexity · Aup2ScriptLibrary.GetValue (cyclomatic 18) · ×1
  • Aup2ScriptLibrary.GetValue (cyclomatic 18) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1126 — Aup2ScriptLibrary.GetValue 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: Aup2ScriptLibrary.Call (cyclomatic 24) 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.
D1 · Cyclomatic Complexity · LuaSongListSettings.IsNodeExcludedAtGeneration (cyclomatic 18) · ×1
  • LuaSongListSettings.IsNodeExcludedAtGeneration (cyclomatic 18) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongListSettings.cs:104 — LuaSongListSettings.IsNodeExcludedAtGeneration 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.
D1 · Cyclomatic Complexity · LuaNetworking.Leave (cyclomatic 18) · ×1
  • LuaNetworking.Leave (cyclomatic 18) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:300 — LuaNetworking.Leave 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.
D1 · Cyclomatic Complexity · COsu.ParseHitObject (cyclomatic 18) · ×1
  • COsu.ParseHitObject (cyclomatic 18) OpenTaiko/src/Songs/COsu.cs:176 — COsu.ParseHitObject 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.
D1 · Cyclomatic Complexity · CTja.ParsePerPlayerSideHeader (cyclomatic 18) · ×1
  • CTja.ParsePerPlayerSideHeader (cyclomatic 18) OpenTaiko/src/Songs/CTja.cs:3524 — CTja.ParsePerPlayerSideHeader 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.
D1 · Cyclomatic Complexity · TextureLoader.tPlayNeeds (cyclomatic 18) · ×1
  • TextureLoader.tPlayNeeds (cyclomatic 18) OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:108 — TextureLoader.tPlayNeeds 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.
D1 · Cyclomatic Complexity · AIHitTiming.Lands (cyclomatic 18) · ×1
  • AIHitTiming.Lands (cyclomatic 18) OpenTaiko/src/Stages/07.Game/AIBattle/AIHitTiming.cs:21 — AIHitTiming.Lands 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tBalloonProcess (cyclomatic 18) · ×1
  • CStagePlayScreenCommon.tBalloonProcess (cyclomatic 18) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1538 — CStagePlayScreenCommon.tBalloonProcess 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.RemoveNowProcessingRollChip (cyclomatic 18) · ×1
  • CStagePlayScreenCommon.RemoveNowProcessingRollChip (cyclomatic 18) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4223 — CStagePlayScreenCommon.RemoveNowProcessingRollChip 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.
D1 · Cyclomatic Complexity · CStagePlayDrumsScreen.JudgePadInput (cyclomatic 18) · ×1
  • CStagePlayDrumsScreen.JudgePadInput (cyclomatic 18) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1126 — CStagePlayDrumsScreen.JudgePadInput 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.
D1 · Cyclomatic Complexity · FlyingNotes.Draw (cyclomatic 18) · ×1
  • FlyingNotes.Draw (cyclomatic 18) OpenTaiko/src/Stages/07.Game/Taiko/FlyingNotes.cs:90 — FlyingNotes.Draw 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.
D1 · Cyclomatic Complexity · Rainbow.Draw (cyclomatic 18) · ×1
  • Rainbow.Draw (cyclomatic 18) OpenTaiko/src/Stages/07.Game/Taiko/Rainbow.cs:56 — Rainbow.Draw 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.
D1 · Cyclomatic Complexity · CTexture.MakeTexture (cyclomatic 18) · ×1
  • CTexture.MakeTexture (cyclomatic 18) FDK/src/04.Graphics/CTexture.cs:1100 — CTexture.MakeTexture 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.
D1 · Cyclomatic Complexity · CVideoDecoder.GetNowFrame (cyclomatic 18) · ×1
  • CVideoDecoder.GetNowFrame (cyclomatic 18) FDK/src/04.Graphics/CVideoDecoder.cs:389 — CVideoDecoder.GetNowFrame 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.
D1 · Cyclomatic Complexity · Easing.EaseInOut (cyclomatic 17) · ×1
  • Easing.EaseInOut (cyclomatic 17) OpenTaiko/src/Common/Easing.cs:100 — Easing.EaseInOut 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.
D1 · Cyclomatic Complexity · CPopupMenuManager.Update (cyclomatic 17) · ×1
  • CPopupMenuManager.Update (cyclomatic 17) OpenTaiko/src/Components/CPopupMenuManager.cs:80 — CPopupMenuManager.Update has cyclomatic complexity 17 (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.
D1 · Cyclomatic Complexity · CSongReplay.tApplyVirtualMods (cyclomatic 17) · ×1
  • CSongReplay.tApplyVirtualMods (cyclomatic 17) OpenTaiko/src/Components/CSongReplay.cs:557 — CSongReplay.tApplyVirtualMods 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.
D1 · Cyclomatic Complexity · GltfModel.Pose (cyclomatic 17) · ×1
  • GltfModel.Pose (cyclomatic 17) OpenTaiko/src/Lua/3D/GltfModel.cs:192 — GltfModel.Pose 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.
D1 · Cyclomatic Complexity · GpuRasterizer.DrawSurfaceCustom (cyclomatic 17) · ×1
  • GpuRasterizer.DrawSurfaceCustom (cyclomatic 17) OpenTaiko/src/Lua/3D/GpuRasterizer.Surfaces.cs:51 — GpuRasterizer.DrawSurfaceCustom 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.
D1 · Cyclomatic Complexity · Raytracer.DirectLight (cyclomatic 17) · ×1
  • Raytracer.DirectLight (cyclomatic 17) OpenTaiko/src/Lua/3D/Raytracer.cs:226 — Raytracer.DirectLight 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.
D1 · Cyclomatic Complexity · Raytracer.Occluded (cyclomatic 17) · ×1
  • Raytracer.Occluded (cyclomatic 17) OpenTaiko/src/Lua/3D/Raytracer.cs:369 — Raytracer.Occluded 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.
D1 · Cyclomatic Complexity · Aup2Document.Parse (cyclomatic 17) · ×1
  • Aup2Document.Parse (cyclomatic 17) OpenTaiko/src/Lua/AviUtl2/Aup2Document.cs:133 — Aup2Document.Parse 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.
D1 · Cyclomatic Complexity · LuaSongList.ReloadSongList (cyclomatic 17) · ×1
  • LuaSongList.ReloadSongList (cyclomatic 17) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:13 — LuaSongList.ReloadSongList has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LuaNetworking.KickDiscovery (cyclomatic 17) · ×1
  • LuaNetworking.KickDiscovery (cyclomatic 17) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1406 — LuaNetworking.KickDiscovery has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body's own statements and 8 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.
D1 · Cyclomatic Complexity · CTci.Parse (cyclomatic 17) · ×1
  • CTci.Parse (cyclomatic 17) OpenTaiko/src/Songs/CTci.cs:220 — CTci.Parse 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.
D1 · Cyclomatic Complexity · CTja.ApplyNoteXYDirection (cyclomatic 17) · ×1
  • CTja.ApplyNoteXYDirection (cyclomatic 17) OpenTaiko/src/Songs/CTja.cs:4848 — CTja.ApplyNoteXYDirection 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.
D1 · Cyclomatic Complexity · CStageCutScene.JudgeRequirement (cyclomatic 17) · ×1
  • CStageCutScene.JudgeRequirement (cyclomatic 17) OpenTaiko/src/Stages/05.CutScene/CStageCutScene.cs:80 — CStageCutScene.JudgeRequirement 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.
D1 · Cyclomatic Complexity · CActPlayScoreCommon.tSmallDisplay (cyclomatic 17) · ×1
  • CActPlayScoreCommon.tSmallDisplay (cyclomatic 17) OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:283 — CActPlayScoreCommon.tSmallDisplay 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.GetAutoInput (cyclomatic 17) · ×1
  • CStagePlayScreenCommon.GetAutoInput (cyclomatic 17) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1201 — CStagePlayScreenCommon.GetAutoInput 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.
D1 · Cyclomatic Complexity · CStagePlayScreenCommon.tBranchJudge (cyclomatic 17) · ×1
  • CStagePlayScreenCommon.tBranchJudge (cyclomatic 17) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4322 — CStagePlayScreenCommon.tBranchJudge 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.
D1 · Cyclomatic Complexity · GpuRasterizer.DrawFrame (cyclomatic 16) · ×1
  • GpuRasterizer.DrawFrame (cyclomatic 16) OpenTaiko/src/Lua/3D/GpuRasterizer.cs:167 — GpuRasterizer.DrawFrame 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.
D1 · Cyclomatic Complexity · GpuRasterizer.AddCaster (cyclomatic 16) · ×1
  • GpuRasterizer.AddCaster (cyclomatic 16) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:225 — GpuRasterizer.AddCaster 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.
D1 · Cyclomatic Complexity · GpuRasterizer.DrawCasters (cyclomatic 16) · ×1
  • GpuRasterizer.DrawCasters (cyclomatic 16) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:340 — GpuRasterizer.DrawCasters 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.
D1 · Cyclomatic Complexity · GpuRaytracer.UploadScene (cyclomatic 16) · ×1
  • GpuRaytracer.UploadScene (cyclomatic 16) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:367 — GpuRaytracer.UploadScene has cyclomatic complexity 16 (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.
D1 · Cyclomatic Complexity · Lua3DScene.CaptureCpuRtt (cyclomatic 16) · ×1
  • Lua3DScene.CaptureCpuRtt (cyclomatic 16) OpenTaiko/src/Lua/3D/Lua3DScene.Reflections.cs:135 — Lua3DScene.CaptureCpuRtt 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.
D1 · Cyclomatic Complexity · NavGraph.FindPath (cyclomatic 16) · ×1
  • NavGraph.FindPath (cyclomatic 16) OpenTaiko/src/Lua/3D/Pathfinding/NavGraph.cs:70 — NavGraph.FindPath 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.
D1 · Cyclomatic Complexity · PhysicsWorld.ClosestOnTri (cyclomatic 16) · ×1
  • PhysicsWorld.ClosestOnTri (cyclomatic 16) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:162 — PhysicsWorld.ClosestOnTri has cyclomatic complexity 16 (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.
D1 · Cyclomatic Complexity · Builder.GatherObjLights (cyclomatic 16) · ×1
  • Builder.GatherObjLights (cyclomatic 16) OpenTaiko/src/Lua/3D/Rasterizer.cs:298 — Builder.GatherObjLights 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.
D1 · Cyclomatic Complexity · Rasterizer.FXAABand (cyclomatic 16) · ×1
  • Rasterizer.FXAABand (cyclomatic 16) OpenTaiko/src/Lua/3D/Rasterizer.cs:799 — Rasterizer.FXAABand 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.
D1 · Cyclomatic Complexity · Raytracer.Closest (cyclomatic 16) · ×1
  • Raytracer.Closest (cyclomatic 16) OpenTaiko/src/Lua/3D/Raytracer.cs:313 — Raytracer.Closest 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.
D1 · Cyclomatic Complexity · SceneObject.FacesAway (cyclomatic 16) · ×1
  • SceneObject.FacesAway (cyclomatic 16) OpenTaiko/src/Lua/3D/SceneData.cs:71 — SceneObject.FacesAway 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: SceneObject.MergeCandidate.get (cyclomatic 22) 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.
D1 · Cyclomatic Complexity · Aup2FiltersColor.Gradient (cyclomatic 16) · ×1
  • Aup2FiltersColor.Gradient (cyclomatic 16) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersColor.cs:61 — Aup2FiltersColor.Gradient 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.
D1 · Cyclomatic Complexity · Aup2FiltersMotion.Wipe (cyclomatic 16) · ×1
  • Aup2FiltersMotion.Wipe (cyclomatic 16) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:194 — Aup2FiltersMotion.Wipe 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.
D1 · Cyclomatic Complexity · Aup2Evaluator.AttachedFilters (cyclomatic 16) · ×1
  • Aup2Evaluator.AttachedFilters (cyclomatic 16) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:549 — Aup2Evaluator.AttachedFilters 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.
D1 · Cyclomatic Complexity · Aup2ScriptFile.SplitOutside (cyclomatic 16) · ×1
  • Aup2ScriptFile.SplitOutside (cyclomatic 16) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptFile.cs:273 — Aup2ScriptFile.SplitOutside 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.
D1 · Cyclomatic Complexity · LuaGlyphText.Draw (cyclomatic 16) · ×1
  • LuaGlyphText.Draw (cyclomatic 16) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:343 — LuaGlyphText.Draw 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.
D1 · Cyclomatic Complexity · MiniMqtt.RxLoop (cyclomatic 16) · ×1
  • MiniMqtt.RxLoop (cyclomatic 16) OpenTaiko/src/Lua/Networking/MiniMqtt.cs:94 — MiniMqtt.RxLoop 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.
D1 · Cyclomatic Complexity · CTja.SetBPMPointAtDefCursor (cyclomatic 16) · ×1
  • CTja.SetBPMPointAtDefCursor (cyclomatic 16) OpenTaiko/src/Songs/CTja.cs:2634 — CTja.SetBPMPointAtDefCursor 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.
D1 · Cyclomatic Complexity · CActImplFireworks.Start (cyclomatic 16) · ×1
  • CActImplFireworks.Start (cyclomatic 16) OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:21 — CActImplFireworks.Start has cyclomatic complexity 16 (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.
D1 · Cyclomatic Complexity · CActImplLaneTaiko.DrawBranchText (cyclomatic 16) · ×1
  • CActImplLaneTaiko.DrawBranchText (cyclomatic 16) OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:298 — CActImplLaneTaiko.DrawBranchText 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.
D1 · Cyclomatic Complexity · Dan_Cert.Start (cyclomatic 16) · ×1
  • Dan_Cert.Start (cyclomatic 16) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:30 — Dan_Cert.Start 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.
D1 · Cyclomatic Complexity · SoundManager.tCheckDeviceChange (cyclomatic 16) · ×1
  • SoundManager.tCheckDeviceChange (cyclomatic 16) FDK/src/03.Sound/SoundManager.cs:420 — SoundManager.tCheckDeviceChange 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.
D17 · Explicit Debt · BarePragmaDisable · ×1
  • BarePragmaDisable OpenTaiko.Android/MainActivity.cs:103 — #pragma warning disable CA1422 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
D2 · Cognitive Complexity · CSkin.tLoadFromString (cognitive 2668) · ×1
  • CSkin.tLoadFromString (cognitive 2668) OpenTaiko/src/Common/CSkin.cs:1121 — CSkin.tLoadFromString has cognitive complexity 2668 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tProgressDraw_Chip (cognitive 588) · ×1
  • CStagePlayScreenCommon.tProgressDraw_Chip (cognitive 588) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2837 — CStagePlayScreenCommon.tProgressDraw_Chip has cognitive complexity 588 (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.
D2 · Cognitive Complexity · GltfModel.LoadUncached (cognitive 377) · ×1
  • GltfModel.LoadUncached (cognitive 377) OpenTaiko/src/Lua/3D/GltfModel.cs:869 — GltfModel.LoadUncached has cognitive complexity 377 (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.
D2 · Cognitive Complexity · CActImplGauge.Draw (cognitive 248) · ×1
  • CActImplGauge.Draw (cognitive 248) OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs:76 — CActImplGauge.Draw has cognitive complexity 248 (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.
D2 · Cognitive Complexity · Dan_Cert.DrawExam (cognitive 248) · ×1
  • Dan_Cert.DrawExam (cognitive 248) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:796 — Dan_Cert.DrawExam has cognitive complexity 248 (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.
D2 · Cognitive Complexity · ImGuiDebugWindow.Stage (cognitive 237) · ×1
  • ImGuiDebugWindow.Stage (cognitive 237) OpenTaiko/src/Common/ImGuiDebugWindow.cs:359 — ImGuiDebugWindow.Stage has cognitive complexity 237 (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.
D2 · Cognitive Complexity · CTja.tProcessAllText (cognitive 237) · ×1
  • CTja.tProcessAllText (cognitive 237) OpenTaiko/src/Songs/CTja.cs:1113 — CTja.tProcessAllText has cognitive complexity 237 (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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.Draw (cognitive 232) · ×1
  • CStagePlayDrumsScreen.Draw (cognitive 232) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:372 — CStagePlayDrumsScreen.Draw has cognitive complexity 232 (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.
D2 · Cognitive Complexity · CTja.ParseCommand (cognitive 215) · ×1
  • CTja.ParseCommand (cognitive 215) OpenTaiko/src/Songs/CTja.cs:1835 — CTja.ParseCommand has cognitive complexity 215 (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.
D2 · Cognitive Complexity · VTTParser.ParseVTTFile (cognitive 203) · ×1
  • VTTParser.ParseVTTFile (cognitive 203) OpenTaiko/src/Songs/VTTParser.cs:49 — VTTParser.ParseVTTFile has cognitive complexity 203 (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.
D2 · Cognitive Complexity · CSongManager.tSongSearchListCreate (cognitive 196) · ×1
  • CSongManager.tSongSearchListCreate (cognitive 196) OpenTaiko/src/Songs/CSongManager.cs:297 — CSongManager.tSongSearchListCreate has cognitive complexity 196 (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.
D2 · Cognitive Complexity · CStageResult.Activate (cognitive 195) · ×1
  • CStageResult.Activate (cognitive 195) OpenTaiko/src/Stages/08.Result/CStageResult.cs:247 — CStageResult.Activate has cognitive complexity 195 (threshold 15). Of this number, 194 points are the body's own statements and 1 belongs 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.
D2 · Cognitive Complexity · Rasterizer.RasterTexBand (cognitive 191) · ×1
  • Rasterizer.RasterTexBand (cognitive 191) OpenTaiko/src/Lua/3D/Rasterizer.cs:975 — Rasterizer.RasterTexBand has cognitive complexity 191 (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.
D2 · Cognitive Complexity · OpenTaiko.Draw (cognitive 181) · ×1
  • OpenTaiko.Draw (cognitive 181) OpenTaiko/src/Common/OpenTaiko.cs:689 — OpenTaiko.Draw has cognitive complexity 181 (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.
D2 · Cognitive Complexity · CTja.ParseGlobalHeader (cognitive 177) · ×1
  • CTja.ParseGlobalHeader (cognitive 177) OpenTaiko/src/Songs/CTja.cs:3778 — CTja.ParseGlobalHeader has cognitive complexity 177 (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.
D2 · Cognitive Complexity · Builder.Build (cognitive 172) · ×1
  • Builder.Build (cognitive 172) OpenTaiko/src/Lua/3D/Rasterizer.cs:327 — Builder.Build has cognitive complexity 172 (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.
D2 · Cognitive Complexity · CStageSongLoading.Draw (cognitive 170) · ×1
  • CStageSongLoading.Draw (cognitive 170) OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:175 — CStageSongLoading.Draw has cognitive complexity 170 (threshold 15). Of this number, 144 points are the body's own statements and 26 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ImGuiDebugWindow.Inputs (cognitive 164) · ×1
  • ImGuiDebugWindow.Inputs (cognitive 164) OpenTaiko/src/Common/ImGuiDebugWindow.cs:111 — ImGuiDebugWindow.Inputs has cognitive complexity 164 (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.
D2 · Cognitive Complexity · CActImplScore.Draw (cognitive 161) · ×1
  • CActImplScore.Draw (cognitive 161) OpenTaiko/src/Stages/07.Game/Taiko/CActImplScore.cs:16 — CActImplScore.Draw has cognitive complexity 161 (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.
D2 · Cognitive Complexity · Aup2Evaluator.Evaluate (cognitive 153) · ×1
  • Aup2Evaluator.Evaluate (cognitive 153) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:573 — Aup2Evaluator.Evaluate has cognitive complexity 153 (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.
D2 · Cognitive Complexity · CStageOnlineLounge.Draw (cognitive 149) · ×1
  • CStageOnlineLounge.Draw (cognitive 149) OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:145 — CStageOnlineLounge.Draw has cognitive complexity 149 (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.
D2 · Cognitive Complexity · LuaDanBuildFunc.BuildDanCtja (cognitive 144) · ×1
  • LuaDanBuildFunc.BuildDanCtja (cognitive 144) OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs:143 — LuaDanBuildFunc.BuildDanCtja has cognitive complexity 144 (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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.tProgressDraw_Chip_TaikoRoll (cognitive 140) · ×1
  • CStagePlayDrumsScreen.tProgressDraw_Chip_TaikoRoll (cognitive 140) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1252 — CStagePlayDrumsScreen.tProgressDraw_Chip_TaikoRoll has cognitive complexity 140 (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.
D2 · Cognitive Complexity · CActImplTrainingMode.Draw (cognitive 136) · ×1
  • CActImplTrainingMode.Draw (cognitive 136) OpenTaiko/src/Stages/07.Game/Taiko/CActImplTrainingMode.cs:86 — CActImplTrainingMode.Draw has cognitive complexity 136 (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.
D2 · Cognitive Complexity · CActImplMtaiko.Draw (cognitive 131) · ×1
  • CActImplMtaiko.Draw (cognitive 131) OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:49 — CActImplMtaiko.Draw has cognitive complexity 131 (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.
D2 · Cognitive Complexity · CTextShaper.Shape (cognitive 125) · ×1
  • CTextShaper.Shape (cognitive 125) FDK/src/04.Graphics/TextRenderer/CTextShaper.cs:109 — CTextShaper.Shape has cognitive complexity 125 (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.
D2 · Cognitive Complexity · CActImplFireworks.Draw (cognitive 123) · ×1
  • CActImplFireworks.Draw (cognitive 123) OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:134 — CActImplFireworks.Draw has cognitive complexity 123 (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.
D2 · Cognitive Complexity · Dan_Cert.UpdateReachStatus (cognitive 123) · ×1
  • Dan_Cert.UpdateReachStatus (cognitive 123) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:320 — Dan_Cert.UpdateReachStatus has cognitive complexity 123 (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 (Dan_Cert.UpdateReachStatus::judgeRoll) 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.
D2 · Cognitive Complexity · ImGuiDebugWindow.Profile (cognitive 118) · ×1
  • ImGuiDebugWindow.Profile (cognitive 118) OpenTaiko/src/Common/ImGuiDebugWindow.cs:206 — ImGuiDebugWindow.Profile has cognitive complexity 118 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.UpdateJudgeCount (cognitive 118) · ×1
  • CStagePlayScreenCommon.UpdateJudgeCount (cognitive 118) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1898 — CStagePlayScreenCommon.UpdateJudgeCount has cognitive complexity 118 (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.
D2 · Cognitive Complexity · CActImplLaneTaiko.Draw (cognitive 115) · ×1
  • CActImplLaneTaiko.Draw (cognitive 115) OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:57 — CActImplLaneTaiko.Draw has cognitive complexity 115 (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.
D2 · Cognitive Complexity · CActPlayComboCommon.tComboDisplay_Taiko (cognitive 112) · ×1
  • CActPlayComboCommon.tComboDisplay_Taiko (cognitive 112) OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:308 — CActPlayComboCommon.tComboDisplay_Taiko has cognitive complexity 112 (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.
D2 · Cognitive Complexity · RtScene.Build (cognitive 108) · ×1
  • RtScene.Build (cognitive 108) OpenTaiko/src/Lua/3D/RtScene.cs:783 — RtScene.Build has cognitive complexity 108 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.ProcessRollEnd (cognitive 108) · ×1
  • CStagePlayScreenCommon.ProcessRollEnd (cognitive 108) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4062 — CStagePlayScreenCommon.ProcessRollEnd has cognitive complexity 108 (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.
D2 · Cognitive Complexity · CActImplDancer.Draw (cognitive 108) · ×1
  • CActImplDancer.Draw (cognitive 108) OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:130 — CActImplDancer.Draw has cognitive complexity 108 (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.
D2 · Cognitive Complexity · CTja.tInput_LineParseChart_V4 (cognitive 104) · ×1
  • CTja.tInput_LineParseChart_V4 (cognitive 104) OpenTaiko/src/Songs/CTja.cs:3137 — CTja.tInput_LineParseChart_V4 has cognitive complexity 104 (threshold 15). Of this number, 42 points are the body's own statements and 62 belong to 2 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.
D2 · Cognitive Complexity · CScoreIni_Importer.ImportScoreInisToSavesDb3 (cognitive 101) · ×1
  • CScoreIni_Importer.ImportScoreInisToSavesDb3 (cognitive 101) REDACTED:10 — CScoreIni_Importer.ImportScoreInisToSavesDb3 has cognitive complexity 101 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.AddScore (cognitive 92) · ×1
  • CStagePlayScreenCommon.AddScore (cognitive 92) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2102 — CStagePlayScreenCommon.AddScore has cognitive complexity 92 (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.
D2 · Cognitive Complexity · CActImplClearAnimation.Start (cognitive 92) · ×1
  • CActImplClearAnimation.Start (cognitive 92) OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs:15 — CActImplClearAnimation.Start has cognitive complexity 92 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tChipHitProcess (cognitive 90) · ×1
  • CStagePlayScreenCommon.tChipHitProcess (cognitive 90) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1635 — CStagePlayScreenCommon.tChipHitProcess has cognitive complexity 90 (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.
D2 · Cognitive Complexity · CSkiaSharpTextRenderer.Tokenize (cognitive 90) · ×1
  • CSkiaSharpTextRenderer.Tokenize (cognitive 90) FDK/src/04.Graphics/TextRenderer/CSkiaSharpTextRenderer.cs:122 — CSkiaSharpTextRenderer.Tokenize has cognitive complexity 90 (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.
D2 · Cognitive Complexity · CTja.tSenotes_Core_V2 (cognitive 85) · ×1
  • CTja.tSenotes_Core_V2 (cognitive 85) OpenTaiko/src/Songs/CTja.cs:4247 — CTja.tSenotes_Core_V2 has cognitive complexity 85 (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.
D2 · Cognitive Complexity · RtScene.AnyTri (cognitive 83) · ×1
  • RtScene.AnyTri (cognitive 83) OpenTaiko/src/Lua/3D/RtScene.cs:385 — RtScene.AnyTri has cognitive complexity 83 (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.
D2 · Cognitive Complexity · Dan_Cert.Draw (cognitive 83) · ×1
  • Dan_Cert.Draw (cognitive 83) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:643 — Dan_Cert.Draw has cognitive complexity 83 (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.
D2 · Cognitive Complexity · Rasterizer.RenderParticleBand (cognitive 76) · ×1
  • Rasterizer.RenderParticleBand (cognitive 76) OpenTaiko/src/Lua/3D/Rasterizer.cs:694 — Rasterizer.RenderParticleBand has cognitive complexity 76 (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 works in explicit hardware vector and instruction-set types, and it works in raw pointers or stack-allocated memory, whose lifetime is this stack frame. 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. Anything extracted from it has to take that memory as a parameter rather than reach for it. 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.
D2 · Cognitive Complexity · LuaNetworking.P2PJoin (cognitive 76) · ×1
  • LuaNetworking.P2PJoin (cognitive 76) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:856 — LuaNetworking.P2PJoin has cognitive complexity 76 (threshold 15). Of this number, 60 points are the body's own statements and 16 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CTcm.Parse (cognitive 75) · ×1
  • CTcm.Parse (cognitive 75) OpenTaiko/src/Songs/CTcm.cs:218 — CTcm.Parse has cognitive complexity 75 (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.
D2 · Cognitive Complexity · CTja.InsertNoteAtDefCursor (cognitive 75) · ×1
  • CTja.InsertNoteAtDefCursor (cognitive 75) OpenTaiko/src/Songs/CTja.cs:3331 — CTja.InsertNoteAtDefCursor has cognitive complexity 75 (threshold 15). Of this number, 74 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.
D2 · Cognitive Complexity · RtScene.ClosestTri (cognitive 74) · ×1
  • RtScene.ClosestTri (cognitive 74) OpenTaiko/src/Lua/3D/RtScene.cs:320 — RtScene.ClosestTri 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.
D2 · Cognitive Complexity · PhysicsWorld.Step (cognitive 71) · ×1
  • PhysicsWorld.Step (cognitive 71) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:359 — PhysicsWorld.Step has cognitive complexity 71 (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.
D2 · Cognitive Complexity · CConfigIni.tExport (cognitive 70) · ×1
  • CConfigIni.tExport (cognitive 70) OpenTaiko/src/Common/CConfigIni.cs:1104 — CConfigIni.tExport has cognitive complexity 70 (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.
D2 · Cognitive Complexity · Lua3DScene.ApplyOutline (cognitive 69) · ×1
  • Lua3DScene.ApplyOutline (cognitive 69) OpenTaiko/src/Lua/3D/Lua3DScene.Display.cs:103 — Lua3DScene.ApplyOutline has cognitive complexity 69 (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.
D2 · Cognitive Complexity · BestPlayRecords.tGenerateBestPlayStats (cognitive 68) · ×1
  • BestPlayRecords.tGenerateBestPlayStats (cognitive 68) OpenTaiko/src/Common/BestPlayRecords.cs:148 — BestPlayRecords.tGenerateBestPlayStats has cognitive complexity 68 (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.
D2 · Cognitive Complexity · CTja.tInput_V4 (cognitive 67) · ×1
  • CTja.tInput_V4 (cognitive 67) OpenTaiko/src/Songs/CTja.cs:1608 — CTja.tInput_V4 has cognitive complexity 67 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.ReduceMultiplayerNotes (cognitive 67) · ×1
  • CStagePlayScreenCommon.ReduceMultiplayerNotes (cognitive 67) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:339 — CStagePlayScreenCommon.ReduceMultiplayerNotes has cognitive complexity 67 (threshold 15). Of this number, 66 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
D2 · Cognitive Complexity · CStageResult.Draw (cognitive 67) · ×1
  • CStageResult.Draw (cognitive 67) OpenTaiko/src/Stages/08.Result/CStageResult.cs:842 — CStageResult.Draw has cognitive complexity 67 (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.
D2 · Cognitive Complexity · Aup2Renderer.Materialize (cognitive 66) · ×1
  • Aup2Renderer.Materialize (cognitive 66) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:199 — Aup2Renderer.Materialize has cognitive complexity 66 (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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.tTotalControlMethod (cognitive 66) · ×1
  • CStagePlayDrumsScreen.tTotalControlMethod (cognitive 66) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1527 — CStagePlayDrumsScreen.tTotalControlMethod has cognitive complexity 66 (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.
D2 · Cognitive Complexity · PhysicsWorld.CollideStaticSmooth (cognitive 65) · ×1
  • PhysicsWorld.CollideStaticSmooth (cognitive 65) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:251 — PhysicsWorld.CollideStaticSmooth has cognitive complexity 65 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.ActivateSteps (cognitive 65) · ×1
  • CStagePlayScreenCommon.ActivateSteps (cognitive 65) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:67 — CStagePlayScreenCommon.ActivateSteps has cognitive complexity 65 (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.
D2 · Cognitive Complexity · RtScene.Update (cognitive 64) · ×1
  • RtScene.Update (cognitive 64) OpenTaiko/src/Lua/3D/RtScene.cs:150 — RtScene.Update has cognitive complexity 64 (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.
D2 · Cognitive Complexity · CTja.ParseQueryableCourseMetadata (cognitive 63) · ×1
  • CTja.ParseQueryableCourseMetadata (cognitive 63) OpenTaiko/src/Songs/CTja.cs:3570 — CTja.ParseQueryableCourseMetadata has cognitive complexity 63 (threshold 15). Of this number, 52 points are the body's own statements and 11 belong to 4 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.
D2 · Cognitive Complexity · Rasterizer.RasterFlatBand (cognitive 62) · ×1
  • Rasterizer.RasterFlatBand (cognitive 62) OpenTaiko/src/Lua/3D/Rasterizer.cs:902 — Rasterizer.RasterFlatBand has cognitive complexity 62 (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.
D2 · Cognitive Complexity · CSongManager.tSongListPostprocessing (cognitive 62) · ×1
  • CSongManager.tSongListPostprocessing (cognitive 62) OpenTaiko/src/Songs/CSongManager.cs:702 — CSongManager.tSongListPostprocessing has cognitive complexity 62 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 61) · ×1
  • Program.Main (cognitive 61) OpenTaiko/src/Common/Program.cs:76 — Program.Main has cognitive complexity 61 (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.
D2 · Cognitive Complexity · GpuRasterizer.BuildParticles (cognitive 61) · ×1
  • GpuRasterizer.BuildParticles (cognitive 61) OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:33 — GpuRasterizer.BuildParticles has cognitive complexity 61 (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.
D2 · Cognitive Complexity · PhysicsWorld.CollideStatic (cognitive 61) · ×1
  • PhysicsWorld.CollideStatic (cognitive 61) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:308 — PhysicsWorld.CollideStatic has cognitive complexity 61 (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.
D2 · Cognitive Complexity · Raytracer.Trace (cognitive 61) · ×1
  • Raytracer.Trace (cognitive 61) OpenTaiko/src/Lua/3D/Raytracer.cs:153 — Raytracer.Trace has cognitive complexity 61 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.GetChipToJudgeIgnoringRollBody (cognitive 60) · ×1
  • CStagePlayScreenCommon.GetChipToJudgeIgnoringRollBody (cognitive 60) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2284 — CStagePlayScreenCommon.GetChipToJudgeIgnoringRollBody has cognitive complexity 60 (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.
D2 · Cognitive Complexity · Aup2FiltersMotion.Emit (cognitive 59) · ×1
  • Aup2FiltersMotion.Emit (cognitive 59) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:305 — Aup2FiltersMotion.Emit has cognitive complexity 59 (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.
D2 · Cognitive Complexity · CConfigOptionBuilder.BuildThemeOptions (cognitive 59) · ×1
  • CConfigOptionBuilder.BuildThemeOptions (cognitive 59) OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:307 — CConfigOptionBuilder.BuildThemeOptions has cognitive complexity 59 (threshold 15). Of this number, 41 points are the body's own statements and 18 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CStageConfig.Draw (cognitive 59) · ×1
  • CStageConfig.Draw (cognitive 59) OpenTaiko/src/Stages/04.Config/CStageConfig.cs:153 — CStageConfig.Draw has cognitive complexity 59 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tKeyInput (cognitive 59) · ×1
  • CStagePlayScreenCommon.tKeyInput (cognitive 59) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2432 — CStagePlayScreenCommon.tKeyInput has cognitive complexity 59 (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.
D2 · Cognitive Complexity · CActPlayPanelString.Draw (cognitive 58) · ×1
  • CActPlayPanelString.Draw (cognitive 58) OpenTaiko/src/Stages/07.Game/CActPlayPanelString.cs:185 — CActPlayPanelString.Draw has cognitive complexity 58 (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.
D2 · Cognitive Complexity · CActImplBackground.Draw (cognitive 58) · ×1
  • CActImplBackground.Draw (cognitive 58) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:268 — CActImplBackground.Draw has cognitive complexity 58 (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.
D2 · Cognitive Complexity · GltfModel.PoseJoints (cognitive 57) · ×1
  • GltfModel.PoseJoints (cognitive 57) OpenTaiko/src/Lua/3D/GltfModel.cs:402 — GltfModel.PoseJoints has cognitive complexity 57 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tPlayPositionChange (cognitive 57) · ×1
  • CStagePlayScreenCommon.tPlayPositionChange (cognitive 57) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4790 — CStagePlayScreenCommon.tPlayPositionChange has cognitive complexity 57 (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.
D2 · Cognitive Complexity · Rasterizer.Render (cognitive 56) · ×1
  • Rasterizer.Render (cognitive 56) OpenTaiko/src/Lua/3D/Rasterizer.cs:541 — Rasterizer.Render has cognitive complexity 56 (threshold 15). Of this number, 52 points are the body's own statements and 4 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.
D2 · Cognitive Complexity · CActImplLaneTaiko.GoGoFlame (cognitive 56) · ×1
  • CActImplLaneTaiko.GoGoFlame (cognitive 56) OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:445 — CActImplLaneTaiko.GoGoFlame has cognitive complexity 56 (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.
D2 · Cognitive Complexity · OpenTaiko.tExitProcess (cognitive 55) · ×1
  • OpenTaiko.tExitProcess (cognitive 55) OpenTaiko/src/Common/OpenTaiko.cs:1823 — OpenTaiko.tExitProcess has cognitive complexity 55 (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.
D2 · Cognitive Complexity · RtScene.BuildBlock (cognitive 55) · ×1
  • RtScene.BuildBlock (cognitive 55) OpenTaiko/src/Lua/3D/RtScene.cs:590 — RtScene.BuildBlock has cognitive complexity 55 (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.
D2 · Cognitive Complexity · CBoxDef.tLoad (cognitive 55) · ×1
  • CBoxDef.tLoad (cognitive 55) OpenTaiko/src/Songs/CBoxDef.cs:59 — CBoxDef.tLoad has cognitive complexity 55 (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.
D2 · Cognitive Complexity · CActImplDancer.Activate (cognitive 55) · ×1
  • CActImplDancer.Activate (cognitive 55) OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:14 — CActImplDancer.Activate has cognitive complexity 55 (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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.tProgressDraw_Chip_Taiko (cognitive 55) · ×1
  • CStagePlayDrumsScreen.tProgressDraw_Chip_Taiko (cognitive 55) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1178 — CStagePlayDrumsScreen.tProgressDraw_Chip_Taiko has cognitive complexity 55 (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.
D2 · Cognitive Complexity · PhysicsWorld.CollideBoxStatic (cognitive 54) · ×1
  • PhysicsWorld.CollideBoxStatic (cognitive 54) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:212 — PhysicsWorld.CollideBoxStatic has cognitive complexity 54 (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.
D2 · Cognitive Complexity · CTExprVariables.ResolveVariable (cognitive 54) · ×1
  • CTExprVariables.ResolveVariable (cognitive 54) OpenTaiko/src/Songs/TJA/TriggersCounters/CTExprVariables.cs:3 — CTExprVariables.ResolveVariable has cognitive complexity 54 (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.
D2 · Cognitive Complexity · FlyingNotes.Draw (cognitive 54) · ×1
  • FlyingNotes.Draw (cognitive 54) OpenTaiko/src/Stages/07.Game/Taiko/FlyingNotes.cs:90 — FlyingNotes.Draw has cognitive complexity 54 (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.
D2 · Cognitive Complexity · GpuRasterizer.BuildPieces (cognitive 53) · ×1
  • GpuRasterizer.BuildPieces (cognitive 53) OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:30 — GpuRasterizer.BuildPieces has cognitive complexity 53 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tValueInitialize (cognitive 53) · ×1
  • CStagePlayScreenCommon.tValueInitialize (cognitive 53) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4583 — CStagePlayScreenCommon.tValueInitialize has cognitive complexity 53 (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.
D2 · Cognitive Complexity · GpuRasterizer.EnsureGrassTile (cognitive 52) · ×1
  • GpuRasterizer.EnsureGrassTile (cognitive 52) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:57 — GpuRasterizer.EnsureGrassTile has cognitive complexity 52 (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.
D2 · Cognitive Complexity · LuaNetworking.HostHandshake (cognitive 52) · ×1
  • LuaNetworking.HostHandshake (cognitive 52) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:489 — LuaNetworking.HostHandshake 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.UpdateGauge (cognitive 52) · ×1
  • CStagePlayScreenCommon.UpdateGauge (cognitive 52) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1790 — CStagePlayScreenCommon.UpdateGauge 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.
D2 · Cognitive Complexity · DBSaves.RegisterPlay (cognitive 51) · ×1
  • DBSaves.RegisterPlay (cognitive 51) REDACTED:447 — DBSaves.RegisterPlay 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.
D2 · Cognitive Complexity · GpuRasterizer.EnsureGrass (cognitive 51) · ×1
  • GpuRasterizer.EnsureGrass (cognitive 51) OpenTaiko/src/Lua/3D/GpuRasterizer.Grass.cs:25 — GpuRasterizer.EnsureGrass has cognitive complexity 51 (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.
D2 · Cognitive Complexity · GpuRasterizer.BuildSprites (cognitive 50) · ×1
  • GpuRasterizer.BuildSprites (cognitive 50) OpenTaiko/src/Lua/3D/GpuRasterizer.Sprites.cs:13 — GpuRasterizer.BuildSprites 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.
D2 · Cognitive Complexity · CStageStartup.Draw (cognitive 50) · ×1
  • CStageStartup.Draw (cognitive 50) OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs:63 — CStageStartup.Draw 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.
D2 · Cognitive Complexity · GltfModel.Register (cognitive 49) · ×1
  • GltfModel.Register (cognitive 49) OpenTaiko/src/Lua/3D/GltfModel.cs:94 — GltfModel.Register has cognitive complexity 49 (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.
D2 · Cognitive Complexity · GltfModel.FitQuat (cognitive 49) · ×1
  • GltfModel.FitQuat (cognitive 49) OpenTaiko/src/Lua/3D/GltfModel.cs:291 — GltfModel.FitQuat has cognitive complexity 49 (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.
D2 · Cognitive Complexity · Aup2ScriptFile.ReadSetting (cognitive 49) · ×1
  • Aup2ScriptFile.ReadSetting (cognitive 49) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptFile.cs:143 — Aup2ScriptFile.ReadSetting has cognitive complexity 49 (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.
D2 · Cognitive Complexity · LuaSongList.GatherTree (cognitive 49) · ×1
  • LuaSongList.GatherTree (cognitive 49) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:99 — LuaSongList.GatherTree has cognitive complexity 49 (threshold 15). Of this number, 48 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.
D2 · Cognitive Complexity · CTja.tRandomizeTaikoChips (cognitive 49) · ×1
  • CTja.tRandomizeTaikoChips (cognitive 49) OpenTaiko/src/Songs/CTja.cs:850 — CTja.tRandomizeTaikoChips has cognitive complexity 49 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tRollProcess (cognitive 49) · ×1
  • CStagePlayScreenCommon.tRollProcess (cognitive 49) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1446 — CStagePlayScreenCommon.tRollProcess has cognitive complexity 49 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tCheckBgmDrift (cognitive 49) · ×1
  • CStagePlayScreenCommon.tCheckBgmDrift (cognitive 49) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2570 — CStagePlayScreenCommon.tCheckBgmDrift has cognitive complexity 49 (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.
D2 · Cognitive Complexity · CActImplComboBalloon.Draw (cognitive 49) · ×1
  • CActImplComboBalloon.Draw (cognitive 49) OpenTaiko/src/Stages/07.Game/Taiko/CActImplComboBalloon.cs:52 — CActImplComboBalloon.Draw has cognitive complexity 49 (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.
D2 · Cognitive Complexity · DBNameplateUnlockables.tLoadPack (cognitive 48) · ×1
  • DBNameplateUnlockables.tLoadPack (cognitive 48) OpenTaiko/src/Databases/DBNameplateUnlockables.cs:158 — DBNameplateUnlockables.tLoadPack has cognitive complexity 48 (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.
D2 · Cognitive Complexity · RtScene.UpdateTextures (cognitive 48) · ×1
  • RtScene.UpdateTextures (cognitive 48) OpenTaiko/src/Lua/3D/RtScene.cs:457 — RtScene.UpdateTextures has cognitive complexity 48 (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.
D2 · Cognitive Complexity · Aup2TextRaster.Layout (cognitive 48) · ×1
  • Aup2TextRaster.Layout (cognitive 48) OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:99 — Aup2TextRaster.Layout has cognitive complexity 48 (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.
D2 · Cognitive Complexity · Aup2TextRaster.Render (cognitive 48) · ×1
  • Aup2TextRaster.Render (cognitive 48) OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:242 — Aup2TextRaster.Render has cognitive complexity 48 (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.
D2 · Cognitive Complexity · LuaAviUtl2Project.SyncMedia (cognitive 48) · ×1
  • LuaAviUtl2Project.SyncMedia (cognitive 48) OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:476 — LuaAviUtl2Project.SyncMedia has cognitive complexity 48 (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.
D2 · Cognitive Complexity · CActImplBackground.Activate (cognitive 48) · ×1
  • CActImplBackground.Activate (cognitive 48) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBackground.cs:78 — CActImplBackground.Activate has cognitive complexity 48 (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.
D2 · Cognitive Complexity · CVideoDecoder.EnqueueFrames (cognitive 48) · ×1
  • CVideoDecoder.EnqueueFrames (cognitive 48) FDK/src/04.Graphics/CVideoDecoder.cs:460 — CVideoDecoder.EnqueueFrames has cognitive complexity 48 (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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.ClearBuffer (cognitive 47) · ×1
  • Aup2ScriptLibrary.ClearBuffer (cognitive 47) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1278 — Aup2ScriptLibrary.ClearBuffer has cognitive complexity 47 (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.
D2 · Cognitive Complexity · LuaHeightmapFunc.BuildTerrain (cognitive 47) · ×1
  • LuaHeightmapFunc.BuildTerrain (cognitive 47) OpenTaiko/src/Lua/Classes/LuaHeightmap.cs:86 — LuaHeightmapFunc.BuildTerrain has cognitive complexity 47 (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.
D2 · Cognitive Complexity · LuaSongListSettings.IsNodeExcludedAtGeneration (cognitive 47) · ×1
  • LuaSongListSettings.IsNodeExcludedAtGeneration (cognitive 47) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongListSettings.cs:104 — LuaSongListSettings.IsNodeExcludedAtGeneration has cognitive complexity 47 (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.
D2 · Cognitive Complexity · CActPlayScoreCommon.tSmallDisplay (cognitive 47) · ×1
  • CActPlayScoreCommon.tSmallDisplay (cognitive 47) OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:283 — CActPlayScoreCommon.tSmallDisplay has cognitive complexity 47 (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.
D2 · Cognitive Complexity · GpuRasterizer.RebuildMerged (cognitive 46) · ×1
  • GpuRasterizer.RebuildMerged (cognitive 46) OpenTaiko/src/Lua/3D/GpuRasterizer.Merge.cs:60 — GpuRasterizer.RebuildMerged has cognitive complexity 46 (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.
D2 · Cognitive Complexity · CSkiaSharpTextRenderer.DrawText (cognitive 46) · ×1
  • CSkiaSharpTextRenderer.DrawText (cognitive 46) FDK/src/04.Graphics/TextRenderer/CSkiaSharpTextRenderer.cs:219 — CSkiaSharpTextRenderer.DrawText has cognitive complexity 46 (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.
D2 · Cognitive Complexity · Aup2Evaluator.Survey (cognitive 45) · ×1
  • Aup2Evaluator.Survey (cognitive 45) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:399 — Aup2Evaluator.Survey has cognitive complexity 45 (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.
D2 · Cognitive Complexity · LuaCanvas.FillPolygon (cognitive 45) · ×1
  • LuaCanvas.FillPolygon (cognitive 45) OpenTaiko/src/Lua/Classes/LuaCanvas.cs:479 — LuaCanvas.FillPolygon has cognitive complexity 45 (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.
D2 · Cognitive Complexity · GpuRasterizer.BuildLightGrid (cognitive 44) · ×1
  • GpuRasterizer.BuildLightGrid (cognitive 44) OpenTaiko/src/Lua/3D/GpuRasterizer.LightGrid.cs:25 — GpuRasterizer.BuildLightGrid has cognitive complexity 44 (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.
D2 · Cognitive Complexity · LuaGlyphText.Compose (cognitive 44) · ×1
  • LuaGlyphText.Compose (cognitive 44) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:409 — LuaGlyphText.Compose has cognitive complexity 44 (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.
D2 · Cognitive Complexity · LuaNetworking.OnJoinerOffer (cognitive 44) · ×1
  • LuaNetworking.OnJoinerOffer (cognitive 44) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:765 — LuaNetworking.OnJoinerOffer has cognitive complexity 44 (threshold 15). Of this number, 24 points are the body's own statements and 20 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CStagePlayScreenCommon.ProcessBalloonBroke (cognitive 44) · ×1
  • CStagePlayScreenCommon.ProcessBalloonBroke (cognitive 44) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4146 — CStagePlayScreenCommon.ProcessBalloonBroke has cognitive complexity 44 (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.
D2 · Cognitive Complexity · Rainbow.Draw (cognitive 44) · ×1
  • Rainbow.Draw (cognitive 44) OpenTaiko/src/Stages/07.Game/Taiko/Rainbow.cs:56 — Rainbow.Draw has cognitive complexity 44 (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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.Poly (cognitive 43) · ×1
  • Aup2ScriptLibrary.Poly (cognitive 43) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:727 — Aup2ScriptLibrary.Poly 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.
D2 · Cognitive Complexity · CActImplRollEffect.Draw (cognitive 43) · ×1
  • CActImplRollEffect.Draw (cognitive 43) OpenTaiko/src/Stages/07.Game/Taiko/CActImplRollEffect.cs:86 — CActImplRollEffect.Draw has cognitive complexity 43 (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.
D2 · Cognitive Complexity · CStageTransition.Draw (cognitive 43) · ×1
  • CStageTransition.Draw (cognitive 43) OpenTaiko/src/Stages/11.Transition/CStageTransition.cs:185 — CStageTransition.Draw has cognitive complexity 43 (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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.PushSettings (cognitive 42) · ×1
  • Aup2ScriptLibrary.PushSettings (cognitive 42) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:457 — Aup2ScriptLibrary.PushSettings 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.
D2 · Cognitive Complexity · CActPlayComboCommon.Draw (cognitive 42) · ×1
  • CActPlayComboCommon.Draw (cognitive 42) OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:553 — CActPlayComboCommon.Draw 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.
D2 · Cognitive Complexity · GpuRasterizer.GatherObjects (cognitive 41) · ×1
  • GpuRasterizer.GatherObjects (cognitive 41) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:243 — GpuRasterizer.GatherObjects has cognitive complexity 41 (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.
D2 · Cognitive Complexity · Aup2ScriptFile.Portable (cognitive 41) · ×1
  • Aup2ScriptFile.Portable (cognitive 41) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptFile.cs:319 — Aup2ScriptFile.Portable has cognitive complexity 41 (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.
D2 · Cognitive Complexity · LuaNetworking.JoinRoom (cognitive 41) · ×1
  • LuaNetworking.JoinRoom (cognitive 41) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:231 — LuaNetworking.JoinRoom has cognitive complexity 41 (threshold 15). Of this number, 24 points are the body's own statements and 17 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OnlinePlaySync.Tick (cognitive 41) · ×1
  • OnlinePlaySync.Tick (cognitive 41) OpenTaiko/src/Lua/Networking/OnlinePlaySync.cs:88 — OnlinePlaySync.Tick has cognitive complexity 41 (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.
D2 · Cognitive Complexity · GpuRasterizer.SpreadColour (cognitive 39) · ×1
  • GpuRasterizer.SpreadColour (cognitive 39) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:72 — GpuRasterizer.SpreadColour has cognitive complexity 39 (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.
D2 · Cognitive Complexity · Rasterizer.ProjectParticles (cognitive 39) · ×1
  • Rasterizer.ProjectParticles (cognitive 39) OpenTaiko/src/Lua/3D/Rasterizer.cs:650 — Rasterizer.ProjectParticles has cognitive complexity 39 (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.
D2 · Cognitive Complexity · TextureLoader.LoadTexture (cognitive 39) · ×1
  • TextureLoader.LoadTexture (cognitive 39) OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:257 — TextureLoader.LoadTexture has cognitive complexity 39 (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.
D2 · Cognitive Complexity · COsu.Parse (cognitive 38) · ×1
  • COsu.Parse (cognitive 38) OpenTaiko/src/Songs/COsu.cs:96 — COsu.Parse has cognitive complexity 38 (threshold 15). Of this number, 19 points are the body's own statements and 19 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CActImplDancer.LoadDancerConifg (cognitive 38) · ×1
  • CActImplDancer.LoadDancerConifg (cognitive 38) OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:244 — CActImplDancer.LoadDancerConifg has cognitive complexity 38 (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.
D2 · Cognitive Complexity · CFontRenderer.DrawText_V (cognitive 37) · ×1
  • CFontRenderer.DrawText_V (cognitive 37) FDK/src/04.Graphics/TextRenderer/CFontRenderer.cs:193 — CFontRenderer.DrawText_V 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.
D2 · Cognitive Complexity · check.main (cognitive 37) · ×1
  • check.main (cognitive 37) OpenTaiko/docs/check.py:42 — check.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), ternaries 4 (10 pts), loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ObjModel.LoadUncached (cognitive 36) · ×1
  • ObjModel.LoadUncached (cognitive 36) OpenTaiko/src/Lua/3D/ObjModel.cs:95 — ObjModel.LoadUncached 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.
D2 · Cognitive Complexity · VehicleBody.UpdateWheels (cognitive 36) · ×1
  • VehicleBody.UpdateWheels (cognitive 36) OpenTaiko/src/Lua/3D/Physics/PhysicsVehicle.cs:83 — VehicleBody.UpdateWheels 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.
D2 · Cognitive Complexity · Aup2TextRaster.Tag (cognitive 36) · ×1
  • Aup2TextRaster.Tag (cognitive 36) OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:189 — Aup2TextRaster.Tag 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.
D2 · Cognitive Complexity · CEnumSongs.LoadSongListStructure (cognitive 36) · ×1
  • CEnumSongs.LoadSongListStructure (cognitive 36) OpenTaiko/src/Stages/02.Title/CEnumSongs.cs:251 — CEnumSongs.LoadSongListStructure 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.
D2 · Cognitive Complexity · CActImplBalloon.OnProgressDraw (cognitive 36) · ×1
  • CActImplBalloon.OnProgressDraw (cognitive 36) OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.cs:99 — CActImplBalloon.OnProgressDraw 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.
D2 · Cognitive Complexity · CActImplChipEffects.Draw (cognitive 36) · ×1
  • CActImplChipEffects.Draw (cognitive 36) OpenTaiko/src/Stages/07.Game/Taiko/CActImplChipEffects.cs:53 — CActImplChipEffects.Draw 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.
D2 · Cognitive Complexity · NotesManager.DisplayRoll (cognitive 36) · ×1
  • NotesManager.DisplayRoll (cognitive 36) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:568 — NotesManager.DisplayRoll has cognitive complexity 36 (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.
D2 · Cognitive Complexity · AngleContext.AngleContext.ctor (cognitive 36) · ×1
  • AngleContext.AngleContext.ctor (cognitive 36) FDK/src/01.Framework/Rendering/Angle/AngleContext.cs:27 — AngleContext.AngleContext.ctor has cognitive complexity 36 (threshold 15). Of this number, 32 points are the body's own statements and 4 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.
D2 · Cognitive Complexity · LuaCanvas.ExtendEdges (cognitive 35) · ×1
  • LuaCanvas.ExtendEdges (cognitive 35) OpenTaiko/src/Lua/Classes/LuaCanvas.cs:534 — LuaCanvas.ExtendEdges has cognitive complexity 35 (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.
D2 · Cognitive Complexity · LuaNetworking.DeliverMessage (cognitive 35) · ×1
  • LuaNetworking.DeliverMessage (cognitive 35) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1292 — LuaNetworking.DeliverMessage has cognitive complexity 35 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tBranchProcess (cognitive 35) · ×1
  • CStagePlayScreenCommon.tBranchProcess (cognitive 35) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4383 — CStagePlayScreenCommon.tBranchProcess has cognitive complexity 35 (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.
D2 · Cognitive Complexity · CActImplLaneTaiko.DrawBranchText (cognitive 35) · ×1
  • CActImplLaneTaiko.DrawBranchText (cognitive 35) OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:298 — CActImplLaneTaiko.DrawBranchText has cognitive complexity 35 (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.
D2 · Cognitive Complexity · Builder.GatherObjLights (cognitive 34) · ×1
  • Builder.GatherObjLights (cognitive 34) OpenTaiko/src/Lua/3D/Rasterizer.cs:298 — Builder.GatherObjLights has cognitive complexity 34 (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.
D2 · Cognitive Complexity · CTja.tWAVLoad (cognitive 34) · ×1
  • CTja.tWAVLoad (cognitive 34) OpenTaiko/src/Songs/CTja.cs:733 — CTja.tWAVLoad has cognitive complexity 34 (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.
D2 · Cognitive Complexity · CActPlayComboSound.Activate (cognitive 34) · ×1
  • CActPlayComboSound.Activate (cognitive 34) OpenTaiko/src/Stages/07.Game/CActPlayComboSound.cs:45 — CActPlayComboSound.Activate has cognitive complexity 34 (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.
D2 · Cognitive Complexity · CActImplRunner.LoadRunnerConifg (cognitive 34) · ×1
  • CActImplRunner.LoadRunnerConifg (cognitive 34) OpenTaiko/src/Stages/07.Game/Taiko/CActImplRunner.cs:156 — CActImplRunner.LoadRunnerConifg has cognitive complexity 34 (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.
D2 · Cognitive Complexity · GlyphTextLayout.Wrap (cognitive 33) · ×1
  • GlyphTextLayout.Wrap (cognitive 33) OpenTaiko/src/Common/GlyphTextLayout.cs:88 — GlyphTextLayout.Wrap 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.
D2 · Cognitive Complexity · GltfModel.SampleNode (cognitive 33) · ×1
  • GltfModel.SampleNode (cognitive 33) OpenTaiko/src/Lua/3D/GltfModel.cs:671 — GltfModel.SampleNode 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.
D2 · Cognitive Complexity · Aup2MonoMix.Set (cognitive 33) · ×1
  • Aup2MonoMix.Set (cognitive 33) OpenTaiko/src/Lua/AviUtl2/Aup2Audio.cs:70 — Aup2MonoMix.Set 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.
D2 · Cognitive Complexity · Aup2Renderer.Compose (cognitive 33) · ×1
  • Aup2Renderer.Compose (cognitive 33) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:303 — Aup2Renderer.Compose 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.
D2 · Cognitive Complexity · Aup2Renderer.Draw (cognitive 33) · ×1
  • Aup2Renderer.Draw (cognitive 33) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:773 — Aup2Renderer.Draw 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.
D2 · Cognitive Complexity · CSongManager.LoadChartInfo (cognitive 33) · ×1
  • CSongManager.LoadChartInfo (cognitive 33) OpenTaiko/src/Songs/CSongManager.cs:586 — CSongManager.LoadChartInfo has cognitive complexity 33 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tBalloonProcess (cognitive 33) · ×1
  • CStagePlayScreenCommon.tBalloonProcess (cognitive 33) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1538 — CStagePlayScreenCommon.tBalloonProcess 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.
D2 · Cognitive Complexity · AIBattle.Draw (cognitive 33) · ×1
  • AIBattle.Draw (cognitive 33) OpenTaiko/src/Stages/07.Game/Taiko/AIBattle.cs:40 — AIBattle.Draw 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.
D2 · Cognitive Complexity · CActImplLaneTaiko.DrawBranchBG (cognitive 33) · ×1
  • CActImplLaneTaiko.DrawBranchBG (cognitive 33) OpenTaiko/src/Stages/07.Game/Taiko/CActImplLaneTaiko.cs:365 — CActImplLaneTaiko.DrawBranchBG 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.
D2 · Cognitive Complexity · NotesManager.DisplayNote (cognitive 33) · ×1
  • NotesManager.DisplayNote (cognitive 33) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:514 — NotesManager.DisplayNote 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.
D2 · Cognitive Complexity · HGaugeMethods.UNSAFE_DrawGaugeFast (cognitive 32) · ×1
  • HGaugeMethods.UNSAFE_DrawGaugeFast (cognitive 32) OpenTaiko/src/Helpers/HGaugeMethods.cs:465 — HGaugeMethods.UNSAFE_DrawGaugeFast has cognitive complexity 32 (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.
D2 · Cognitive Complexity · AIHitPlanner.PlanNote (cognitive 32) · ×1
  • AIHitPlanner.PlanNote (cognitive 32) OpenTaiko/src/Stages/07.Game/AIBattle/AIHitPlanner.cs:211 — AIHitPlanner.PlanNote 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.AutoJudge (cognitive 32) · ×1
  • CStagePlayScreenCommon.AutoJudge (cognitive 32) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3833 — CStagePlayScreenCommon.AutoJudge has cognitive complexity 32 (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.
D2 · Cognitive Complexity · CVideoDecoder.GetNowFrame (cognitive 32) · ×1
  • CVideoDecoder.GetNowFrame (cognitive 32) FDK/src/04.Graphics/CVideoDecoder.cs:389 — CVideoDecoder.GetNowFrame has cognitive complexity 32 (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.
D2 · Cognitive Complexity · GpuRasterizer.DrawTerrainObj (cognitive 31) · ×1
  • GpuRasterizer.DrawTerrainObj (cognitive 31) OpenTaiko/src/Lua/3D/GpuRasterizer.Terrain.cs:109 — GpuRasterizer.DrawTerrainObj has cognitive complexity 31 (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.
D2 · Cognitive Complexity · Lua3DScene.DrawLine (cognitive 31) · ×1
  • Lua3DScene.DrawLine (cognitive 31) OpenTaiko/src/Lua/3D/Lua3DScene.Display.cs:24 — Lua3DScene.DrawLine has cognitive complexity 31 (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.
D2 · Cognitive Complexity · MiniMqtt.RxLoop (cognitive 31) · ×1
  • MiniMqtt.RxLoop (cognitive 31) OpenTaiko/src/Lua/Networking/MiniMqtt.cs:94 — MiniMqtt.RxLoop has cognitive complexity 31 (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.
D2 · Cognitive Complexity · CActImplScoreRank.Draw (cognitive 31) · ×1
  • CActImplScoreRank.Draw (cognitive 31) OpenTaiko/src/Stages/07.Game/Taiko/CActImplScoreRank.cs:118 — CActImplScoreRank.Draw has cognitive complexity 31 (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.
D2 · Cognitive Complexity · CSoundDeviceWASAPI.CSoundDeviceWASAPI.ctor (cognitive 31) · ×1
  • CSoundDeviceWASAPI.CSoundDeviceWASAPI.ctor (cognitive 31) FDK/src/03.Sound/CSoundDeviceWASAPI.cs:113 — CSoundDeviceWASAPI.CSoundDeviceWASAPI.ctor has cognitive complexity 31 (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.
D2 · Cognitive Complexity · GltfModel.EnsureJoints (cognitive 30) · ×1
  • GltfModel.EnsureJoints (cognitive 30) OpenTaiko/src/Lua/3D/GltfModel.cs:339 — GltfModel.EnsureJoints 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.
D2 · Cognitive Complexity · GpuRasterizer.GatherCasters (cognitive 30) · ×1
  • GpuRasterizer.GatherCasters (cognitive 30) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:180 — GpuRasterizer.GatherCasters 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.
D2 · Cognitive Complexity · GpuRasterizer.PieceInView (cognitive 30) · ×1
  • GpuRasterizer.PieceInView (cognitive 30) OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:164 — GpuRasterizer.PieceInView 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.
D2 · Cognitive Complexity · Rasterizer.TurnedParticle (cognitive 30) · ×1
  • Rasterizer.TurnedParticle (cognitive 30) OpenTaiko/src/Lua/3D/Rasterizer.cs:753 — Rasterizer.TurnedParticle 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. Note what this body is, though: it works in explicit hardware vector and instruction-set types, and it works in raw pointers or stack-allocated memory, whose lifetime is this stack frame. 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. Anything extracted from it has to take that memory as a parameter rather than reach for it. 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.
D2 · Cognitive Complexity · Raytracer.Occluded (cognitive 30) · ×1
  • Raytracer.Occluded (cognitive 30) OpenTaiko/src/Lua/3D/Raytracer.cs:369 — Raytracer.Occluded 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.Load (cognitive 30) · ×1
  • Aup2ScriptLibrary.Load (cognitive 30) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:823 — Aup2ScriptLibrary.Load has cognitive complexity 30 (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.
D2 · Cognitive Complexity · LuaNetworking.StartSignalHostLoop (cognitive 30) · ×1
  • LuaNetworking.StartSignalHostLoop (cognitive 30) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:726 — LuaNetworking.StartSignalHostLoop has cognitive complexity 30 (threshold 15). Most of this is not in the body itself: 5 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 740). 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.
D2 · Cognitive Complexity · LuaNetworking.ClientHandshake (cognitive 30) · ×1
  • LuaNetworking.ClientHandshake (cognitive 30) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1018 — LuaNetworking.ClientHandshake has cognitive complexity 30 (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.
D2 · Cognitive Complexity · VTTParser.CreateLyric (cognitive 30) · ×1
  • VTTParser.CreateLyric (cognitive 30) OpenTaiko/src/Songs/VTTParser.cs:356 — VTTParser.CreateLyric 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.
D2 · Cognitive Complexity · TextureLoader.tPlayNeeds (cognitive 30) · ×1
  • TextureLoader.tPlayNeeds (cognitive 30) OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:108 — TextureLoader.tPlayNeeds 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.
D2 · Cognitive Complexity · CActImplCharacter.Draw (cognitive 30) · ×1
  • CActImplCharacter.Draw (cognitive 30) OpenTaiko/src/Stages/07.Game/Taiko/CActImplCharacter.cs:143 — CActImplCharacter.Draw 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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.JudgePadInput (cognitive 30) · ×1
  • CStagePlayDrumsScreen.JudgePadInput (cognitive 30) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1126 — CStagePlayDrumsScreen.JudgePadInput has cognitive complexity 30 (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.
D2 · Cognitive Complexity · FFVideoWriter.MuxWithAudio (cognitive 29) · ×1
  • FFVideoWriter.MuxWithAudio (cognitive 29) OpenTaiko/src/Common/VideoExporter.cs:706 — FFVideoWriter.MuxWithAudio has cognitive complexity 29 (threshold 15). Of this number, 16 points are the body's own statements and 13 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GpuRasterizer.DrawWorld (cognitive 29) · ×1
  • GpuRasterizer.DrawWorld (cognitive 29) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:291 — GpuRasterizer.DrawWorld 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.
D2 · Cognitive Complexity · PhysicsWorld.ResolveDynamic (cognitive 29) · ×1
  • PhysicsWorld.ResolveDynamic (cognitive 29) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:429 — PhysicsWorld.ResolveDynamic 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.
D2 · Cognitive Complexity · Rasterizer.FXAABand (cognitive 29) · ×1
  • Rasterizer.FXAABand (cognitive 29) OpenTaiko/src/Lua/3D/Rasterizer.cs:799 — Rasterizer.FXAABand 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.
D2 · Cognitive Complexity · Aup2SampleTable.Decode (cognitive 29) · ×1
  • Aup2SampleTable.Decode (cognitive 29) OpenTaiko/src/Lua/AviUtl2/Aup2Audio.cs:174 — Aup2SampleTable.Decode 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.
D2 · Cognitive Complexity · Aup2Objects.Waveform (cognitive 29) · ×1
  • Aup2Objects.Waveform (cognitive 29) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:668 — Aup2Objects.Waveform 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.CopyBuffer (cognitive 29) · ×1
  • Aup2ScriptLibrary.CopyBuffer (cognitive 29) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1244 — Aup2ScriptLibrary.CopyBuffer has cognitive complexity 29 (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.
D2 · Cognitive Complexity · LuaSongList.ReloadSongList (cognitive 29) · ×1
  • LuaSongList.ReloadSongList (cognitive 29) OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:13 — LuaSongList.ReloadSongList has cognitive complexity 29 (threshold 15). Of this number, 26 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CTExpression.ParseComparison (cognitive 29) · ×1
  • CTExpression.ParseComparison (cognitive 29) OpenTaiko/src/Songs/TJA/TriggersCounters/CTExpression.cs:128 — CTExpression.ParseComparison 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.
D2 · Cognitive Complexity · CActPlayPanelString.SetPanelString (cognitive 29) · ×1
  • CActPlayPanelString.SetPanelString (cognitive 29) OpenTaiko/src/Stages/07.Game/CActPlayPanelString.cs:28 — CActPlayPanelString.SetPanelString 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.
D2 · Cognitive Complexity · CActTaikoScrollSpeed.Draw (cognitive 29) · ×1
  • CActTaikoScrollSpeed.Draw (cognitive 29) OpenTaiko/src/Stages/07.Game/CActTaikoScrollSpeed.cs:30 — CActTaikoScrollSpeed.Draw 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.
D2 · Cognitive Complexity · CActImplRoll.OnProgressDraw (cognitive 29) · ×1
  • CActImplRoll.OnProgressDraw (cognitive 29) OpenTaiko/src/Stages/07.Game/Taiko/CActImplRoll.cs:48 — CActImplRoll.OnProgressDraw 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.
D2 · Cognitive Complexity · GpuRasterizer.UploadTexture (cognitive 28) · ×1
  • GpuRasterizer.UploadTexture (cognitive 28) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:17 — GpuRasterizer.UploadTexture 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.
D2 · Cognitive Complexity · GpuRasterizer.BuildQueue (cognitive 28) · ×1
  • GpuRasterizer.BuildQueue (cognitive 28) OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:121 — GpuRasterizer.BuildQueue 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.
D2 · Cognitive Complexity · Raytracer.Closest (cognitive 28) · ×1
  • Raytracer.Closest (cognitive 28) OpenTaiko/src/Lua/3D/Raytracer.cs:313 — Raytracer.Closest 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.
D2 · Cognitive Complexity · Aup2Document.Parse (cognitive 28) · ×1
  • Aup2Document.Parse (cognitive 28) OpenTaiko/src/Lua/AviUtl2/Aup2Document.cs:133 — Aup2Document.Parse 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.
D2 · Cognitive Complexity · CTja.PlanToAddMixerChannel (cognitive 28) · ×1
  • CTja.PlanToAddMixerChannel (cognitive 28) OpenTaiko/src/Songs/CTja.cs:4399 — CTja.PlanToAddMixerChannel 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.
D2 · Cognitive Complexity · CActPlayGaugeCommon.Init (cognitive 28) · ×1
  • CActPlayGaugeCommon.Init (cognitive 28) OpenTaiko/src/Stages/07.Game/CActPlayGaugeCommon.cs:64 — CActPlayGaugeCommon.Init has cognitive complexity 28 (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.
D2 · Cognitive Complexity · Dan_Cert.GetResultExamStatus (cognitive 28) · ×1
  • Dan_Cert.GetResultExamStatus (cognitive 28) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1314 — Dan_Cert.GetResultExamStatus 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.
D2 · Cognitive Complexity · GlyphTextLayout.Tokenize (cognitive 27) · ×1
  • GlyphTextLayout.Tokenize (cognitive 27) OpenTaiko/src/Common/GlyphTextLayout.cs:28 — GlyphTextLayout.Tokenize 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.
D2 · Cognitive Complexity · ImGuiDebugWindow.CResourcePopup (cognitive 27) · ×1
  • ImGuiDebugWindow.CResourcePopup (cognitive 27) OpenTaiko/src/Common/ImGuiDebugWindow.cs:703 — ImGuiDebugWindow.CResourcePopup has cognitive complexity 27 (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.
D2 · Cognitive Complexity · VideoExporter.Tick (cognitive 27) · ×1
  • VideoExporter.Tick (cognitive 27) OpenTaiko/src/Common/VideoExporter.cs:165 — VideoExporter.Tick 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.
D2 · Cognitive Complexity · GpuRaytracer.BuildAtlas (cognitive 27) · ×1
  • GpuRaytracer.BuildAtlas (cognitive 27) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:411 — GpuRaytracer.BuildAtlas 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.
D2 · Cognitive Complexity · GpuRaytracer.Skyline (cognitive 27) · ×1
  • GpuRaytracer.Skyline (cognitive 27) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:520 — GpuRaytracer.Skyline 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.AutorollBalloon (cognitive 27) · ×1
  • CStagePlayScreenCommon.AutorollBalloon (cognitive 27) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1361 — CStagePlayScreenCommon.AutorollBalloon has cognitive complexity 27 (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.
D2 · Cognitive Complexity · CActImplRunner.Draw (cognitive 27) · ×1
  • CActImplRunner.Draw (cognitive 27) OpenTaiko/src/Stages/07.Game/Taiko/CActImplRunner.cs:97 — CActImplRunner.Draw 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.
D2 · Cognitive Complexity · CFrameProfiler.Report (cognitive 27) · ×1
  • CFrameProfiler.Report (cognitive 27) FDK/src/01.Framework/Core/CFrameProfiler.cs:303 — CFrameProfiler.Report 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.
D2 · Cognitive Complexity · ImGuiDebugWindow.Resources (cognitive 26) · ×1
  • ImGuiDebugWindow.Resources (cognitive 26) OpenTaiko/src/Common/ImGuiDebugWindow.cs:589 — ImGuiDebugWindow.Resources 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.
D2 · Cognitive Complexity · CUnlockSP.tConditionMessage (cognitive 26) · ×1
  • CUnlockSP.tConditionMessage (cognitive 26) OpenTaiko/src/Components/UnlockConditions/CUnlockSP.cs:26 — CUnlockSP.tConditionMessage 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.
D2 · Cognitive Complexity · GltfModel.Pose (cognitive 26) · ×1
  • GltfModel.Pose (cognitive 26) OpenTaiko/src/Lua/3D/GltfModel.cs:192 — GltfModel.Pose 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.
D2 · Cognitive Complexity · GpuRasterizer.SpriteMips (cognitive 26) · ×1
  • GpuRasterizer.SpriteMips (cognitive 26) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:99 — GpuRasterizer.SpriteMips has cognitive complexity 26 (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.
D2 · Cognitive Complexity · LuaCanvas.PasteTextureTransformed (cognitive 26) · ×1
  • LuaCanvas.PasteTextureTransformed (cognitive 26) OpenTaiko/src/Lua/Classes/LuaCanvas.cs:155 — LuaCanvas.PasteTextureTransformed 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.
D2 · Cognitive Complexity · LuaGlyphText.Draw (cognitive 26) · ×1
  • LuaGlyphText.Draw (cognitive 26) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:343 — LuaGlyphText.Draw 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.
D2 · Cognitive Complexity · COsu.ParseHitObject (cognitive 26) · ×1
  • COsu.ParseHitObject (cognitive 26) OpenTaiko/src/Songs/COsu.cs:176 — COsu.ParseHitObject 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.
D2 · Cognitive Complexity · TextureLoader.LoadNotesSkinTexturesCore (cognitive 26) · ×1
  • TextureLoader.LoadNotesSkinTexturesCore (cognitive 26) OpenTaiko/src/Stages/01.StartUp/TextureLoader.cs:772 — TextureLoader.LoadNotesSkinTexturesCore has cognitive complexity 26 (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.
D2 · Cognitive Complexity · CActImplCharacter.OnDraw_Balloon (cognitive 26) · ×1
  • CActImplCharacter.OnDraw_Balloon (cognitive 26) OpenTaiko/src/Stages/07.Game/Taiko/CActImplCharacter.cs:477 — CActImplCharacter.OnDraw_Balloon 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.
D2 · Cognitive Complexity · CActImplPad.Draw (cognitive 26) · ×1
  • CActImplPad.Draw (cognitive 26) OpenTaiko/src/Stages/07.Game/Taiko/CActImplPad.cs:43 — CActImplPad.Draw 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.
D2 · Cognitive Complexity · Dan_Cert.Update (cognitive 26) · ×1
  • Dan_Cert.Update (cognitive 26) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:194 — Dan_Cert.Update 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.
D2 · Cognitive Complexity · CStageResult.tDanResultInfo (cognitive 26) · ×1
  • CStageResult.tDanResultInfo (cognitive 26) OpenTaiko/src/Stages/08.Result/CStageResult.cs:156 — CStageResult.tDanResultInfo has cognitive complexity 26 (threshold 15). Of this number, 19 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AssetExtractor.EnsureExtracted (cognitive 26) · ×1
  • AssetExtractor.EnsureExtracted (cognitive 26) REDACTED:18 — AssetExtractor.EnsureExtracted 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.
D2 · Cognitive Complexity · OpenTaiko.tStartupProcess (cognitive 25) · ×1
  • OpenTaiko.tStartupProcess (cognitive 25) OpenTaiko/src/Common/OpenTaiko.cs:1422 — OpenTaiko.tStartupProcess has cognitive complexity 25 (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.
D2 · Cognitive Complexity · GpuRasterizer.AddCaster (cognitive 25) · ×1
  • GpuRasterizer.AddCaster (cognitive 25) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:225 — GpuRasterizer.AddCaster has cognitive complexity 25 (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.
D2 · Cognitive Complexity · GpuRaytracer.UploadScene (cognitive 25) · ×1
  • GpuRaytracer.UploadScene (cognitive 25) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:367 — GpuRaytracer.UploadScene has cognitive complexity 25 (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.
D2 · Cognitive Complexity · GpuRaytracer.SlotBytes (cognitive 25) · ×1
  • GpuRaytracer.SlotBytes (cognitive 25) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:473 — GpuRaytracer.SlotBytes has cognitive complexity 25 (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.
D2 · Cognitive Complexity · Aup2FiltersBlur.Glow (cognitive 25) · ×1
  • Aup2FiltersBlur.Glow (cognitive 25) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersBlur.cs:445 — Aup2FiltersBlur.Glow has cognitive complexity 25 (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.
D2 · Cognitive Complexity · Aup2FiltersMotion.Wipe (cognitive 25) · ×1
  • Aup2FiltersMotion.Wipe (cognitive 25) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:194 — Aup2FiltersMotion.Wipe has cognitive complexity 25 (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.
D2 · Cognitive Complexity · Aup2Objects.Trail (cognitive 25) · ×1
  • Aup2Objects.Trail (cognitive 25) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:747 — Aup2Objects.Trail has cognitive complexity 25 (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.
D2 · Cognitive Complexity · LuaNetworking.RecoverLoop (cognitive 25) · ×1
  • LuaNetworking.RecoverLoop (cognitive 25) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1151 — LuaNetworking.RecoverLoop has cognitive complexity 25 (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.
D2 · Cognitive Complexity · CTja.tWavePlaybackPositionAutoCorrection (cognitive 25) · ×1
  • CTja.tWavePlaybackPositionAutoCorrection (cognitive 25) OpenTaiko/src/Songs/CTja.cs:693 — CTja.tWavePlaybackPositionAutoCorrection has cognitive complexity 25 (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.
D2 · Cognitive Complexity · CTja.GetBranchJudgeChipTime (cognitive 25) · ×1
  • CTja.GetBranchJudgeChipTime (cognitive 25) OpenTaiko/src/Songs/CTja.cs:3062 — CTja.GetBranchJudgeChipTime has cognitive complexity 25 (threshold 15). Of this number, 22 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AIHitTiming.Lands (cognitive 25) · ×1
  • AIHitTiming.Lands (cognitive 25) OpenTaiko/src/Stages/07.Game/AIBattle/AIHitTiming.cs:21 — AIHitTiming.Lands has cognitive complexity 25 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.RemoveNowProcessingRollChip (cognitive 25) · ×1
  • CStagePlayScreenCommon.RemoveNowProcessingRollChip (cognitive 25) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4223 — CStagePlayScreenCommon.RemoveNowProcessingRollChip has cognitive complexity 25 (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.
D2 · Cognitive Complexity · CActImplJudgeText.Draw (cognitive 25) · ×1
  • CActImplJudgeText.Draw (cognitive 25) OpenTaiko/src/Stages/07.Game/Taiko/CActImplJudgeText.cs:29 — CActImplJudgeText.Draw has cognitive complexity 25 (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.
D2 · Cognitive Complexity · Dan_Cert.Start (cognitive 25) · ×1
  • Dan_Cert.Start (cognitive 25) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:30 — Dan_Cert.Start has cognitive complexity 25 (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.
D2 · Cognitive Complexity · CNamePlate.tNamePlateRefreshTitles (cognitive 25) · ×1
  • CNamePlate.tNamePlateRefreshTitles (cognitive 25) OpenTaiko/src/Stages/CNamePlate.cs:34 — CNamePlate.tNamePlateRefreshTitles has cognitive complexity 25 (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.
D2 · Cognitive Complexity · CFrameProfiler.Pick (cognitive 25) · ×1
  • CFrameProfiler.Pick (cognitive 25) FDK/src/01.Framework/Core/CFrameProfiler.cs:278 — CFrameProfiler.Pick has cognitive complexity 25 (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.
D2 · Cognitive Complexity · Data.tFactorizeBestPlays (cognitive 24) · ×1
  • Data.tFactorizeBestPlays (cognitive 24) OpenTaiko/src/Common/SaveFile.cs:320 — Data.tFactorizeBestPlays 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.
D2 · Cognitive Complexity · FFVideoWriter.InitFfmpeg (cognitive 24) · ×1
  • FFVideoWriter.InitFfmpeg (cognitive 24) OpenTaiko/src/Common/VideoExporter.cs:608 — FFVideoWriter.InitFfmpeg 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.
D2 · Cognitive Complexity · CUnlockSP.tGetCountChartsPassingCondition (cognitive 24) · ×1
  • CUnlockSP.tGetCountChartsPassingCondition (cognitive 24) OpenTaiko/src/Components/UnlockConditions/CUnlockSP.cs:76 — CUnlockSP.tGetCountChartsPassingCondition 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.
D2 · Cognitive Complexity · GltfModel.TransformNormals (cognitive 24) · ×1
  • GltfModel.TransformNormals (cognitive 24) OpenTaiko/src/Lua/3D/GltfModel.cs:528 — GltfModel.TransformNormals 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.
D2 · Cognitive Complexity · GpuRasterizer.BuildCasters (cognitive 24) · ×1
  • GpuRasterizer.BuildCasters (cognitive 24) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:150 — GpuRasterizer.BuildCasters 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.
D2 · Cognitive Complexity · LuaAviUtl2Project.Resolve (cognitive 24) · ×1
  • LuaAviUtl2Project.Resolve (cognitive 24) OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:73 — LuaAviUtl2Project.Resolve has cognitive complexity 24 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.GetNowPBPMPoint (cognitive 24) · ×1
  • CStagePlayScreenCommon.GetNowPBPMPoint (cognitive 24) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4439 — CStagePlayScreenCommon.GetNowPBPMPoint 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.
D2 · Cognitive Complexity · CActImplCharacter.ReturnDefaultAnime (cognitive 24) · ×1
  • CActImplCharacter.ReturnDefaultAnime (cognitive 24) OpenTaiko/src/Stages/07.Game/Taiko/CActImplCharacter.cs:737 — CActImplCharacter.ReturnDefaultAnime 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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.HideObscuringRoll (cognitive 24) · ×1
  • CStagePlayDrumsScreen.HideObscuringRoll (cognitive 24) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:1402 — CStagePlayDrumsScreen.HideObscuringRoll has cognitive complexity 24 (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.
D2 · Cognitive Complexity · CStageOnlineLounge.DownloadSong (cognitive 24) · ×1
  • CStageOnlineLounge.DownloadSong (cognitive 24) OpenTaiko/src/Stages/12.OnlineLounge/CStageOnlineLounge.cs:522 — CStageOnlineLounge.DownloadSong 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.
D2 · Cognitive Complexity · GltfModel.GetBounds (cognitive 23) · ×1
  • GltfModel.GetBounds (cognitive 23) OpenTaiko/src/Lua/3D/GltfModel.cs:619 — GltfModel.GetBounds has cognitive complexity 23 (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.
D2 · Cognitive Complexity · GpuRasterizer.DrawObj (cognitive 23) · ×1
  • GpuRasterizer.DrawObj (cognitive 23) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:352 — GpuRasterizer.DrawObj has cognitive complexity 23 (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.
D2 · Cognitive Complexity · Raytracer.DirectLight (cognitive 23) · ×1
  • Raytracer.DirectLight (cognitive 23) OpenTaiko/src/Lua/3D/Raytracer.cs:226 — Raytracer.DirectLight has cognitive complexity 23 (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.
D2 · Cognitive Complexity · Aup2Objects.Polygon (cognitive 23) · ×1
  • Aup2Objects.Polygon (cognitive 23) OpenTaiko/src/Lua/AviUtl2/Aup2Objects.cs:197 — Aup2Objects.Polygon has cognitive complexity 23 (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.
D2 · Cognitive Complexity · Aup2Track.Evaluate (cognitive 23) · ×1
  • Aup2Track.Evaluate (cognitive 23) OpenTaiko/src/Lua/AviUtl2/Aup2Track.cs:102 — Aup2Track.Evaluate has cognitive complexity 23 (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.
D2 · Cognitive Complexity · LuaNetworking.Leave (cognitive 23) · ×1
  • LuaNetworking.Leave (cognitive 23) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:300 — LuaNetworking.Leave has cognitive complexity 23 (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.
D2 · Cognitive Complexity · LuaNetworking.KickDiscovery (cognitive 23) · ×1
  • LuaNetworking.KickDiscovery (cognitive 23) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1406 — LuaNetworking.KickDiscovery has cognitive complexity 23 (threshold 15). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 1413). 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.
D2 · Cognitive Complexity · CTci.Parse (cognitive 23) · ×1
  • CTci.Parse (cognitive 23) OpenTaiko/src/Songs/CTci.cs:220 — CTci.Parse has cognitive complexity 23 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.ProcessRollHeadEffects (cognitive 23) · ×1
  • CStagePlayScreenCommon.ProcessRollHeadEffects (cognitive 23) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4039 — CStagePlayScreenCommon.ProcessRollHeadEffects has cognitive complexity 23 (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.
D2 · Cognitive Complexity · CActImplFlashlight.Raster (cognitive 23) · ×1
  • CActImplFlashlight.Raster (cognitive 23) OpenTaiko/src/Stages/07.Game/Taiko/CActImplFlashlight.cs:166 — CActImplFlashlight.Raster has cognitive complexity 23 (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.
D2 · Cognitive Complexity · CTexture.MakeTexture (cognitive 23) · ×1
  • CTexture.MakeTexture (cognitive 23) FDK/src/04.Graphics/CTexture.cs:1100 — CTexture.MakeTexture has cognitive complexity 23 (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.
D2 · Cognitive Complexity · CTexture.DecodeLoop (cognitive 23) · ×1
  • CTexture.DecodeLoop (cognitive 23) FDK/src/04.Graphics/CTexture.Streaming.cs:116 — CTexture.DecodeLoop has cognitive complexity 23 (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.
D2 · Cognitive Complexity · CSkin.LoadModulesIncrementally (cognitive 22) · ×1
  • CSkin.LoadModulesIncrementally (cognitive 22) OpenTaiko/src/Common/CSkin.cs:586 — CSkin.LoadModulesIncrementally 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.
D2 · Cognitive Complexity · CUnlockSC.tConditionMessage (cognitive 22) · ×1
  • CUnlockSC.tConditionMessage (cognitive 22) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:28 — CUnlockSC.tConditionMessage 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.
D2 · Cognitive Complexity · CUnlockSG.tConditionMessage (cognitive 22) · ×1
  • CUnlockSG.tConditionMessage (cognitive 22) OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:28 — CUnlockSG.tConditionMessage 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.
D2 · Cognitive Complexity · GpuRasterizer.GatherGrassTile (cognitive 22) · ×1
  • GpuRasterizer.GatherGrassTile (cognitive 22) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:140 — GpuRasterizer.GatherGrassTile 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.
D2 · Cognitive Complexity · GpuRasterizer.Walk (cognitive 22) · ×1
  • GpuRasterizer.Walk (cognitive 22) OpenTaiko/src/Lua/3D/GpuRasterizer.World.cs:108 — GpuRasterizer.Walk 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.
D2 · Cognitive Complexity · Aup2FiltersBlur.LensBlur (cognitive 22) · ×1
  • Aup2FiltersBlur.LensBlur (cognitive 22) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersBlur.cs:384 — Aup2FiltersBlur.LensBlur 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.
D2 · Cognitive Complexity · Aup2Evaluator.AttachedFilters (cognitive 22) · ×1
  • Aup2Evaluator.AttachedFilters (cognitive 22) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:549 — Aup2Evaluator.AttachedFilters 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.GetOption (cognitive 22) · ×1
  • Aup2ScriptLibrary.GetOption (cognitive 22) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:972 — Aup2ScriptLibrary.GetOption has cognitive complexity 22 (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.
D2 · Cognitive Complexity · Aup2Track.Parse (cognitive 22) · ×1
  • Aup2Track.Parse (cognitive 22) OpenTaiko/src/Lua/AviUtl2/Aup2Track.cs:39 — Aup2Track.Parse 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.
D2 · Cognitive Complexity · CTja.LyricFileParser (cognitive 22) · ×1
  • CTja.LyricFileParser (cognitive 22) OpenTaiko/src/Songs/CTja.cs:4146 — CTja.LyricFileParser 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.
D2 · Cognitive Complexity · CConfigOptionBuilder.Build (cognitive 22) · ×1
  • CConfigOptionBuilder.Build (cognitive 22) OpenTaiko/src/Stages/04.Config/CConfigOptionBuilder.cs:60 — CConfigOptionBuilder.Build has cognitive complexity 22 (threshold 15). Of this number, 21 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, 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.GetAutoInput (cognitive 22) · ×1
  • CStagePlayScreenCommon.GetAutoInput (cognitive 22) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1201 — CStagePlayScreenCommon.GetAutoInput 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.UpdateComboMilestone (cognitive 22) · ×1
  • CStagePlayScreenCommon.UpdateComboMilestone (cognitive 22) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2067 — CStagePlayScreenCommon.UpdateComboMilestone 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.tBranchJudge (cognitive 22) · ×1
  • CStagePlayScreenCommon.tBranchJudge (cognitive 22) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4322 — CStagePlayScreenCommon.tBranchJudge 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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.ApplyOnlineRemoteResults (cognitive 22) · ×1
  • CStagePlayDrumsScreen.ApplyOnlineRemoteResults (cognitive 22) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.Online.cs:34 — CStagePlayDrumsScreen.ApplyOnlineRemoteResults 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.
D2 · Cognitive Complexity · NotesManager.KindCell (cognitive 22) · ×1
  • NotesManager.KindCell (cognitive 22) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:417 — NotesManager.KindCell 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.
D2 · Cognitive Complexity · CActLVLNFont.tStringDraw (cognitive 22) · ×1
  • CActLVLNFont.tStringDraw (cognitive 22) OpenTaiko/src/Stages/CActLVLNFont.cs:35 — CActLVLNFont.tStringDraw 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.
D2 · Cognitive Complexity · CFrameProfiler.EndFrame (cognitive 22) · ×1
  • CFrameProfiler.EndFrame (cognitive 22) FDK/src/01.Framework/Core/CFrameProfiler.cs:220 — CFrameProfiler.EndFrame has cognitive complexity 22 (threshold 15). Of this number, 18 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.
D2 · Cognitive Complexity · CSoundDeviceASIO.CSoundDeviceASIO.ctor (cognitive 22) · ×1
  • CSoundDeviceASIO.CSoundDeviceASIO.ctor (cognitive 22) FDK/src/03.Sound/CSoundDeviceASIO.cs:103 — CSoundDeviceASIO.CSoundDeviceASIO.ctor has cognitive complexity 22 (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.
D2 · Cognitive Complexity · CSoundDeviceBASS.CSoundDeviceBASS.ctor (cognitive 22) · ×1
  • CSoundDeviceBASS.CSoundDeviceBASS.ctor (cognitive 22) FDK/src/03.Sound/CSoundDeviceBASS.cs:79 — CSoundDeviceBASS.CSoundDeviceBASS.ctor has cognitive complexity 22 (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.
D2 · Cognitive Complexity · SoundManager.tCheckDeviceChange (cognitive 22) · ×1
  • SoundManager.tCheckDeviceChange (cognitive 22) FDK/src/03.Sound/SoundManager.cs:420 — SoundManager.tCheckDeviceChange 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.
D2 · Cognitive Complexity · GpuRasterizer.UpdateShadowMap (cognitive 21) · ×1
  • GpuRasterizer.UpdateShadowMap (cognitive 21) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:292 — GpuRasterizer.UpdateShadowMap has cognitive complexity 21 (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.
D2 · Cognitive Complexity · Builder.LightAt (cognitive 21) · ×1
  • Builder.LightAt (cognitive 21) OpenTaiko/src/Lua/3D/Rasterizer.cs:255 — Builder.LightAt 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.
D2 · Cognitive Complexity · Aup2Renderer.Named (cognitive 21) · ×1
  • Aup2Renderer.Named (cognitive 21) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:567 — Aup2Renderer.Named 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.GetValue (cognitive 21) · ×1
  • Aup2ScriptLibrary.GetValue (cognitive 21) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1126 — Aup2ScriptLibrary.GetValue 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.
D2 · Cognitive Complexity · LuaAviUtl2Project.Model (cognitive 21) · ×1
  • LuaAviUtl2Project.Model (cognitive 21) OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:410 — LuaAviUtl2Project.Model 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.
D2 · Cognitive Complexity · PaletteManager.RestoreFromSave (cognitive 21) · ×1
  • PaletteManager.RestoreFromSave (cognitive 21) OpenTaiko/src/Lua/Classes/PaletteManager.cs:106 — PaletteManager.RestoreFromSave has cognitive complexity 21 (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.
D2 · Cognitive Complexity · CSongManager.tSongListPostprocessing (cognitive 21) · ×1
  • CSongManager.tSongListPostprocessing (cognitive 21) OpenTaiko/src/Songs/CSongManager.cs:780 — CSongManager.tSongListPostprocessing 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.AutorollRoll (cognitive 21) · ×1
  • CStagePlayScreenCommon.AutorollRoll (cognitive 21) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1323 — CStagePlayScreenCommon.AutorollRoll has cognitive complexity 21 (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.
D2 · Cognitive Complexity · CActImplFireworks.Start (cognitive 21) · ×1
  • CActImplFireworks.Start (cognitive 21) OpenTaiko/src/Stages/07.Game/Taiko/CActImplFireworks.cs:21 — CActImplFireworks.Start 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.
D2 · Cognitive Complexity · FireWorks.Draw (cognitive 21) · ×1
  • FireWorks.Draw (cognitive 21) OpenTaiko/src/Stages/07.Game/Taiko/FireWorks.cs:60 — FireWorks.Draw has cognitive complexity 21 (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.
D2 · Cognitive Complexity · GoGoSplash.Draw (cognitive 21) · ×1
  • GoGoSplash.Draw (cognitive 21) OpenTaiko/src/Stages/07.Game/Taiko/GoGoSplash.cs:25 — GoGoSplash.Draw 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.
D2 · Cognitive Complexity · Game.Game.ctor (cognitive 21) · ×1
  • Game.Game.ctor (cognitive 21) FDK/src/01.Framework/Core/Game.cs:486 — Game.Game.ctor 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: 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.
D2 · Cognitive Complexity · CInputManager.ApplyConnectionChange (cognitive 21) · ×1
  • CInputManager.ApplyConnectionChange (cognitive 21) FDK/src/02.Input/CInputManager.cs:104 — CInputManager.ApplyConnectionChange 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.
D2 · Cognitive Complexity · CSound.tRestoreStates (cognitive 21) · ×1
  • CSound.tRestoreStates (cognitive 21) FDK/src/03.Sound/CSound.cs:691 — CSound.tRestoreStates 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.
D2 · Cognitive Complexity · TouchOverlayView.OnDraw (cognitive 21) · ×1
  • TouchOverlayView.OnDraw (cognitive 21) OpenTaiko.Android/TouchOverlayView.cs:72 — TouchOverlayView.OnDraw has cognitive complexity 21 (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.
D2 · Cognitive Complexity · CConfigIni.LoadFromString (cognitive 20) · ×1
  • CConfigIni.LoadFromString (cognitive 20) OpenTaiko/src/Common/CConfigIni.cs:2016 — CConfigIni.LoadFromString 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.
D2 · Cognitive Complexity · CommandLineArgs.Parse (cognitive 20) · ×1
  • CommandLineArgs.Parse (cognitive 20) OpenTaiko/src/Common/CommandLineArgs.cs:39 — CommandLineArgs.Parse has cognitive 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, 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.
D2 · Cognitive Complexity · CActSelectSongList.GetFromFlattenList (cognitive 20) · ×1
  • CActSelectSongList.GetFromFlattenList (cognitive 20) OpenTaiko/src/Common/CSongListUtils.cs:18 — CActSelectSongList.GetFromFlattenList 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.
D2 · Cognitive Complexity · CSongReplay.tApplyVirtualMods (cognitive 20) · ×1
  • CSongReplay.tApplyVirtualMods (cognitive 20) OpenTaiko/src/Components/CSongReplay.cs:557 — CSongReplay.tApplyVirtualMods has cognitive complexity 20 (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.
D2 · Cognitive Complexity · CUnlockSC.tGetCountChartsPassingCondition (cognitive 20) · ×1
  • CUnlockSC.tGetCountChartsPassingCondition (cognitive 20) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:65 — CUnlockSC.tGetCountChartsPassingCondition 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.
D2 · Cognitive Complexity · CUnlockSG.tGetCountChartsPassingCondition (cognitive 20) · ×1
  • CUnlockSG.tGetCountChartsPassingCondition (cognitive 20) OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:65 — CUnlockSG.tGetCountChartsPassingCondition 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.
D2 · Cognitive Complexity · GltfModel.TransformPrim (cognitive 20) · ×1
  • GltfModel.TransformPrim (cognitive 20) OpenTaiko/src/Lua/3D/GltfModel.cs:158 — GltfModel.TransformPrim 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.
D2 · Cognitive Complexity · GpuRasterizer.Invalidate (cognitive 20) · ×1
  • GpuRasterizer.Invalidate (cognitive 20) OpenTaiko/src/Lua/3D/GpuRasterizer.cs:291 — GpuRasterizer.Invalidate has cognitive complexity 20 (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.
D2 · Cognitive Complexity · GpuRasterizer.DrawCasters (cognitive 20) · ×1
  • GpuRasterizer.DrawCasters (cognitive 20) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:340 — GpuRasterizer.DrawCasters 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.
D2 · Cognitive Complexity · GpuRasterizer.DrawSurfaceCustom (cognitive 20) · ×1
  • GpuRasterizer.DrawSurfaceCustom (cognitive 20) OpenTaiko/src/Lua/3D/GpuRasterizer.Surfaces.cs:51 — GpuRasterizer.DrawSurfaceCustom has cognitive complexity 20 (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.
D2 · Cognitive Complexity · GpuRasterizer.ReleaseGpuOnly (cognitive 20) · ×1
  • GpuRasterizer.ReleaseGpuOnly (cognitive 20) OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:176 — GpuRasterizer.ReleaseGpuOnly 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.
D2 · Cognitive Complexity · NavGraph.FindPath (cognitive 20) · ×1
  • NavGraph.FindPath (cognitive 20) OpenTaiko/src/Lua/3D/Pathfinding/NavGraph.cs:70 — NavGraph.FindPath 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.
D2 · Cognitive Complexity · Aup2Renderer.Shade (cognitive 20) · ×1
  • Aup2Renderer.Shade (cognitive 20) OpenTaiko/src/Lua/AviUtl2/Aup2Renderer.cs:467 — Aup2Renderer.Shade has cognitive complexity 20 (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.
D2 · Cognitive Complexity · CSongManager.ProcessDeferredTcm (cognitive 20) · ×1
  • CSongManager.ProcessDeferredTcm (cognitive 20) OpenTaiko/src/Songs/CSongManager.cs:1001 — CSongManager.ProcessDeferredTcm 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.
D2 · Cognitive Complexity · CLuaKeyConfigService.PollCaptureFrame (cognitive 20) · ×1
  • CLuaKeyConfigService.PollCaptureFrame (cognitive 20) OpenTaiko/src/Stages/04.Config/CLuaKeyConfigService.cs:218 — CLuaKeyConfigService.PollCaptureFrame has cognitive 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CActImplScoreRank.displayScoreRank (cognitive 20) · ×1
  • CActImplScoreRank.displayScoreRank (cognitive 20) OpenTaiko/src/Stages/07.Game/Taiko/CActImplScoreRank.cs:43 — CActImplScoreRank.displayScoreRank has cognitive complexity 20 (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.
D2 · Cognitive Complexity · CActImplTrainingMode.Activate (cognitive 20) · ×1
  • CActImplTrainingMode.Activate (cognitive 20) OpenTaiko/src/Stages/07.Game/Taiko/CActImplTrainingMode.cs:11 — CActImplTrainingMode.Activate 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.
D2 · Cognitive Complexity · CStagePlayDrumsScreen.tValueInitialize (cognitive 20) · ×1
  • CStagePlayDrumsScreen.tValueInitialize (cognitive 20) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:213 — CStagePlayDrumsScreen.tValueInitialize 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.
D2 · Cognitive Complexity · Dan_Cert.DrawNumber (cognitive 20) · ×1
  • Dan_Cert.DrawNumber (cognitive 20) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1232 — Dan_Cert.DrawNumber 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.
D2 · Cognitive Complexity · NotesManager.NoteCell (cognitive 20) · ×1
  • NotesManager.NoteCell (cognitive 20) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:438 — NotesManager.NoteCell has cognitive complexity 20 (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.
D2 · Cognitive Complexity · CIniFile.tRead (cognitive 20) · ×1
  • CIniFile.tRead (cognitive 20) FDK/src/00.Common/CIniFile.cs:39 — CIniFile.tRead 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.
D2 · Cognitive Complexity · MainActivity.RenderMain (cognitive 20) · ×1
  • MainActivity.RenderMain (cognitive 20) OpenTaiko.Android/MainActivity.cs:145 — MainActivity.RenderMain has cognitive complexity 20 (threshold 15). Of this number, 15 points are the body's own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CConfigIni.ProcessSystemSection (cognitive 19) · ×1
  • CConfigIni.ProcessSystemSection (cognitive 19) OpenTaiko/src/Common/CConfigIni.cs:2068 — CConfigIni.ProcessSystemSection has cognitive complexity 19 (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.
D2 · Cognitive Complexity · CNotesSkins.Scan (cognitive 19) · ×1
  • CNotesSkins.Scan (cognitive 19) OpenTaiko/src/Common/CNotesSkins.cs:43 — CNotesSkins.Scan 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.
D2 · Cognitive Complexity · CSongDict.tFetchSongsByTitle (cognitive 19) · ×1
  • CSongDict.tFetchSongsByTitle (cognitive 19) OpenTaiko/src/Common/CSongDict.cs:245 — CSongDict.tFetchSongsByTitle 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.
D2 · Cognitive Complexity · GpuRaytracer.Dispatch (cognitive 19) · ×1
  • GpuRaytracer.Dispatch (cognitive 19) OpenTaiko/src/Lua/3D/GpuRaytracer.cs:180 — GpuRaytracer.Dispatch 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, 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.
D2 · Cognitive Complexity · Builder.ClipPlane (cognitive 19) · ×1
  • Builder.ClipPlane (cognitive 19) OpenTaiko/src/Lua/3D/Rasterizer.cs:135 — Builder.ClipPlane 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.
D2 · Cognitive Complexity · Raytracer.Resolve (cognitive 19) · ×1
  • Raytracer.Resolve (cognitive 19) OpenTaiko/src/Lua/3D/Raytracer.cs:546 — Raytracer.Resolve 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.
D2 · Cognitive Complexity · RtScene.TriCount (cognitive 19) · ×1
  • RtScene.TriCount (cognitive 19) OpenTaiko/src/Lua/3D/RtScene.cs:566 — RtScene.TriCount 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.Run (cognitive 19) · ×1
  • Aup2ScriptLibrary.Run (cognitive 19) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:322 — Aup2ScriptLibrary.Run 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, 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.
D2 · Cognitive Complexity · LuaNetworking.LocalIPv6s (cognitive 19) · ×1
  • LuaNetworking.LocalIPv6s (cognitive 19) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:969 — LuaNetworking.LocalIPv6s 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.
D2 · Cognitive Complexity · LuaNetworking.LocalIPv4s (cognitive 19) · ×1
  • LuaNetworking.LocalIPv4s (cognitive 19) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1533 — LuaNetworking.LocalIPv4s 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.
D2 · Cognitive Complexity · CTcm.BuildSongListNode (cognitive 19) · ×1
  • CTcm.BuildSongListNode (cognitive 19) OpenTaiko/src/Songs/CTcm.cs:85 — CTcm.BuildSongListNode 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.
D2 · Cognitive Complexity · CTja.DeActivate (cognitive 19) · ×1
  • CTja.DeActivate (cognitive 19) OpenTaiko/src/Songs/CTja.cs:4624 — CTja.DeActivate 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.
D2 · Cognitive Complexity · CActImplMtaiko.DrawBackSymbol (cognitive 19) · ×1
  • CActImplMtaiko.DrawBackSymbol (cognitive 19) OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:439 — CActImplMtaiko.DrawBackSymbol 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.
D2 · Cognitive Complexity · GameViewController.OnFrame (cognitive 19) · ×1
  • GameViewController.OnFrame (cognitive 19) OpenTaiko.iOS/GameViewController.cs:355 — GameViewController.OnFrame has cognitive complexity 19 (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.
D2 · Cognitive Complexity · compose_icon.main (cognitive 19) · ×1
  • compose_icon.main (cognitive 19) OpenTaiko.iOS/scripts/compose_icon.py:74 — compose_icon.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GpuRasterizer.DepthTextured (cognitive 18) · ×1
  • GpuRasterizer.DepthTextured (cognitive 18) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:399 — GpuRasterizer.DepthTextured 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.
D2 · Cognitive Complexity · Lua3DScene.ModelUnregistered (cognitive 18) · ×1
  • Lua3DScene.ModelUnregistered (cognitive 18) OpenTaiko/src/Lua/3D/Lua3DScene.Memory.cs:66 — Lua3DScene.ModelUnregistered 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.
D2 · Cognitive Complexity · PhysicsWorld.Raycast (cognitive 18) · ×1
  • PhysicsWorld.Raycast (cognitive 18) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:118 — PhysicsWorld.Raycast 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.
D2 · Cognitive Complexity · Builder.Bin (cognitive 18) · ×1
  • Builder.Bin (cognitive 18) OpenTaiko/src/Lua/3D/Rasterizer.cs:76 — Builder.Bin 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.
D2 · Cognitive Complexity · LuaHeightmapFunc.LoadSplat (cognitive 18) · ×1
  • LuaHeightmapFunc.LoadSplat (cognitive 18) OpenTaiko/src/Lua/Classes/LuaHeightmap.cs:173 — LuaHeightmapFunc.LoadSplat 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.
D2 · Cognitive Complexity · LuaNetworking.UpnpDiscover (cognitive 18) · ×1
  • LuaNetworking.UpnpDiscover (cognitive 18) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1433 — LuaNetworking.UpnpDiscover 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.
D2 · Cognitive Complexity · CTja.tEachAutoPlaySoundChipPlaybackTimeChange (cognitive 18) · ×1
  • CTja.tEachAutoPlaySoundChipPlaybackTimeChange (cognitive 18) OpenTaiko/src/Songs/CTja.cs:1032 — CTja.tEachAutoPlaySoundChipPlaybackTimeChange has cognitive complexity 18 (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.
D2 · Cognitive Complexity · CTja.SetBPMPointAtDefCursor (cognitive 18) · ×1
  • CTja.SetBPMPointAtDefCursor (cognitive 18) OpenTaiko/src/Songs/CTja.cs:2634 — CTja.SetBPMPointAtDefCursor 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.
D2 · Cognitive Complexity · SoundtrackDownloader.EnsureSoundtrack (cognitive 18) · ×1
  • SoundtrackDownloader.EnsureSoundtrack (cognitive 18) OpenTaiko/src/Songs/SoundtrackDownloader.cs:32 — SoundtrackDownloader.EnsureSoundtrack 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.
D2 · Cognitive Complexity · CStageCutScene.JudgeRequirement (cognitive 18) · ×1
  • CStageCutScene.JudgeRequirement (cognitive 18) OpenTaiko/src/Stages/05.CutScene/CStageCutScene.cs:80 — CStageCutScene.JudgeRequirement has cognitive complexity 18 (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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.AutoplayDoHit (cognitive 18) · ×1
  • CStagePlayScreenCommon.AutoplayDoHit (cognitive 18) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1235 — CStagePlayScreenCommon.AutoplayDoHit 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.
D2 · Cognitive Complexity · Game.Run (cognitive 18) · ×1
  • Game.Run (cognitive 18) FDK/src/01.Framework/Core/Game.cs:741 — Game.Run 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.
D2 · Cognitive Complexity · Game.Window_Render (cognitive 18) · ×1
  • Game.Window_Render (cognitive 18) FDK/src/01.Framework/Core/Game.cs:1121 — Game.Window_Render 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.
D2 · Cognitive Complexity · CInputButtonsBase.ProcessButtonState (cognitive 18) · ×1
  • CInputButtonsBase.ProcessButtonState (cognitive 18) FDK/src/02.Input/CInputButtonsBase.cs:52 — CInputButtonsBase.ProcessButtonState has cognitive complexity 18 (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.
D2 · Cognitive Complexity · CSkin.PreloadSystemSounds (cognitive 17) · ×1
  • CSkin.PreloadSystemSounds (cognitive 17) OpenTaiko/src/Common/CSkin.cs:845 — CSkin.PreloadSystemSounds has cognitive complexity 17 (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.
D2 · Cognitive Complexity · CSkin.tRemoveMixerAll (cognitive 17) · ×1
  • CSkin.tRemoveMixerAll (cognitive 17) OpenTaiko/src/Common/CSkin.cs:1052 — CSkin.tRemoveMixerAll 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.
D2 · Cognitive Complexity · GltfModel.Evict (cognitive 17) · ×1
  • GltfModel.Evict (cognitive 17) OpenTaiko/src/Lua/3D/GltfModel.cs:833 — GltfModel.Evict 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.
D2 · Cognitive Complexity · GpuRasterizer.UploadMerged (cognitive 17) · ×1
  • GpuRasterizer.UploadMerged (cognitive 17) OpenTaiko/src/Lua/3D/GpuRasterizer.Merge.cs:131 — GpuRasterizer.UploadMerged 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.
D2 · Cognitive Complexity · GpuRasterizer.DepthSolid (cognitive 17) · ×1
  • GpuRasterizer.DepthSolid (cognitive 17) OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:376 — GpuRasterizer.DepthSolid 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.
D2 · Cognitive Complexity · Lua3DScene.PsBurst (cognitive 17) · ×1
  • Lua3DScene.PsBurst (cognitive 17) OpenTaiko/src/Lua/3D/Lua3DScene.Particles.cs:54 — Lua3DScene.PsBurst 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.
D2 · Cognitive Complexity · Lua3DScene.RenderViewEx (cognitive 17) · ×1
  • Lua3DScene.RenderViewEx (cognitive 17) OpenTaiko/src/Lua/3D/Lua3DScene.Reflections.cs:74 — Lua3DScene.RenderViewEx 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.
D2 · Cognitive Complexity · Lua3DScene.CaptureCpuRtt (cognitive 17) · ×1
  • Lua3DScene.CaptureCpuRtt (cognitive 17) OpenTaiko/src/Lua/3D/Lua3DScene.Reflections.cs:135 — Lua3DScene.CaptureCpuRtt 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.
D2 · Cognitive Complexity · Lua3DScene.FallBack (cognitive 17) · ×1
  • Lua3DScene.FallBack (cognitive 17) OpenTaiko/src/Lua/3D/Lua3DScene.Renderers.cs:145 — Lua3DScene.FallBack 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.
D2 · Cognitive Complexity · Aup2Gpu.Mesh (cognitive 17) · ×1
  • Aup2Gpu.Mesh (cognitive 17) OpenTaiko/src/Lua/AviUtl2/Aup2Gpu.cs:543 — Aup2Gpu.Mesh 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.Index (cognitive 17) · ×1
  • Aup2ScriptLibrary.Index (cognitive 17) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:67 — Aup2ScriptLibrary.Index 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.Own (cognitive 17) · ×1
  • Aup2ScriptLibrary.Own (cognitive 17) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1046 — Aup2ScriptLibrary.Own 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.
D2 · Cognitive Complexity · LuaCanvas.FillCircle (cognitive 17) · ×1
  • LuaCanvas.FillCircle (cognitive 17) OpenTaiko/src/Lua/Classes/LuaCanvas.cs:99 — LuaCanvas.FillCircle 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.
D2 · Cognitive Complexity · LuaGlyphText.DrawWrapped (cognitive 17) · ×1
  • LuaGlyphText.DrawWrapped (cognitive 17) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:517 — LuaGlyphText.DrawWrapped 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.
D2 · Cognitive Complexity · LuaNetworking.BecomeServer (cognitive 17) · ×1
  • LuaNetworking.BecomeServer (cognitive 17) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1195 — LuaNetworking.BecomeServer has cognitive complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 1216). 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.
D2 · Cognitive Complexity · CTExpression.ParseEquality (cognitive 17) · ×1
  • CTExpression.ParseEquality (cognitive 17) OpenTaiko/src/Songs/TJA/TriggersCounters/CTExpression.cs:107 — CTExpression.ParseEquality 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.
D2 · Cognitive Complexity · CStagePlayScreenCommon.evaluateNodeJudge (cognitive 17) · ×1
  • CStagePlayScreenCommon.evaluateNodeJudge (cognitive 17) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1133 — CStagePlayScreenCommon.evaluateNodeJudge 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.
D2 · Cognitive Complexity · HitSoundOnArrival.Publish (cognitive 17) · ×1
  • HitSoundOnArrival.Publish (cognitive 17) OpenTaiko/src/Stages/07.Game/HitSoundOnArrival.cs:17 — HitSoundOnArrival.Publish 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.
D2 · Cognitive Complexity · NotesManager.IsExpectedPadMultiHit (cognitive 17) · ×1
  • NotesManager.IsExpectedPadMultiHit (cognitive 17) OpenTaiko/src/Stages/07.Game/Taiko/NotesManager.cs:184 — NotesManager.IsExpectedPadMultiHit has cognitive complexity 17 (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.
D2 · Cognitive Complexity · Game.GetIconData (cognitive 17) · ×1
  • Game.GetIconData (cognitive 17) FDK/src/01.Framework/Core/Game.cs:427 — Game.GetIconData 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.
D2 · Cognitive Complexity · CSoundTimer.SystemTimsMsBase_Double (cognitive 17) · ×1
  • CSoundTimer.SystemTimsMsBase_Double (cognitive 17) FDK/src/03.Sound/CSoundTimer.cs:51 — CSoundTimer.SystemTimsMsBase_Double 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.
D2 · Cognitive Complexity · CTexture.UpdatePixelBufferRegion (cognitive 17) · ×1
  • CTexture.UpdatePixelBufferRegion (cognitive 17) FDK/src/04.Graphics/CTexture.cs:536 — CTexture.UpdatePixelBufferRegion 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.
D2 · Cognitive Complexity · GameViewController.CreateArrowOverlay (cognitive 17) · ×1
  • GameViewController.CreateArrowOverlay (cognitive 17) OpenTaiko.iOS/GameViewController.TouchInput.cs:193 — GameViewController.CreateArrowOverlay has cognitive complexity 17 (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.
D2 · Cognitive Complexity · CSystemError.LoadError (cognitive 16) · ×1
  • CSystemError.LoadError (cognitive 16) OpenTaiko/src/Common/CSystemError.cs:27 — CSystemError.LoadError 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.
D2 · Cognitive Complexity · ImGuiDebugWindow.Draw (cognitive 16) · ×1
  • ImGuiDebugWindow.Draw (cognitive 16) OpenTaiko/src/Common/ImGuiDebugWindow.cs:35 — ImGuiDebugWindow.Draw has cognitive complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VideoExporter.DrawProgress (cognitive 16) · ×1
  • VideoExporter.DrawProgress (cognitive 16) OpenTaiko/src/Common/VideoExporter.cs:69 — VideoExporter.DrawProgress 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.
D2 · Cognitive Complexity · VideoExporter.MixAudio (cognitive 16) · ×1
  • VideoExporter.MixAudio (cognitive 16) OpenTaiko/src/Common/VideoExporter.cs:444 — VideoExporter.MixAudio 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.
D2 · Cognitive Complexity · CPopupMenuManager.Update (cognitive 16) · ×1
  • CPopupMenuManager.Update (cognitive 16) OpenTaiko/src/Components/CPopupMenuManager.cs:80 — CPopupMenuManager.Update 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.
D2 · Cognitive Complexity · CSongReplay.tResultsRegisterReplayInformations (cognitive 16) · ×1
  • CSongReplay.tResultsRegisterReplayInformations (cognitive 16) OpenTaiko/src/Components/CSongReplay.cs:422 — CSongReplay.tResultsRegisterReplayInformations has cognitive complexity 16 (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.
D2 · Cognitive Complexity · CapsuleCollider.RaycastUnit (cognitive 16) · ×1
  • CapsuleCollider.RaycastUnit (cognitive 16) OpenTaiko/src/Lua/3D/Colliders/Collider.cs:215 — CapsuleCollider.RaycastUnit 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.
D2 · Cognitive Complexity · GltfModel.RereadPixels (cognitive 16) · ×1
  • GltfModel.RereadPixels (cognitive 16) OpenTaiko/src/Lua/3D/GltfModel.cs:853 — GltfModel.RereadPixels 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.
D2 · Cognitive Complexity · GpuRasterizer.GapOf (cognitive 16) · ×1
  • GpuRasterizer.GapOf (cognitive 16) OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:244 — GpuRasterizer.GapOf 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.
D2 · Cognitive Complexity · GpuRasterizer.DrawQueue (cognitive 16) · ×1
  • GpuRasterizer.DrawQueue (cognitive 16) OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:261 — GpuRasterizer.DrawQueue 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.
D2 · Cognitive Complexity · Lua3DScene.TrimMemory (cognitive 16) · ×1
  • Lua3DScene.TrimMemory (cognitive 16) OpenTaiko/src/Lua/3D/Lua3DScene.Memory.cs:93 — Lua3DScene.TrimMemory 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.
D2 · Cognitive Complexity · Raytracer.BoxHit (cognitive 16) · ×1
  • Raytracer.BoxHit (cognitive 16) OpenTaiko/src/Lua/3D/Raytracer.cs:394 — Raytracer.BoxHit 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.
D2 · Cognitive Complexity · RtScene.CutMode (cognitive 16) · ×1
  • RtScene.CutMode (cognitive 16) OpenTaiko/src/Lua/3D/RtScene.cs:515 — RtScene.CutMode 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.
D2 · Cognitive Complexity · Aup2Evaluator.ReadCamera (cognitive 16) · ×1
  • Aup2Evaluator.ReadCamera (cognitive 16) OpenTaiko/src/Lua/AviUtl2/Aup2Frame.cs:473 — Aup2Evaluator.ReadCamera 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.
D2 · Cognitive Complexity · Aup2SceneChanges.Shatter (cognitive 16) · ×1
  • Aup2SceneChanges.Shatter (cognitive 16) OpenTaiko/src/Lua/AviUtl2/Aup2SceneChanges.cs:348 — Aup2SceneChanges.Shatter has cognitive 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Aup2ScriptFile.SplitOutside (cognitive 16) · ×1
  • Aup2ScriptFile.SplitOutside (cognitive 16) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptFile.cs:273 — Aup2ScriptFile.SplitOutside 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.Aup2ScriptLibrary.ctor (cognitive 16) · ×1
  • Aup2ScriptLibrary.Aup2ScriptLibrary.ctor (cognitive 16) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:45 — Aup2ScriptLibrary.Aup2ScriptLibrary.ctor 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.
D2 · Cognitive Complexity · Aup2ScriptLibrary.SetOption (cognitive 16) · ×1
  • Aup2ScriptLibrary.SetOption (cognitive 16) OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:943 — Aup2ScriptLibrary.SetOption has cognitive complexity 16 (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.
D2 · Cognitive Complexity · Aup2Track.Eased (cognitive 16) · ×1
  • Aup2Track.Eased (cognitive 16) OpenTaiko/src/Lua/AviUtl2/Aup2Track.cs:163 — Aup2Track.Eased 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.
D2 · Cognitive Complexity · GlyphQuadBatch.Add (cognitive 16) · ×1
  • GlyphQuadBatch.Add (cognitive 16) OpenTaiko/src/Lua/Classes/GlyphQuadBatch.cs:140 — GlyphQuadBatch.Add 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.
D2 · Cognitive Complexity · LuaVideoFunc.Open (cognitive 16) · ×1
  • LuaVideoFunc.Open (cognitive 16) OpenTaiko/src/Lua/Classes/LuaVideo.cs:148 — LuaVideoFunc.Open has cognitive complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 161, 167). 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.
D2 · Cognitive Complexity · LuaNetworking.HandleFrame (cognitive 16) · ×1
  • LuaNetworking.HandleFrame (cognitive 16) OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1085 — LuaNetworking.HandleFrame has cognitive complexity 16 (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.
D2 · Cognitive Complexity · CSongManager.CreateUnparentedSongNode (cognitive 16) · ×1
  • CSongManager.CreateUnparentedSongNode (cognitive 16) OpenTaiko/src/Songs/CSongManager.cs:188 — CSongManager.CreateUnparentedSongNode has cognitive complexity 16 (threshold 15). Of this number, 14 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.
D2 · Cognitive Complexity · CTci.BuildChips (cognitive 16) · ×1
  • CTci.BuildChips (cognitive 16) OpenTaiko/src/Songs/CTci.cs:324 — CTci.BuildChips 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.
D2 · Cognitive Complexity · CActCalibrationMode.Update (cognitive 16) · ×1
  • CActCalibrationMode.Update (cognitive 16) OpenTaiko/src/Stages/04.Config/CActCalibrationMode.cs:41 — CActCalibrationMode.Update has cognitive complexity 16 (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.
D2 · Cognitive Complexity · CActImplRunner.Activate (cognitive 16) · ×1
  • CActImplRunner.Activate (cognitive 16) OpenTaiko/src/Stages/07.Game/Taiko/CActImplRunner.cs:36 — CActImplRunner.Activate 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.
D2 · Cognitive Complexity · Dan_Cert.Activate (cognitive 16) · ×1
  • Dan_Cert.Activate (cognitive 16) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:127 — Dan_Cert.Activate 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.
D2 · Cognitive Complexity · Dan_Cert.UpdateReachStatus · ×1
  • Dan_Cert.UpdateReachStatus::judgeRoll (cognitive 16) OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:422 — Dan_Cert.UpdateReachStatus::judgeRoll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Dan_Cert.UpdateReachStatus) 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.
D2 · Cognitive Complexity · CInputManager.SetID (cognitive 16) · ×1
  • CInputManager.SetID (cognitive 16) FDK/src/02.Input/CInputManager.cs:214 — CInputManager.SetID 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.
D2 · Cognitive Complexity · CSound.SetSpeedWhilePlaying (cognitive 16) · ×1
  • CSound.SetSpeedWhilePlaying (cognitive 16) FDK/src/03.Sound/CSound.cs:124 — CSound.SetSpeedWhilePlaying 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.
D2 · Cognitive Complexity · CSound.Dispose (cognitive 16) · ×1
  • CSound.Dispose (cognitive 16) FDK/src/03.Sound/CSound.cs:723 — CSound.Dispose 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.
D2 · Cognitive Complexity · TouchDrumShape.BuildUnionPath (cognitive 16) · ×1
  • TouchDrumShape.BuildUnionPath (cognitive 16) OpenTaiko.iOS/TouchDrumShape.cs:66 — TouchDrumShape.BuildUnionPath 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.
D2 · Cognitive Complexity · compose_icon.decode (cognitive 16) · ×1
  • compose_icon.decode (cognitive 16) OpenTaiko.iOS/scripts/compose_icon.py:16 — compose_icon.decode has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 2 (5 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.html.renderPage (cognitive 16) · ×1
  • index.html.renderPage (cognitive 16) OpenTaiko/docs/index.html:238 — index.html.renderPage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, error handling 2 (3 pts), ternaries 1 (nesting depth added 1). Of this number, 13 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D35 · Change Coupling · Change coupling · ×1
  • Change coupling: CBoxDef.cs ↔ CSongListNode.cs OpenTaiko/src/Songs/CBoxDef.cs:1 — `OpenTaiko/src/Songs/CBoxDef.cs` and `OpenTaiko/src/Songs/CSongListNode.cs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `1c508221` Changing language no longer requires hard reloading to apply on songs; `a9027d18` いろいろ改善14 (#513) (at that commit the file was still `OpenTaiko/src/Songs/C曲リストノード.cs`); `9cc5de43` 色々改善6 (#447) (at that commit the files were still `TJAPlayer3/Songs/CBoxDef.cs` and `TJAPlayer3/Songs/C曲リストノード.cs`) — run `git show` on any of them.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (3 members, 6 shared lines) · ×1
  • Near-duplicate member family (3 members, 6 shared lines) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:191 — OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:191-208 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:251-305 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:308-357 — These 3 members are variants of one another: a block of 6 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' 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 3 times.
D4 · Code Duplication · Near-duplicate member pair (75 shared lines) · ×1
  • Near-duplicate member pair (75 shared lines) FDK/src/04.Graphics/CTexture.cs:1386 — FDK/src/04.Graphics/CTexture.cs:1386-1484 | FDK/src/04.Graphics/CTexture.cs:1574-1672 — These two members are variants of one another: 75 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (29 shared lines) · ×1
  • Near-duplicate member pair (29 shared lines) OpenTaiko/src/Lua/3D/Rasterizer.cs:902 — OpenTaiko/src/Lua/3D/Rasterizer.cs:902-973 | OpenTaiko/src/Lua/3D/Rasterizer.cs:975-1077 — These two members are variants of one another: 29 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (27 shared lines) · ×1
  • Near-duplicate member pair (27 shared lines) OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:49 — OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:49-95 | OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:14-164 — These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (8 members, 50+ identical tokens) OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:14 — OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:14-27 | OpenTaiko/src/Components/UnlockConditions/CUnlockAW.cs:14-27 | OpenTaiko/src/Components/UnlockConditions/CUnlockCE.cs:14-27 | OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:12-25 | OpenTaiko/src/Components/UnlockConditions/CUnlockGC.cs:13-26 | OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs:12-25 | OpenTaiko/src/Components/UnlockConditions/CUnlockSD.cs:12-25 | OpenTaiko/src/Components/UnlockConditions/CUnlockTP.cs:14-27 — These 8 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 8 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 8 times.
D4 · Code Duplication · Edited copy of a member (53 corresponding lines) · ×1
  • Edited copy of a member (53 corresponding lines) OpenTaiko/src/Lua/3D/RtScene.cs:321 — OpenTaiko/src/Lua/3D/RtScene.cs:321-380 | OpenTaiko/src/Lua/3D/RtScene.cs:385-437 — 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 copy of a member (32 corresponding lines) · ×1
  • Edited copy of a member (32 corresponding lines) OpenTaiko.iOS/CInputKeyboard_iOS.cs:70 — OpenTaiko.iOS/CInputKeyboard_iOS.cs:70-191 | OpenTaiko.Android/CInputKeyboard_Android.cs:113-144 — 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 copy of a member (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) OpenTaiko/src/Lua/3D/GltfModel.cs:158 — OpenTaiko/src/Lua/3D/GltfModel.cs:158-187 | OpenTaiko/src/Lua/3D/GltfModel.cs:528-557 — These two members are one piece of code written twice and then edited apart: 30 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) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1323 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1323-1359 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1361-1417 — 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 (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:33 — OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:33-55 | OpenTaiko/src/Lua/3D/GpuRasterizer.Terrain.cs:26-50 — 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 (52 corresponding lines) · ×1
  • Edited copy of a member (52 corresponding lines) FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:81 — FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:81-133 | FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:135-186 — These two members are one piece of code written twice and then edited apart: 52 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) OpenTaiko/src/Common/Easing.cs:11 — OpenTaiko/src/Common/Easing.cs:11-46 | OpenTaiko/src/Common/Easing.cs:53-93 — 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 copies of one member (3 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 10+ corresponding lines) OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:243 — OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:243-253 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:269-281 | OpenTaiko/src/Lua/3D/Lua3DScene.Objects.cs:337-346 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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, 31+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 31+ corresponding lines) OpenTaiko/src/Helpers/SevenZipHelper.cs:117 — OpenTaiko/src/Helpers/SevenZipHelper.cs:117-149 | OpenTaiko/src/Helpers/SevenZipHelper.cs:152-182 | OpenTaiko/src/Helpers/SevenZipHelper.cs:185-217 — These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) OpenTaiko/src/Stages/07.Game/Taiko/CActImplFooter.cs:13 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplFooter.cs:13-34 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplMob.cs:13-36 — 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 copies of one member (3 members, 20+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 20+ corresponding lines) OpenTaiko/src/Helpers/SevenZipHelper.cs:48 — OpenTaiko/src/Helpers/SevenZipHelper.cs:48-67 | OpenTaiko/src/Helpers/SevenZipHelper.cs:70-89 | OpenTaiko/src/Helpers/SevenZipHelper.cs:92-112 — 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, 28+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 28+ corresponding lines) OpenTaiko/src/Databases/DBNameplateUnlockables.cs:246 — OpenTaiko/src/Databases/DBNameplateUnlockables.cs:246-274 | OpenTaiko/src/Databases/DBSongUnlockables.cs:79-114 | OpenTaiko/src/Stages/01.StartUp/CPuchichara.cs:18-45 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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 (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) OpenTaiko/src/Songs/CTja.cs:3491 — OpenTaiko/src/Songs/CTja.cs:3491-3517 | OpenTaiko/src/Songs/CTja.cs:3744-3773 — 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 (31 corresponding lines) · ×1
  • Edited copy of a member (31 corresponding lines) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersColor.cs:129 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersColor.cs:129-159 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersColor.cs:161-197 — These two members are one piece of code written twice and then edited apart: 31 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, 8+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 8+ corresponding lines) OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:120 — OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:120-129 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:131-138 | OpenTaiko/src/Lua/AviUtl2/Aup2FiltersMotion.cs:149-157 — These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 13+ corresponding lines) OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:86 — OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:86-103 | OpenTaiko/src/Lua/Classes/LuaText.cs:19-36 | OpenTaiko/src/Lua/Classes/LuaText.cs:37-49 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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, 19+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 19+ corresponding lines) OpenTaiko/src/Common/CSongDict.cs:174 — OpenTaiko/src/Common/CSongDict.cs:174-192 | OpenTaiko/src/Common/CSongDict.cs:195-213 | OpenTaiko/src/Common/CSongDict.cs:280-298 — 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 (4 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 10+ corresponding lines) OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:29 — OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:29-38 | OpenTaiko/src/Components/UnlockConditions/CUnlockAW.cs:29-38 | OpenTaiko/src/Components/UnlockConditions/CUnlockCE.cs:29-38 | OpenTaiko/src/Components/UnlockConditions/CUnlockTP.cs:29-38 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 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 (4 members, 5+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 5+ corresponding lines) OpenTaiko/src/Lua/3D/Lua3DScene.Post.cs:59 — OpenTaiko/src/Lua/3D/Lua3DScene.Post.cs:59-63 | OpenTaiko/src/Lua/3D/Lua3DScene.Post.cs:114-118 | OpenTaiko/src/Lua/3D/Lua3DScene.Post.cs:132-136 | OpenTaiko/src/Lua/3D/Lua3DScene.Terrain.cs:59-63 — 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 copy of a member (21 corresponding lines) · ×1
  • Edited copy of a member (21 corresponding lines) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:605 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:605-628 | OpenTaiko/src/Common/CConfigIni.cs:638-658 — 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 copies of one member (5 members, 6+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 6+ corresponding lines) OpenTaiko/src/Lua/Classes/Math/LuaVector.cs:21 — OpenTaiko/src/Lua/Classes/Math/LuaVector.cs:21-26 | OpenTaiko/src/Lua/Classes/Math/LuaVector.cs:27-32 | OpenTaiko/src/Lua/Classes/Math/LuaVector.cs:33-38 | OpenTaiko/src/Lua/Classes/Math/LuaVector.cs:66-72 | OpenTaiko/src/Lua/Classes/Math/LuaVector.cs:73-78 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 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, 7+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 7+ corresponding lines) OpenTaiko/src/Songs/CTci.cs:78 — OpenTaiko/src/Songs/CTci.cs:78-84 | OpenTaiko/src/Songs/CTcm.cs:74-80 | OpenTaiko/src/Songs/CTct.cs:41-47 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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 · Duplicated block (17–51 lines × 2) · ×1
  • Duplicated block (17–51 lines × 2) OpenTaiko.Android/CInputKeyboard_Android.cs:128 — OpenTaiko.Android/CInputKeyboard_Android.cs:128-144 | OpenTaiko.iOS/CInputKeyboard_iOS.cs:141-191 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko.Android/CInputKeyboard_Android.cs:128` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (40–41 lines × 2) · ×1
  • Duplicated block (40–41 lines × 2) FDK/src/04.Graphics/CTexture.cs:1444 — FDK/src/04.Graphics/CTexture.cs:1444-1484 | FDK/src/04.Graphics/CTexture.cs:1633-1672 — 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 `FDK/src/04.Graphics/CTexture.cs:1444` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17–29 lines × 2) · ×1
  • Duplicated block (17–29 lines × 2) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2120 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2120-2136 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2162-2190 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (25–26 lines × 2) · ×1
  • Duplicated block (25–26 lines × 2) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1933 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1933-1958 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1985-2009 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1933` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10–25 lines × 2) · ×1
  • Duplicated block (10–25 lines × 2) OpenTaiko/src/Stages/08.Result/CStageResult.cs:84 — OpenTaiko/src/Stages/08.Result/CStageResult.cs:84-108 | OpenTaiko/src/Stages/08.Result/CStageResult.cs:187-196 — 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 `OpenTaiko/src/Stages/08.Result/CStageResult.cs:187` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (22–24 lines × 2) · ×1
  • Duplicated block (22–24 lines × 2) OpenTaiko/src/Common/CConstants.cs:44 — OpenTaiko/src/Common/CConstants.cs:44-67 | OpenTaiko/src/Common/CConstants.cs:197-218 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×1
  • Duplicated block (23 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:237 — OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:237-259 | OpenTaiko/src/Stages/08.Result/CStageResult.cs:464-486 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:233` calls `InitScripts` and `OpenTaiko/src/Stages/08.Result/CStageResult.cs:462` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (16–22 lines × 2) · ×1
  • Duplicated block (16–22 lines × 2) OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:283 — OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:283-298 | OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:328-349 — 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 `OpenTaiko/src/Lua/3D/Physics/PhysicsWorld.cs:283` 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.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:113 — FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:113-133 | FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:166-186 — 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 `FDK/src/04.Graphics/TextRenderer/CCachedFontRenderer.cs:113` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (18 lines × 3) · ×1
  • Duplicated block (18 lines × 3) OpenTaiko/src/Songs/CTja.cs:881 — OpenTaiko/src/Songs/CTja.cs:881-898 | OpenTaiko/src/Songs/CTja.cs:906-923 | OpenTaiko/src/Songs/CTja.cs:931-948 — 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 `OpenTaiko/src/Songs/CTja.cs:881` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (16 lines × 4) · ×1
  • Duplicated block (16 lines × 4) OpenTaiko/src/Songs/CTja.cs:857 — OpenTaiko/src/Songs/CTja.cs:857-872 | OpenTaiko/src/Songs/CTja.cs:881-896 | OpenTaiko/src/Songs/CTja.cs:906-921 | OpenTaiko/src/Songs/CTja.cs:931-946 — 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 `OpenTaiko/src/Songs/CTja.cs:857` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (16 lines × 3) · ×1
  • Duplicated block (16 lines × 3) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:28 — OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:28-43 | OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:28-43 | OpenTaiko/src/Components/UnlockConditions/CUnlockSP.cs:26-41 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:28` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) OpenTaiko/src/Databases/DBCharacter.cs:68 — OpenTaiko/src/Databases/DBCharacter.cs:68-83 | OpenTaiko/src/Databases/DBPuchichara.cs:65-80 — before extracting anything, compare `OpenTaiko/src/Databases/DBCharacter.cs` and `OpenTaiko/src/Databases/DBPuchichara.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `OpenTaiko/src/Databases/DBCharacter.cs:85` calls `JsonProperty` and `OpenTaiko/src/Databases/DBPuchichara.cs:81` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (13–16 lines × 2) · ×1
  • Duplicated block (13–16 lines × 2) FDK/src/01.Framework/Core/Game.cs:667 — FDK/src/01.Framework/Core/Game.cs:667-682 | FDK/src/01.Framework/Core/Game.cs:1139-1151 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×1
  • Duplicated block (15–16 lines × 2) FDK/src/03.Sound/CSoundDeviceWASAPI.cs:247 — FDK/src/03.Sound/CSoundDeviceWASAPI.cs:247-261 | FDK/src/03.Sound/CSoundDeviceWASAPI.cs:279-294 — 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.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:12 — OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs:12-26 | OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs:12-26 | OpenTaiko/src/Components/UnlockConditions/CUnlockSP.cs:10-24 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockSC.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockSG.cs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (13–15 lines × 2) · ×1
  • Duplicated block (13–15 lines × 2) OpenTaiko/src/Stages/07.Game/CActPlayComboSound.cs:63 — OpenTaiko/src/Stages/07.Game/CActPlayComboSound.cs:63-77 | OpenTaiko/src/Stages/07.Game/CActPlayComboSound.cs:90-102 — 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 `OpenTaiko/src/Stages/07.Game/CActPlayComboSound.cs:63` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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.
D4 · Code Duplication · Duplicated block (12–14 lines × 3) · ×1
  • Duplicated block (12–14 lines × 3) OpenTaiko/src/Components/UnlockConditions/CUnlockCH.cs:12 — OpenTaiko/src/Components/UnlockConditions/CUnlockCH.cs:12-25 | OpenTaiko/src/Components/UnlockConditions/CUnlockCM.cs:12-23 | OpenTaiko/src/Components/UnlockConditions/CUnlockCS.cs:12-23 — 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 all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (11–13 lines × 3) · ×1
  • Duplicated block (11–13 lines × 3) OpenTaiko/src/Common/CSkin.cs:1124 — OpenTaiko/src/Common/CSkin.cs:1124-1134 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:260-272 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplRunner.cs:168-180 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Common/CSkin.cs:1124` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:12 — OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:12-24 | OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs:12-24 | OpenTaiko/src/Components/UnlockConditions/CUnlockSD.cs:12-24 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:12` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (5–13 lines × 2) · ×1
  • Duplicated block (5–13 lines × 2) OpenTaiko.Android/CInputKeyboard_Android.cs:123 — OpenTaiko.Android/CInputKeyboard_Android.cs:123-127 | OpenTaiko.iOS/CInputKeyboard_iOS.cs:120-132 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) OpenTaiko/src/Songs/CTja.cs:2749 — OpenTaiko/src/Songs/CTja.cs:2749-2758 | OpenTaiko/src/Songs/CTja.cs:2767-2778 — 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 `OpenTaiko/src/Songs/CTja.cs:2749` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (7 lines × 7) · ×1
  • Duplicated block (7 lines × 7) OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:20 — OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:20-26 | OpenTaiko/src/Components/UnlockConditions/CUnlockAW.cs:20-26 | OpenTaiko/src/Components/UnlockConditions/CUnlockCE.cs:20-26 | OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:18-24 | OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs:18-24 | OpenTaiko/src/Components/UnlockConditions/CUnlockSD.cs:18-24 | OpenTaiko/src/Components/UnlockConditions/CUnlockTP.cs:20-26 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:20` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (4–11 lines × 3) · ×1
  • Duplicated block (4–11 lines × 3) OpenTaiko/src/Lua/3D/Rasterizer.cs:366 — OpenTaiko/src/Lua/3D/Rasterizer.cs:366-376 | OpenTaiko/src/Lua/3D/Rasterizer.cs:397-400 | OpenTaiko/src/Lua/3D/Rasterizer.cs:443-453 — 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 `OpenTaiko/src/Lua/3D/Rasterizer.cs:366` 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. 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 after the matched lines, `OpenTaiko/src/Lua/3D/Rasterizer.cs:378` calls `CB` and `OpenTaiko/src/Lua/3D/Rasterizer.cs:454` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1
  • Duplicated block (10–11 lines × 2) OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:51 — OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:51-61 | OpenTaiko/src/Stages/07.Game/Taiko/CActImplPad.cs:47-56 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs:51` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (8 lines × 8) · ×1
  • Duplicated block (8 lines × 8) OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:20 — OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:20-27 | OpenTaiko/src/Components/UnlockConditions/CUnlockAW.cs:20-27 | OpenTaiko/src/Components/UnlockConditions/CUnlockCE.cs:20-27 | OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:18-25 | OpenTaiko/src/Components/UnlockConditions/CUnlockGC.cs:19-26 | OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs:18-25 | OpenTaiko/src/Components/UnlockConditions/CUnlockSD.cs:18-25 | OpenTaiko/src/Components/UnlockConditions/CUnlockTP.cs:20-27 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Components/UnlockConditions/CUnlockAP.cs:20` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1
  • Duplicated block (9 lines × 3) OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:27 — OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:27-35 | OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs:27-35 | OpenTaiko/src/Components/UnlockConditions/CUnlockSD.cs:27-35 — before extracting anything, compare `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs` and `OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:27` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (7–10 lines × 2) · ×1
  • Duplicated block (7–10 lines × 2) FDK/src/01.Framework/Rendering/ShaderHelper.cs:27 — FDK/src/01.Framework/Rendering/ShaderHelper.cs:27-36 | FDK/src/01.Framework/Rendering/ShaderHelper.cs:65-71 — 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 `FDK/src/01.Framework/Rendering/ShaderHelper.cs:27` 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, `FDK/src/01.Framework/Rendering/ShaderHelper.cs:72` calls `DeleteShader` and `FDK/src/01.Framework/Rendering/ShaderHelper.cs:37` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9 lines × 7) · ×1
  • Duplicated block (9 lines × 7) OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:51 — OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:51-59 | OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:63-71 | OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:75-83 | OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:63-71 | OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:75-83 | OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:87-95 | OpenTaiko/src/Stages/07.Game/Taiko/CStagePlayDrumsScreen.cs:99-107 — there are 7 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart.
D4 · Code Duplication · Duplicated block (7 lines × 4) · ×1
  • Duplicated block (7 lines × 4) FDK/src/00.Common/CCounter.cs:133 — FDK/src/00.Common/CCounter.cs:133-139 | FDK/src/00.Common/CCounter.cs:156-162 | FDK/src/00.Common/CCounter.cs:193-199 | FDK/src/00.Common/CCounter.cs:216-222 — 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 `FDK/src/00.Common/CCounter.cs:133` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (7–8 lines × 3) · ×1
  • Duplicated block (7–8 lines × 3) OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4048 — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4048-4054 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4077-4083 | OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4181-4188 — 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 `OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4048` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×1
  • Duplicated block (8 lines × 3) OpenTaiko/src/Stages/CActFIFOBlack.cs:22 — OpenTaiko/src/Stages/CActFIFOBlack.cs:22-29 | OpenTaiko/src/Stages/CActFIFOResult.cs:30-37 | OpenTaiko/src/Stages/CActFIFOWhite.cs:21-28 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Stages/CActFIFOBlack.cs:22` 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. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (5–6 lines × 2) · ×1
  • Duplicated block (5–6 lines × 2) OpenTaiko/src/Lua/3D/Lua3DScene.RenderSize.cs:21 — OpenTaiko/src/Lua/3D/Lua3DScene.RenderSize.cs:21-25 | OpenTaiko/src/Lua/3D/Lua3DScene.cs:37-42 — 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.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×1
  • Duplicated block (5 lines × 4) OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:275 — OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:275-279 | OpenTaiko/src/Stages/CActFIFOBlack.cs:22-27 | OpenTaiko/src/Stages/CActFIFOResult.cs:30-35 | OpenTaiko/src/Stages/CActFIFOWhite.cs:21-26 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:275` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (4–5 lines × 4) · ×1
  • Duplicated block (4–5 lines × 4) OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:483 — OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:483-486 | OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:492-496 | OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:499-502 | OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:508-513 — 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 `OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:492` 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. 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, `OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:492` calls `t2DScaledBottomCenterBasedDraw`, `Rectangle` and `OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs:483` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (5 lines × 6) · ×1
  • Duplicated block (5 lines × 6) OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:109 — OpenTaiko/src/Lua/3D/GpuRasterizer.GrassTile.cs:109-113 | OpenTaiko/src/Lua/3D/GpuRasterizer.LightGrid.cs:76-80 | OpenTaiko/src/Lua/3D/GpuRasterizer.Reflections.cs:41-45 | OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:76-80 | OpenTaiko/src/Lua/3D/GpuRaytracer.cs:349-353 | OpenTaiko/src/Lua/3D/GpuRaytracer.cs:454-458 — there are 6 copies across 5 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `OpenTaiko/src/Lua/3D/GpuRasterizer.Reflections.cs:46` calls `GenRenderbuffer`, `BindRenderbuffer`, `RenderbufferStorage` and `OpenTaiko/src/Lua/3D/GpuRasterizer.Shadows.cs:81` 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.
GD1 · Unfinished & placeholder code · Unfinished stub · ×1
  • Unfinished stub — throws NotImplementedException OpenTaiko/src/Animations/Animator.cs:60 — A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
IC1 · Incompleteness & stubs · Guard cannot change the result · ×1
  • Guard cannot change the result — returns what the code already falls through to FDK/src/00.Common/CActivity.cs:147 — 1 guard above `return 0;` also returns `0`, so no input can make it matter. Implement the distinction that was intended, or delete the guard.
IC1 · Incompleteness & stubs · Hollow method · ×1
  • Hollow method — returns a constant without doing the work OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongListSettings.cs:155 — `Generate` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
IC1 · Incompleteness & stubs · Dead `#if false` region · ×1
  • Dead `#if false` region OpenTaiko/src/Stages/01.StartUp/CStageStartup.cs:229 — Code inside a `#if false` block is permanently excluded from the build — disabled code that should be removed or restored.
IC1 · Incompleteness & stubs · Both branches are identical · ×1
  • Both branches are identical — the condition decides nothing OpenTaiko/src/Stages/CActFIFOStart.cs:31 — The `if` and its `else` contain the same 1 statement, so no input can make the condition matter. Implement the distinction that was intended, or drop the branch and keep the body.
X12 · Unreachable branch · Branch is unreachable · ×1
  • Branch is unreachable — its condition cannot hold here OpenTaiko/src/Stages/07.Game/Taiko/Dan_Cert.cs:1276 — `value < 0` can never be true where it stands: the guard on line 1272 (`OpenTaiko.Tx.DanC_MiniNumber == null || value < 0`) left this block when it was true. No value of `value` satisfies all of that, so this arm never runs. Reorder the tests, drop the dead branch, or fix the bound that was meant.
X2 · Cancellation propagation · Async method without CancellationToken · ×1
  • Async method without CancellationToken: GetCallAPI OpenTaiko/src/Stages/12.OnlineLounge/API.cs:104 — No CancellationToken parameter — this work can't be stopped early once started.
X24 · Document value interpolated into markup unescaped · Document value reaches a markup attribute unescaped · ×1
  • Document value reaches a markup attribute unescaped OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1474 — `_upnpServiceType` carries text this program read out of the document being converted, and it is written straight into the `xmlns:u` attribute of generated markup with nothing escaping it on the way. The value is chosen by whoever authored the file, not by this program, so it can close the attribute it sits in and open another — a crafted document becomes markup in the output this renderer produces. Escape `_upnpServiceType` at this site, or validate it against the shape the attribute accepts before interpolating it.
X29 · Per-element action decided by a fixed element · Per-element action decided by a fixed element · ×1
  • Per-element action decided by a fixed element OpenTaiko/src/Songs/CTja.cs:3579 — This loop runs once per element of `metadatas`, and the statement it guards acts on the element it is on — `this.nowGameType = metadata.GameType;`. The test deciding whether that statement runs does not: `metadatas.FirstOrDefault() == this.PlayerSideMetadata` reads `metadatas.FirstOrDefault()`, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One `if` names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The `if` is in the wrong place under both readings. Give the test the loop variable, or hoist it out.
Minor — 161 finding(s)
IC1 · Incompleteness & stubs · Commented-out code · ×30
  • Commented-out code FDK/src/00.Common/CActivity.cs:51 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/00.Common/CActivity.cs:52 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/00.Common/CActivity.cs:67 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/00.Common/CActivity.cs:68 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/00.Common/CConversion.cs:159 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/01.Framework/Core/Game.cs:408 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/01.Framework/Core/Game.cs:409 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/01.Framework/Core/Game.cs:410 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/01.Framework/Core/Game.cs:509 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/01.Framework/Core/Game.cs:713 — 20 consecutive lines of code sit inside a `/* … */` block — a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/01.Framework/Core/Game.cs:1128 — 4 consecutive lines of code sit inside a `/* … */` block — a block of code switched off rather than removed, which rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/01.Framework/Rendering/Angle/AngleContext.cs:164 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/02.Input/CInputManager.cs:184 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/02.Input/CInputManager.cs:185 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/02.Input/CInputManager.cs:186 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:109 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:110 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:291 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:292 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:330 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:425 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:442 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:447 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:500 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • Commented-out code FDK/src/03.Sound/CSound.cs:503 — A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
  • + 5 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×28
  • Duplicated predicate OpenTaiko/src/Stages/07.Game/Taiko/CActImplRollEffect.cs:87 — `!base.IsDeActivated && !OpenTaiko.ConfigIni.SimpleMode` appears character-identically in 4 files — OpenTaiko/src/Stages/07.Game/Taiko/CActImplRollEffect.cs, OpenTaiko/src/Stages/07.Game/Taiko/FireWorks.cs, OpenTaiko/src/Stages/07.Game/Taiko/FlyingNotes.cs, OpenTaiko/src/Stages/07.Game/Taiko/Rainbow.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 OpenTaiko/src/Songs/CTja.cs:1059 — `(cwav.rSound[i] != null) && cwav.rSound[i]!.IsPlaying` appears character-identically in 2 files — OpenTaiko/src/Songs/CTja.cs, OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.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 OpenTaiko/src/Common/CConfigIni.cs:2031 — `(num < line.Length) && (line[num] != ']')` appears character-identically in 2 files — FDK/src/00.Common/CIniFile.cs, OpenTaiko/src/Common/CConfigIni.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 OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs:543 — `NotesManager.IsGenericRoll(chip) && !NotesManager.IsRollEnd(chip)` appears character-identically in 3 files — OpenTaiko/src/Lua/Classes/SongsManagement/LuaDanBuildFunc.cs, OpenTaiko/src/Songs/CTja.cs, OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs:130 — `OpenTaiko.ConfigIni.bAIBattleMode && i == 1` appears character-identically in 3 files — OpenTaiko/src/Stages/07.Game/Taiko/CActImplGauge.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.cs, OpenTaiko/src/Stages/08.Result/CStageResult.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 OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:1333 — `OpenTaiko.ConfigIni.bAIBattleMode && iPlayer == 1` appears character-identically in 2 files — OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.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 OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs:186 — `OpenTaiko.ConfigIni.bAIBattleMode && player == 1` appears character-identically in 3 files — OpenTaiko/src/Stages/07.Game/CActPlayScoreCommon.cs, OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs, OpenTaiko/src/Stages/CNamePlate.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 OpenTaiko/src/Songs/TJA/TriggersCounters/CLocalCounters.cs:22 — `OpenTaiko.ConfigIni.bAutoPlay[_player] || (OpenTaiko.ConfigIni.bAIBattleMode && _player == 1)` appears character-identically in 2 files — OpenTaiko/src/Songs/TJA/TriggersCounters/CLocalCounters.cs, OpenTaiko/src/Songs/TJA/TriggersCounters/CLocalTriggers.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 OpenTaiko/src/Songs/CTja.cs:981 — `OpenTaiko.ConfigIni.bNoAudioIfNot1xSpeed && OpenTaiko.ConfigIni.nSongSpeed != 20` appears character-identically in 2 files — OpenTaiko/src/Songs/CTja.cs, OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.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 OpenTaiko/src/Helpers/HGaugeMethods.cs:478 — `OpenTaiko.ConfigIni.nPlayerCount == 4 || OpenTaiko.ConfigIni.nPlayerCount == 3` appears character-identically in 13 files — OpenTaiko/src/Helpers/HGaugeMethods.cs, OpenTaiko/src/Stages/07.Game/CActPlayComboCommon.cs, OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplBalloon.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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplComboBalloon.cs:54 — `OpenTaiko.ConfigIni.nPlayerCount > 2 || OpenTaiko.ConfigIni.SimpleMode` appears character-identically in 2 files — OpenTaiko/src/Stages/07.Game/Taiko/CActImplComboBalloon.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplMtaiko.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 OpenTaiko/src/Common/OpenTaiko.cs:393 — `OpenTaiko.PlayerSide == 1 && OpenTaiko.ConfigIni.nPlayerCount == 1` appears character-identically in 3 files — OpenTaiko/src/Common/OpenTaiko.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplComboBalloon.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplScore.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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs:135 — `OpenTaiko.SongMount.nChoosenSongDifficulty[0] != (int)Difficulty.Tower && OpenTaiko.SongMount.nChoosenSongDifficulty[0] != (int)Difficulty.D…` appears character-identically in 2 files — OpenTaiko/src/Stages/07.Game/Taiko/CActImplDancer.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplMob.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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs:32 — `OpenTaiko.stageGameScreen.CChartScore[0].nMiss == 0 && OpenTaiko.stageGameScreen.CChartScore[0].nMine == 0` appears character-identically in 3 files — OpenTaiko/src/Stages/07.Game/Taiko/CActImplClearAnimation.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplScoreRank.cs, OpenTaiko/src/Stages/08.Result/CStageResult.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 OpenTaiko/src/Common/CTextInput.cs:42 — `OperatingSystem.IsIOS() || OperatingSystem.IsAndroid()` appears character-identically in 10 files — FDK/src/01.Framework/Core/Game.cs, FDK/src/03.Sound/CSoundDeviceBASS.cs, FDK/src/04.Graphics/CTexture.cs, FDK/src/04.Graphics/TextRenderer/CSkiaSharpTextRenderer.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 OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs:39 — `_aimedStatus < (int)EClearStatus.NONE || _aimedStatus >= (int)EClearStatus.TOTAL` appears character-identically in 3 files — OpenTaiko/src/Components/UnlockConditions/CUnlockDP.cs, OpenTaiko/src/Components/UnlockConditions/CUnlockLP.cs, OpenTaiko/src/Components/UnlockConditions/CUnlockSD.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 OpenTaiko/src/Lua/3D/GpuRasterizer.cs:137 — `_fbo != 0 && _fboW == s._w && _fboH == s._h && _fboColorTex == colorTex` appears character-identically in 2 files — OpenTaiko/src/Lua/3D/GpuRasterizer.cs, OpenTaiko/src/Lua/3D/GpuRaytracer.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 OpenTaiko/src/Lua/3D/GltfModel.cs:883 — `bytes.Length >= 3 && bytes[0] == 0xEF && bytes[1] == 0xBB && bytes[2] == 0xBF` appears character-identically in 2 files — OpenTaiko/src/Lua/3D/GltfModel.cs, OpenTaiko/src/Lua/AviUtl2/Aup2ScriptFile.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 OpenTaiko/src/Common/ImGuiDebugWindow.cs:219 — `i == 1 && OpenTaiko.ConfigIni.bAIBattleMode` appears character-identically in 2 files — OpenTaiko/src/Common/ImGuiDebugWindow.cs, OpenTaiko/src/Stages/07.Game/Taiko/CActImplScore.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 OpenTaiko.iOS/CInputKeyboard_iOS.cs:28 — `key == Key.Unknown || (int)key >= this.ButtonStates.Length` appears character-identically in 2 files — OpenTaiko.Android/CInputKeyboard_Android.cs, OpenTaiko.iOS/CInputKeyboard_iOS.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 OpenTaiko/src/Common/KeyboardSoundGroupLevelControlHandler.cs:36 — `keyboard.KeyPressing((int)SlimDXKeys.Key.LeftControl) || keyboard.KeyPressing((int)SlimDXKeys.Key.RightControl)` appears character-identically in 2 files — OpenTaiko/src/Common/KeyboardSoundGroupLevelControlHandler.cs, OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.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 OpenTaiko/src/Lua/Classes/LuaConfigIni.cs:55 — `player < 0 || player >= OpenTaiko.MAX_PLAYERS` appears character-identically in 3 files — OpenTaiko/src/Lua/CLuaScript.cs, OpenTaiko/src/Lua/Classes/LuaConfigIni.cs, OpenTaiko/src/Lua/Classes/LuaROConfigIni.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 OpenTaiko/src/Stages/07.Game/Taiko/CActImplScoreRank.cs:185 — `progress == 1 && OpenTaiko.stageGameScreen.FloorManagement.CurrentNumberOfLives > 0` appears character-identically in 2 files — OpenTaiko/src/Stages/07.Game/Taiko/CActImplScoreRank.cs, OpenTaiko/src/Stages/08.Result/CStageResult.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 OpenTaiko/src/Lua/3D/GpuRaytracer.cs:159 — `resize || s._rtRevision != _lastRevision` appears character-identically in 2 files — OpenTaiko/src/Lua/3D/GpuRaytracer.cs, OpenTaiko/src/Lua/3D/Raytracer.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 OpenTaiko/src/Lua/3D/GpuRasterizer.Shaders.cs:203 — `s_progCache.TryGetValue(key, out var p) && p != 0 && Gl.IsProgram(p)` appears character-identically in 2 files — OpenTaiko/src/Lua/3D/GpuRasterizer.Shaders.cs, OpenTaiko/src/Lua/3D/GpuRaytracer.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.
  • + 3 more in this group — see findings.md.
D24 · Comment Value · redundant comment · ×26
  • redundant comment FDK/src/01.Framework/Rendering/Angle/Egl.cs:213 — "EGL_ANGLE_query_surface_pointer" repeats the code it sits on: 5 of its 5 words (egl, angle, query, surface, pointer) are already in `[DllImport("libEGL", EntryPoint = "eglQuerySurfacePointerANGLE")]`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment FDK/src/01.Framework/Rendering/Angle/Egl.cs:220 — "EGL_ANGLE_software_display" repeats the code it sits on: 4 of its 4 words (egl, angle, software, display) are already in `public static readonly EGLNativeDisplayType SOFTWARE_DISPLAY_ANGLE = new EGLNativeDisplayType(-1);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment FDK/src/04.Graphics/TextRenderer/CSkiaSharpTextRenderer.cs:465 — "the system's font for this character in the style of `typeface` (null when it has none), one shared instance per family and style" repeats the code it sits on: 8 of its 10 words (system, font, character, style, typeface, null, shared, family) are already in `private static SKTypeface? SystemTypefaceFor(SKTypeface typeface, int codepoint)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko.Tests/StageNamespacesTests.cs:33 — "writes what the namespace lists into the shared string "<tag>": name|isGlobal|title|order|tags per entry" repeats the code it sits on: 10 of its 12 words (namespace, lists, shared, string, tag, name, global, title, order, tags) are already in `private string ProbeScript(string tag) =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko.iOS/GameViewController.cs:346 — "Start the display link." repeats the code it sits on: 3 of its 3 words (start, display, link) are already in `StartDisplayLink(UIScreen.MainScreen);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Common/CSkin.cs:590 — "Main Menu Settings" repeats the code it sits on: 3 of its 3 words (main, menu, settings) are already in `MainMenuSettings = new CMainMenuSettings();`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Common/CSongDict.cs:76 — "Generate a back button" repeats the code it sits on: 3 of its 3 words (generate, back, button) are already in `public static CSongListNode tGenerateBackButton(CSongListNode parent, string? path = "/", List<string>? listStrBoxDef = …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Common/CSongDict.cs:194 — "Generate recently played songs folder" repeats the code it sits on: 4 of its 5 words (recently, played, songs, folder) are already in `public static List<CSongListNode> tFetchRecentlyPlayedSongsFolder(CSongListNode parent) {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Common/OpenTaiko.cs:816 — "Propagate AfterSongEnum events to all lua stages" repeats the code it sits on: 6 of its 6 words (propagate, song, enum, events, lua, stages) are already in `LuaStageWrapper.PropagateAfterSongEnumEvent();`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Components/CSongReplay.cs:510 — "Gauge fill value" repeats the code it sits on: 3 of its 3 words (gauge, fill, value) are already in `GaugeFill = (float)OpenTaiko.stageGameScreen.actGauge.dbCurrentGaugeValue[storedPlayer];`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Databases/DBCharacter.cs:67 — "String or CLocalizationData" repeats the code it sits on: 3 of its 3 words (string, localization, data) are already in `[JsonProperty("name")]`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Databases/DBCharacter.cs:75 — "String or CLocalizationData" repeats the code it sits on: 3 of its 3 words (string, localization, data) are already in `[JsonProperty("author")]`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Databases/DBCharacter.cs:80 — "String or CLocalizationData" repeats the code it sits on: 3 of its 3 words (string, localization, data) are already in `[JsonProperty("description")]`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Databases/DBPuchichara.cs:64 — "String or CLocalizationData" repeats the code it sits on: 3 of its 3 words (string, localization, data) are already in `[JsonProperty("name")]`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Databases/DBPuchichara.cs:72 — "String or CLocalizationData" repeats the code it sits on: 3 of its 3 words (string, localization, data) are already in `[JsonProperty("author")]`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Databases/DBPuchichara.cs:77 — "String or CLocalizationData" repeats the code it sits on: 3 of its 3 words (string, localization, data) are already in `[JsonProperty("description")]`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:227 — "one value per save and name; runs in one transaction with the version update" repeats the code it sits on: 6 of its 7 words (value, save, name, transaction, version, update) are already in `private static void AddGlobalStringsTable(SqliteConnection connection) {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Helpers/HPrivateFastFont.cs:26 — "the skin's lyric font, or its main font when it names none" repeats the code it sits on: 5 of its 6 words (skin, lyric, font, main, names) are already in `public static CCachedFontRenderer tInstantiateLyricFont(int scale, CFontRenderer.FontStyle style = CFontRenderer.FontSty …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Lua/Classes/SongsManagement/LuaSongList.cs:450 — "Create the virtual folder CSongListNode" repeats the code it sits on: 5 of its 6 words (create, folder, song, list, node) are already in `var cFolder = new CSongListNode { nodeType = CSongListNode.ENodeType.BOX };`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Songs/CTja.cs:1577 — "courseSections[n] (n > 1) starts with `COURSE` + `:`" repeats the code it sits on: 3 of its 3 words (course, sections, starts) are already in `int valueStart = courseSections[n].IndexOf(':') + 1;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:2757 — "the special mod this machine judges the player under" repeats the code it sits on: 4 of its 5 words (special, mod, judges, player) are already in `public ESpecialMod JudgedSpecialMod(int iPlayer)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:3872 — "pChip.ForEachTargetBranch(branch => this.bIsGOGOTIME_Branch[nPlayer, (int)branch] = isGoGo)" repeats the code it sits on: 6 of its 7 words (chip, target, branch, gogotime, player, go) are already in `private void SetGoGoTimeOfTargetBranches(int nPlayer, CChip pChip, bool isGoGo) {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Stages/07.Game/CStagePlayScreenCommon.cs:4502 — "points[b] = GetNowPBPMPoint(tja, play_time, (CTja.ECourse)b) for the three branches" repeats the code it sits on: 9 of its 11 words (points, get, now, pbpm, point, tja, play, time, course) are already in `internal void GetNowPBPMPoints(double play_time, CTja.CBPM[] points) {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Stages/07.Game/Taiko/CActImplCharacter.cs:809 — "action keeping priority: generic balloon broke/miss > breaking > other > none" repeats the code it sits on: 9 of its 9 words (action, keeping, priority, generic, balloon, broke, miss, breaking, none) are already in `private static EAnimePriority ActionKeepingPriority(string? animationType) => animationType switch {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment OpenTaiko/src/Stages/07.Game/Taiko/CActPlayDrumsGameMode.cs:89 — "each player's timer frame, digits and added seconds" repeats the code it sits on: 6 of its 6 words (player, timer, frame, digits, added, seconds) are already in `public void DrawTimers() {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • + 1 more in this group — see findings.md.
X7 · Silent fallback defaults · Silent fallback default in catch · ×24
  • Silent fallback default in catch OpenTaiko/src/Common/RecentlyPlayedSongs.cs:40 — `tLoadFile` swallows every exception and sets `data = new Data();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Components/CSongReplay.cs:90 — `tComputeChartMd5` swallows every exception into `return "";` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Components/CSongReplay.cs:105 — `tComputeChartMd5Cached` swallows every exception into `return "";` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Components/CSongReplay.cs:246 — `Date` swallows every exception into `return "";` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Databases/DBNameplateUnlockables.cs:85 — `tKey` swallows every exception into `return "";` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Helpers/ObjectExtensions.cs:273 — `SafeGetDirectories` swallows every exception into `return Enumerable.Empty<string>();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Lua/3D/LuaModelFunc.cs:30 — `IsReady` 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 OpenTaiko/src/Lua/AviUtl2/Aup2FiltersExtra.cs:255 — `WithImage` swallows every exception and sets `ok = false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Lua/Classes/LuaAviUtl2.cs:438 — `Model` swallows every exception and sets `mesh = null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Lua/Classes/LuaGlyphText.cs:114 — `AdvanceOf` swallows every exception and sets `a = 0;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch REDACTED:30 — `ExtractText` 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:94 — `JsonParseStringAny` 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 OpenTaiko/src/Lua/Classes/LuaPuchichara.cs:65 — `LoadTexture` swallows every exception into `return new LuaTexture();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch REDACTED:47 — `WriteText` 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:76 — `WriteLobbyCode` 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:87 — `RevealLobbyCodes` 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 OpenTaiko/src/Lua/Classes/LuaTexture.cs:191 — `tParseMaxSize` swallows every exception into `return 0;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Lua/LuaSecurity.cs:124 — `Secure` 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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:350 — `SetPlaySpots` swallows every exception and sets `_spotPeers = null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
  • Silent fallback default in catch OpenTaiko/src/Lua/Networking/LuaNetworking.cs:394 — `GetSpotClearLevel` 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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:402 — `GetSpotJudge` 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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:718 — `OpenPsk` 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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1190 — `TryRejoin` 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 OpenTaiko/src/Lua/Networking/LuaNetworking.cs:1341 — `ReadExact` swallows every exception into `return null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×11
  • Silent fallback default on parse failure OpenTaiko/src/Common/CThemeSettingDef.cs:78 — `DefaultInt` falls back to `0` when `int.TryParse(Default, out int v)` 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 OpenTaiko/src/Common/CThemeSettingDef.cs:79 — `DefaultDouble` falls back to `0.0` when `double.TryParse(Default, System.Globalization.NumberStyles.Any, System.Globaliza…` 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 OpenTaiko/src/Lua/3D/ObjModel.cs:190 — `Idx` returns `-1` when `int.TryParse(s, NumberStyles.Integer, CultureInfo.InvariantCulture, out int i)` 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 OpenTaiko/src/Lua/3D/ObjModel.cs:193 — `F` falls back to `0f` when `float.TryParse(s, NumberStyles.Float, CultureInfo.InvariantCulture, out float f)` 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 OpenTaiko/src/Lua/AviUtl2/Aup2FiltersDistort.cs:373 — `Numbers` falls back to `0` when `double.TryParse(piece, NumberStyles.Float, CultureInfo.InvariantCulture, out dou…` 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 OpenTaiko/src/Lua/AviUtl2/Aup2FiltersExtra.cs:241 — `Numbers` falls back to `0` when `double.TryParse(piece, NumberStyles.Float, CultureInfo.InvariantCulture, out dou…` 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 OpenTaiko/src/Lua/AviUtl2/Aup2ScriptHost.cs:1140 — `GetValue` returns `0` when `int.TryParse(target.AsSpan(5, i - 5), NumberStyles.Integer, CultureInfo.Invarian…` 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 OpenTaiko/src/Lua/AviUtl2/Aup2Text.cs:206 — `Tag` returns `false` when `float.TryParse(p[0], NumberStyles.Float, CultureInfo.InvariantCulture, out float…` 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 OpenTaiko/src/Lua/Classes/LuaColor.cs:34 — `CreateColorFromHex` falls back to `Color.White` when `int.TryParse(value, NumberStyles.HexNumber, CultureInfo.InvariantCulture, out in…` 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 OpenTaiko/src/Lua/Classes/LuaInput.cs:216 — `MouseButtonIndex` falls back to `-1` when `int.TryParse(button, out var i)` 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:24 — `ExtractNumber` falls back to `0` when `(string?)x is string s && double.TryParse(s, out double v)` 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.
P2 · Observability · Console output used as the logging channel · ×8
  • Console output used as the logging channel OpenTaiko/src/Common/OpenTaiko.cs:733 — `OpenTaiko/src/Common/OpenTaiko.cs` reports through `Console.Write…` at line 733 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
  • Console output used as the logging channel FDK/src/01.Framework/Core/Game.cs:490 — `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 490 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
  • Console output used as the logging channel FDK/src/01.Framework/Core/Game.cs:491 — `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 491 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
  • Console output used as the logging channel FDK/src/01.Framework/Core/Game.cs:677 — `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 677 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
  • Console output used as the logging channel FDK/src/01.Framework/Core/Game.cs:931 — `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 931 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
  • Console output used as the logging channel FDK/src/01.Framework/Core/Game.cs:1146 — `FDK/src/01.Framework/Core/Game.cs` reports through `Console.Write…` at line 1146 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
  • Console output used as the logging channel OpenTaiko.iOS/GameViewController.cs:96 — `OpenTaiko.iOS/GameViewController.cs` reports through `Console.Write…` at line 96 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
  • Console output used as the logging channel OpenTaiko.iOS/GameViewController.cs:110 — `OpenTaiko.iOS/GameViewController.cs` reports through `Console.Write…` at line 110 although other files in its project log through a logger. Console lines carry no level, category or structured properties and never reach the log pipeline or its exporters.
X7 · Silent fallback defaults · Silent fallback default on unknown code · ×5
  • Silent fallback default on unknown code OpenTaiko/src/Common/CConfigIni.cs:2740 — `ProcessGuidSection` maps every unrecognised code to `InputDeviceType.Unknown`, one of the real values, with no log or throw — a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing.
  • Silent fallback default on unknown code OpenTaiko/src/Lua/AviUtl2/Aup2Track.cs:76 — `Parse` maps every unrecognised code to `Aup2Motion.Unknown`, one of the real values, with no log or throw — a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing.
  • Silent fallback default on unknown code OpenTaiko/src/Lua/Classes/LuaTexture.cs:56 — `DrawRectAtAnchor` maps every unrecognised code to `CTexture.RefPnt.UpLeft`, one of the real values, with no log or throw — a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing.
  • Silent fallback default on unknown code OpenTaiko/src/Lua/LuaStageWrapper.cs:150 — `_StringToLegacyValue` maps every unrecognised code to `EReturnValue.BackToTitle`, one of the real values, with no log or throw — a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing.
  • Silent fallback default on unknown code OpenTaiko/src/Lua/LuaStageWrapper.cs:159 — `_StringToReturnValue` maps every unrecognised code to `EReturnValue.BackToTitle`, one of the real values, with no log or throw — a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing.
D21 · Naming Consistency · `bChildBOXRecurse` spells `BOX` where 32 names in the project spell it `Box` · ×2
  • `bChildBOXRecurse` spells `BOX` where 32 names in the project spell it `Box` OpenTaiko/src/Songs/CSongManager.cs:114 — 32 of 34 names in project OpenTaiko spell the token `Box` (32 of 34; unit: names in project OpenTaiko containing `Box`). Peers: CSkin.lockBoxDefSkin (OpenTaiko/src/Common/CSkin.cs:480); CSkin.bUseBoxDefSkin (OpenTaiko/src/Common/CSkin.cs:481); CSkin._strBoxDefSkinSubfolders (OpenTaiko/src/Common/CSkin.cs:485); CSkin.strBoxDefSkinSubfolders (OpenTaiko/src/Common/CSkin.cs:486); CSkin.strBoxDefSkinSubfolderFullName (OpenTaiko/src/Common/CSkin.cs:500). Rename to `bChildBoxRecurse`. [rule N6]
  • `bChildBOXRecurse` spells `BOX` where 32 names in the project spell it `Box` OpenTaiko/src/Songs/CSongManager.cs:297 — 32 of 34 names in project OpenTaiko spell the token `Box` (32 of 34; unit: names in project OpenTaiko containing `Box`). Peers: CSkin.lockBoxDefSkin (OpenTaiko/src/Common/CSkin.cs:480); CSkin.bUseBoxDefSkin (OpenTaiko/src/Common/CSkin.cs:481); CSkin._strBoxDefSkinSubfolders (OpenTaiko/src/Common/CSkin.cs:485); CSkin.strBoxDefSkinSubfolders (OpenTaiko/src/Common/CSkin.cs:486); CSkin.strBoxDefSkinSubfolderFullName (OpenTaiko/src/Common/CSkin.cs:500). Rename to `bChildBoxRecurse`. [rule N6]
X4 · Structured logging · Interpolated log message defeats structured logging · ×2
  • Interpolated log message defeats structured logging OpenTaiko/src/Songs/SoundtrackDownloader.cs:82 — Logging an interpolated string (`$"..."`) collapses the event to plain text — you lose the named, queryable properties structured logging exists for. Use a message template with placeholders: `LogInformation("User {UserId} did {Action}", id, action)`. If these calls go through a logging wrapper that only accepts a pre-formatted string, give the wrapper a template+args overload that forwards to the underlying logger, then migrate call sites to it.
  • Interpolated log message defeats structured logging OpenTaiko/src/Songs/SoundtrackDownloader.cs:206 — Logging an interpolated string (`$"..."`) collapses the event to plain text — you lose the named, queryable properties structured logging exists for. Use a message template with placeholders: `LogInformation("User {UserId} did {Action}", id, action)`. If these calls go through a logging wrapper that only accepts a pre-formatted string, give the wrapper a template+args overload that forwards to the underlying logger, then migrate call sites to it.
AX6 · Interface segregation · Fat interface · ×1
  • Fat interface: IInputDevice (20 members) FDK/src/02.Input/IInputDevice.cs:5 — `IInputDevice` declares 20 members under just 15 distinct name(s): `DeviceGeneric`, `Device`, `DeviceMidi`, `CurrentType`, `GUID`, `ID`, `Name`, `InputEvents`, `Polling`, `KeyAvailable`, `KeyAvailable`, `KeyPressed`, `KeyPressed`, `KeyPressing`, `KeyPressing`, `KeyReleased`, `KeyReleased`, `KeyReleasing`, `KeyReleasing`, `GetButtonName`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 20 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 20 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface.
C4 · Data Retention · Partial data-retention evidence · ×1
  • Partial data-retention evidence — A retention mechanism is present, but the data-lifecycle is not yet complete — missing: a documented retention period / data-expiry.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: OpenTaiko/src/Components/CUnlockConditionFactory.cs, OpenTaiko/src/Components/CUnlockCondition.cs. Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (3 single-owned of 334 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 334 of the 500 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: FDK/src/03.Sound/CSoundDeviceBASS.cs.
D19 · Documentation Quality · Documentation · ×1
  • 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.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found OpenTaiko.Android/OpenTaiko.Android.csproj:4 — 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 `OpenTaiko.Android/OpenTaiko.Android.csproj` makes this repository a deployable product (line 4).
D21 · Naming Consistency · `ONorOFFToggle` spells `OFF` where 13 names in the project spell it `Off` · ×1
  • `ONorOFFToggle` spells `OFF` where 13 names in the project spell it `Off` OpenTaiko/src/Items/CItemBase.cs:20 — 13 of 14 names in project OpenTaiko spell the token `Off` (13 of 14; unit: names in project OpenTaiko containing `Off`). Peers: GpuRaytracer._uRowOff (OpenTaiko/src/Lua/3D/GpuRaytracer.cs:45); GpuRaytracer._uTriOff (OpenTaiko/src/Lua/3D/GpuRaytracer.cs:46); GpuRaytracer._uInstOff (OpenTaiko/src/Lua/3D/GpuRaytracer.cs:46); GpuRaytracer._uTlasOff (OpenTaiko/src/Lua/3D/GpuRaytracer.cs:46); GpuRaytracer._uLightOff (OpenTaiko/src/Lua/3D/GpuRaytracer.cs:46). Rename to `ONorOffToggle`. [rule N6]
D21 · Naming Consistency · `ONorOFForIndeterminateThreeState` spells `OF` where 55 names in the project spell it `Of` · ×1
  • `ONorOFForIndeterminateThreeState` spells `OF` where 55 names in the project spell it `Of` OpenTaiko/src/Items/CItemBase.cs:21 — 55 of 56 names in project OpenTaiko spell the token `Of` (55 of 56; unit: names in project OpenTaiko containing `Of`). Peers: CSongReplay.SpecialModOf (OpenTaiko/src/Components/CSongReplay.cs:57); GpuRasterizer._partRunOf (OpenTaiko/src/Lua/3D/GpuRasterizer.Particles.cs:21); ColorPalette.UvOf (OpenTaiko/src/Lua/3D/GpuRasterizer.Textures.cs:212); GpuRasterizer.PiecesOf (OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:112); GpuRasterizer.PlaneOf (OpenTaiko/src/Lua/3D/GpuRasterizer.Transparent.cs:181). Rename to `ONorOfForIndeterminateThreeState`. [rule N6]
D21 · Naming Consistency · `bON` spells `ON` where 47 names in the project spell it `On` · ×1
  • `bON` spells `ON` where 47 names in the project spell it `On` OpenTaiko/src/Items/CItemToggle.cs:9 — 47 of 48 names in project OpenTaiko spell the token `On` (47 of 48; unit: names in project OpenTaiko containing `On`). Peers: CConfigIni.bIncludeSubfoldersOnRandomSelect (OpenTaiko/src/Common/CConfigIni.cs:256); EDifficultyDisplayType.TextOnNthSong (OpenTaiko/src/Common/CConstants.cs:33); EDifficultyDisplayType.ImageOnMTaiko (OpenTaiko/src/Common/CConstants.cs:34); CAnimTier.RowsOnEntry (OpenTaiko/src/Common/CNotesSkins.cs:249); CSkin.DestroyModulesOnExit (OpenTaiko/src/Common/CSkin.cs:543). Rename to `bOn`. [rule N6]
D21 · Naming Consistency · `listBRANCH` spells `BRANCH` where 68 names in the project spell it `Branch` · ×1
  • `listBRANCH` spells `BRANCH` where 68 names in the project spell it `Branch` OpenTaiko/src/Songs/CTja.cs:388 — 68 of 69 names in project OpenTaiko spell the token `Branch` (68 of 69; unit: names in project OpenTaiko containing `Branch`). Peers: CKeyAssignPad.TrainingBranchNormal (OpenTaiko/src/Common/CConfigIni.cs:165); CKeyAssignPad.TrainingBranchExpert (OpenTaiko/src/Common/CConfigIni.cs:166); CKeyAssignPad.TrainingBranchMaster (OpenTaiko/src/Common/CConfigIni.cs:167); CConfigIni.bBranchGuide (OpenTaiko/src/Common/CConfigIni.cs:371); CConfigIni.nBranchAnime (OpenTaiko/src/Common/CConfigIni.cs:443). Rename to `listBranch`. [rule N6]
D21 · Naming Consistency · `nInfiniteSIZE` spells `SIZE` where 36 names in the project spell it `Size` · ×1
  • `nInfiniteSIZE` spells `SIZE` where 36 names in the project spell it `Size` OpenTaiko/src/Songs/CTja.cs:4711 — 36 of 37 names in project OpenTaiko spell the token `Size` (36 of 37; unit: names in project OpenTaiko containing `Size`). Peers: CCharacter.GetDrawSize (OpenTaiko/src/Character/CCharacter.cs:345); CCharacterLua.GetDrawSize (OpenTaiko/src/Character/Lua/CCharacterLua.cs:61); CConfigIni.nBassBufferSizeMs (OpenTaiko/src/Common/CConfigIni.cs:558); CConfigIni.nWASAPIBufferSizeMs (OpenTaiko/src/Common/CConfigIni.cs:560); FFVideoWriter.InitFilterGraph(frameSize) (OpenTaiko/src/Common/VideoExporter.cs:881). Rename to `nInfiniteSize`. [rule N6]
D21 · Naming Consistency · `pfTITLE` spells `TITLE` where 58 names in the project spell it `Title` · ×1
  • `pfTITLE` spells `TITLE` where 58 names in the project spell it `Title` OpenTaiko/src/Stages/06.SongLoading/CStageSongLoading.cs:663 — 58 of 59 names in project OpenTaiko spell the token `Title` (58 of 59; unit: names in project OpenTaiko containing `Title`). Peers: EReturnValue.BackToTitle (OpenTaiko/src/Common/CConstants.cs:325); ESystemSound.SOUNDTitleSound (OpenTaiko/src/Common/CSkin.cs:20); CSkin.voiceTitleSanka (OpenTaiko/src/Common/CSkin.cs:367); CSkin.bgmTitle (OpenTaiko/src/Common/CSkin.cs:408); CSkin.bgmTitleIn (OpenTaiko/src/Common/CSkin.cs:409). Rename to `pfTitle`. [rule N6]
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion OpenTaiko/OpenTaiko.csproj:1 — `OpenTaiko` overshoots its size bounds (92084 LoC, 352 public types across 5 namespaces). 1 of 6 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Size alone is no reason to split a project: where its type references show a separable part, a Split row names it.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P12 · CI test-gate honesty · Sleep-based test synchronization · ×1
  • Sleep-based test synchronization — 14 Task.Delay/Thread.Sleep call(s) in test code synchronize with background work by sleeping — a known flakiness precursor on slow runners. Prefer polling with a deadline or completion signals.
P3 · Security & performance tooling · No SAST · ×1
  • 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) as a CI step. What was searched, so you can tell an absence from a miss: the 1 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.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation FDK/FDK.csproj:9 — `FDK/FDK.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`.
P4 · Deployment & Rollback · No release approval gate · ×1
  • No release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
X2 · Cancellation propagation · Not all async methods take a CancellationToken · ×1
  • Not all async methods take a CancellationToken — Only 0/1 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.
X5 · Nullable reference types · Null-forgiving operator (`!`) suppressions override nullable warnings · ×1
  • Null-forgiving operator (`!`) suppressions override nullable warnings — ~2.1 `!` suppressions per 1k syntax nodes — 1678 suppression(s) across the 817765 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.
Minor — 2 finding(s)
D24 · Comment Value · doc comments repeat the names · ×2
  • doc comments repeat the names FDK/src/00.Common/CConversion.cs:180 — 0 of 19 documented parameters and 0 of 103 summaries in `FDK` only repeat the member or parameter name (e.g. "" for `num`). 15 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names OpenTaiko/src/Animations/EaseIn.cs:10 — 4 of 43 documented parameters and 2 of 956 summaries in `OpenTaiko` only repeat the member or parameter name (e.g. "Starting point" for `startPoint`). 19 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-d0f3158ff0f44e59aeb8ea66bef4215a/tree.json --exit-code 0 --source .0—
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .28artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnuget—nuget: not applicable — nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan0—
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 9 file(s) — `OpenTaiko/src/Common/CNotesSkins.cs`, `REDACTED`, `OpenTaiko/src/Lua/3D/GpuRasterizer.Shaders.cs`, `OpenTaiko/src/Lua/LuaSecurity.cs`, `OpenTaiko/src/Songs/CDTXStyleExtractor.cs`, … (+4 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D37 · Vulnerability-disclosure Policydisclosure—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.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-23677cc9b27d495fada79f6aabfd74cc0artifacts/raw/osv-scanner.json

Run 01a1e9a1-4279-784d-b528-63f1bbc7ae29 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Appendix C — Personal-data map

Every field, property and record parameter whose name is conventional personal data — 2 field(s) across 1 category, each with an exact repo-relative file:line. This is the data inventory a compliance review starts from — right-to-erasure, retention, minimisation. Detected by NAME, from the C# syntax tree, with a deliberately specific identifier classifier — the same one the C1–C5 compliance cards use to decide whether personal data is present, so CardDefinition or FileName don't trip. Two caveats stated rather than glossed: those cards additionally require corroboration (a persistence/account signal, or two distinct PII categories) that this inventory deliberately does not, so it lists more than they gate on; and D32 Data Compliance shares nothing with it — that dimension is a separate semgrep ruleset for personal data leaking into logs, URLs and browser storage, and a clean D32 result says nothing about this list. Informational — it feeds no score.

Name — 2 field(s)
  • CConfigIni.strSystemSkinSubfolderFullName OpenTaiko/src/Common/CConfigIni.cs:496
  • CSongManager.listStrBoxDefSkinSubfolderFullName OpenTaiko/src/Songs/CSongManager.cs:976

Downloadable artifacts

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

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