Public report of nilaoda/N_m3u8DL-RE, published 23 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog 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, 23 October 2026, 08:53 UTC · Survey ID cd_c4e7baa75192495bbbe9442173888a63
nilaoda/N_m3u8DL-RE
Measured 23 October 2026, 08:48 UTC, at code version 05be706
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
Boundary Type-Coupling is not measured: Bounded contexts not declared.
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
Up 2 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 22,190 lines of product code in 4 projects, tests not counted · Estimated rebuild effort: about 1.6 person-years · Weakest lens: Security and Compliance, 20
Findings by how serious they are
59 critical330 serious76 minor
4 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks 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
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
23 October 2026, 08:48 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 Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works 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 ▸
70of 74 dimensions measured by tools. The other 4 are advisory notes from an AI model, which explain the code but don't count towards the score.
442of 465 findings point to an exact file and line, so you can open each one in the code. The other 23 concern the repository as a whole, such as missing documentation.
74dimensions across 6 lenses, read from 22,190 lines of product code in 4 projects.
nilaoda/N_m3u8DL-RE scores 39 out of 100 and is rated Weak, while five of its six lenses score higher still: Architecture at 77, Code Health at 63, Performance at 61, Maturity at 51 and Production Readiness at 50, all rated Adequate. The project hasn't declared a stable release yet, so its lenses are rated against a lower bar than a released product's, while the score itself is worked out as for any repository.
The score is lower than those five because the weakest lens counts most, and here that is Security and Compliance, which scores 20 and is rated Critical. Its Supply-chain Provenance & Signing dimension scores 0 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler and to stop accepting every TLS certificate: remove the always-true validation callback so the platform verifies the chain, hostname and expiry, and if Security and Compliance rose to 70, the score would rise from 39 to about 55.
59 findings are critical: 39 in Static Analysis (SAST), 14 in Explicit Debt, two in Change Coupling, two in Secrets (history), one in Project dependency cycles and one in Web-Security Posture.
Watchdog couldn't measure Code Coverage, Dependency Hygiene and IL Efficiency in this code, so those dimensions are left out of the score. The product code is 22,190 lines, which would take an estimated 1.6 person-years, around €230,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Security and Compliance rose from 20 to 70, the lowest score rated Strong, the score would rise from 39 to about 55.
Code composition: what the lines of code are
Business logic 39%Supporting code 22%Tests 39%
New since the last survey: 133 findings
These 133 critical or serious findings weren't in the previous survey, on 9 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 51 findings
These 51 critical or serious findings were in the previous survey, on 9 October 2026, and are gone from this one.
Cancellation propagation · Async method without CancellationToken: DownloadAsync src/N_m3u8DL-RE/Downloader/VodInitCache.cs
Cancellation propagation · Async method without CancellationToken: CopyFileAsync src/N_m3u8DL-RE/Util/DownloadUtil.cs
Cancellation propagation · Async method without CancellationToken: ProcessAsync src/N_m3u8DL-RE/Util/ImageHeaderUtil.cs
Cancellation propagation · Async method without CancellationToken: SplitUrlAsync src/N_m3u8DL-RE/Util/LargeSingleFileSplitUtil.cs
Cancellation propagation · Async method without CancellationToken: CanSplitAsync src/N_m3u8DL-RE/Util/LargeSingleFileSplitUtil.cs
Cancellation propagation · Async method without CancellationToken: GetFileSizeAsync src/N_m3u8DL-RE/Util/LargeSingleFileSplitUtil.cs
Cancellation propagation · Async method without CancellationToken: ReadInfoAsync src/N_m3u8DL-RE/Util/MediainfoUtil.cs
Cancellation propagation · Async method without CancellationToken: DecryptAsync REDACTED
Cancellation propagation · Async method without CancellationToken: RunCommandAsync REDACTED
Cancellation propagation · Async method without CancellationToken: SearchKeyFromFileAsync REDACTED
Cancellation propagation · Async method without CancellationToken: DeGzipFileAsync src/N_m3u8DL-RE/Util/OtherUtil.cs
Cancellation propagation · Async method without CancellationToken: StartPipeMuxAsync REDACTED
Cancellation propagation · Async method without CancellationToken: TryWriteImagePngsAsync REDACTED
Cancellation propagation · Async method without CancellationToken: InspectGroupsAsync src/N_m3u8DL-RE/Util/VodPartSelector.cs
Cancellation propagation · Async method without CancellationToken: ListAsync src/N_m3u8DL-RE/Util/VodPartSelector.cs
Cancellation propagation · Async method without CancellationToken: SelectAsync src/N_m3u8DL-RE/Util/VodPartSelector.cs
Cancellation propagation · Async method without CancellationToken: GetWebSourceAsync src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs
Cancellation propagation · Async method without CancellationToken: GetPostResponseAsync src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs
Cancellation propagation · Async method without CancellationToken: WebRequestRetryAsync src/N_m3u8DL-RE.Common/Util/RetryUtil.cs
Cancellation propagation · Async method without CancellationToken: LoadSourceFromUrlAsync src/N_m3u8DL-RE.Parser/StreamExtractor.cs
Cancellation propagation · Async method without CancellationToken: ExtractStreamsAsync src/N_m3u8DL-RE.Parser/StreamExtractor.cs
Cancellation propagation · Async method without CancellationToken: FetchPlayListAsync src/N_m3u8DL-RE.Parser/StreamExtractor.cs
Rebuild cost: about €230,000 · Estimate
Cost to rebuild
€74,000 to €380,000, for 1,228 to 4,041 hours of work, about 1.6 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, 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 39. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 22,190 lines of product code, of which 28% is declarations and boilerplate, 8% straight logic and 64% logic with branches
Comment lines
The estimate prices 20,257 lines. Comment lines count towards the size of 22,190 lines but aren't priced as work.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler.
Raises the score by about 14 points · Medium effort · Access Controls
2
Stop accepting every TLS certificate: remove the always-true validation callback so the platform verifies the chain, hostname and expiry.
If one self-signed certificate must be trusted, pin it by public key or thumbprint on the single handler that needs it and reject all others — never process-wide.
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 €230,000 to build again, about 1.6 person-years of work. Its weakest lens is Security and Compliance, at 20 (Critical). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler. Of all the actions in this report, it raises the score most for the work it takes: about 14 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.8 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 5% to 12% on every change. The history of the code shows how much it changes: about 29,441 lines over the last 90 days, which is about 119,400 lines a year. At that pace, the extra work comes to an estimated 16.4 to 98.2 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's 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; 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 — a layering smell or cycle. A clean layered graph has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
29 modules, with 57 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.
N_m3u8DL_RE.Common.Entity uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Common.Entity, while a change to N_m3u8DL_RE.Common.Entity can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Common.Entity uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Entity uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Entity, while a change to N_m3u8DL_RE.Entity can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Entity uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Entity uses N_m3u8DL_RE.Enum, so a change to N_m3u8DL_RE.Enum can break N_m3u8DL_RE.Entity, while a change to N_m3u8DL_RE.Entity can't break N_m3u8DL_RE.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Entity uses a module listed above it, which is the healthy direction.
Mp4SubtitleParser uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break Mp4SubtitleParser, while a change to Mp4SubtitleParser can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: Mp4SubtitleParser uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Column uses N_m3u8DL_RE.Entity, so a change to N_m3u8DL_RE.Entity can break N_m3u8DL_RE.Column, while a change to N_m3u8DL_RE.Column can't break N_m3u8DL_RE.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Column uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.CommandLine uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.CommandLine, while a change to N_m3u8DL_RE.CommandLine can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.CommandLine uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.CommandLine uses N_m3u8DL_RE.Common.Log, so a change to N_m3u8DL_RE.Common.Log can break N_m3u8DL_RE.CommandLine, while a change to N_m3u8DL_RE.CommandLine can't break N_m3u8DL_RE.Common.Log.
Position
Below the diagonal: N_m3u8DL_RE.CommandLine uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.CommandLine uses N_m3u8DL_RE.Enum, so a change to N_m3u8DL_RE.Enum can break N_m3u8DL_RE.CommandLine, while a change to N_m3u8DL_RE.CommandLine can't break N_m3u8DL_RE.Enum.
Position
Below the diagonal: N_m3u8DL_RE.CommandLine uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.CommandLine uses N_m3u8DL_RE.Entity, so a change to N_m3u8DL_RE.Entity can break N_m3u8DL_RE.CommandLine, while a change to N_m3u8DL_RE.CommandLine can't break N_m3u8DL_RE.Entity.
Position
Below the diagonal: N_m3u8DL_RE.CommandLine uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Common uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Common, while a change to N_m3u8DL_RE.Common can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Common uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Common uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Common, while a change to N_m3u8DL_RE.Common can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Common uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Mp4 uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Parser.Mp4, while a change to N_m3u8DL_RE.Parser.Mp4 can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Mp4 uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Parser.Processor, while a change to N_m3u8DL_RE.Parser.Processor can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Parser.Processor, while a change to N_m3u8DL_RE.Parser.Processor can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor uses a module listed above it, which is the healthy direction.
17→20 N_m3u8DL_RE.Parser.Processor uses N_m3u8DL_RE.Parser.Configpart of a loop✕
Connections
4 pairs of types, where a type in N_m3u8DL_RE.Parser.Processor uses a type in N_m3u8DL_RE.Parser.Config.
N_m3u8DL_RE.Parser.Processor uses N_m3u8DL_RE.Parser.Config, so a change to N_m3u8DL_RE.Parser.Config can break N_m3u8DL_RE.Parser.Processor, while a change to N_m3u8DL_RE.Parser.Processor can't break N_m3u8DL_RE.Parser.Config.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
N_m3u8DL_RE.Common.Util uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Common.Util, while a change to N_m3u8DL_RE.Common.Util can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Common.Util uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Common.Util uses N_m3u8DL_RE.Common, so a change to N_m3u8DL_RE.Common can break N_m3u8DL_RE.Common.Util, while a change to N_m3u8DL_RE.Common.Util can't break N_m3u8DL_RE.Common.
Position
Below the diagonal: N_m3u8DL_RE.Common.Util uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Config uses N_m3u8DL_RE.CommandLine, so a change to N_m3u8DL_RE.CommandLine can break N_m3u8DL_RE.Config, while a change to N_m3u8DL_RE.Config can't break N_m3u8DL_RE.CommandLine.
Position
Below the diagonal: N_m3u8DL_RE.Config uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Config uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Parser.Config, while a change to N_m3u8DL_RE.Parser.Config can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Config uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Config uses N_m3u8DL_RE.Parser.Processor, so a change to N_m3u8DL_RE.Parser.Processor can break N_m3u8DL_RE.Parser.Config, while a change to N_m3u8DL_RE.Parser.Config can't break N_m3u8DL_RE.Parser.Processor.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Config uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Util uses N_m3u8DL_RE.Enum, so a change to N_m3u8DL_RE.Enum can break N_m3u8DL_RE.Util, while a change to N_m3u8DL_RE.Util can't break N_m3u8DL_RE.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Util uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Util uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Util, while a change to N_m3u8DL_RE.Util can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Util uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Util uses N_m3u8DL_RE.Entity, so a change to N_m3u8DL_RE.Entity can break N_m3u8DL_RE.Util, while a change to N_m3u8DL_RE.Util can't break N_m3u8DL_RE.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Util uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Util uses Mp4SubtitleParser, so a change to Mp4SubtitleParser can break N_m3u8DL_RE.Util, while a change to N_m3u8DL_RE.Util can't break Mp4SubtitleParser.
Position
Below the diagonal: N_m3u8DL_RE.Util uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Util uses N_m3u8DL_RE.CommandLine, so a change to N_m3u8DL_RE.CommandLine can break N_m3u8DL_RE.Util, while a change to N_m3u8DL_RE.Util can't break N_m3u8DL_RE.CommandLine.
Position
Below the diagonal: N_m3u8DL_RE.Util uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Downloader uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Downloader, while a change to N_m3u8DL_RE.Downloader can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Downloader uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Downloader uses N_m3u8DL_RE.Entity, so a change to N_m3u8DL_RE.Entity can break N_m3u8DL_RE.Downloader, while a change to N_m3u8DL_RE.Downloader can't break N_m3u8DL_RE.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Downloader uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Downloader uses N_m3u8DL_RE.Config, so a change to N_m3u8DL_RE.Config can break N_m3u8DL_RE.Downloader, while a change to N_m3u8DL_RE.Downloader can't break N_m3u8DL_RE.Config.
Position
Below the diagonal: N_m3u8DL_RE.Downloader uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Extractor uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Parser.Extractor, while a change to N_m3u8DL_RE.Parser.Extractor can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Extractor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Extractor uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Parser.Extractor, while a change to N_m3u8DL_RE.Parser.Extractor can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Extractor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Extractor uses N_m3u8DL_RE.Parser.Config, so a change to N_m3u8DL_RE.Parser.Config can break N_m3u8DL_RE.Parser.Extractor, while a change to N_m3u8DL_RE.Parser.Extractor can't break N_m3u8DL_RE.Parser.Config.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Extractor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor.DASH uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Parser.Processor.DASH, while a change to N_m3u8DL_RE.Parser.Processor.DASH can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor.DASH uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor.DASH uses N_m3u8DL_RE.Parser.Processor, so a change to N_m3u8DL_RE.Parser.Processor can break N_m3u8DL_RE.Parser.Processor.DASH, while a change to N_m3u8DL_RE.Parser.Processor.DASH can't break N_m3u8DL_RE.Parser.Processor.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor.DASH uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor.DASH uses N_m3u8DL_RE.Parser.Config, so a change to N_m3u8DL_RE.Parser.Config can break N_m3u8DL_RE.Parser.Processor.DASH, while a change to N_m3u8DL_RE.Parser.Processor.DASH can't break N_m3u8DL_RE.Parser.Config.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor.DASH uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor.HLS uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Parser.Processor.HLS, while a change to N_m3u8DL_RE.Parser.Processor.HLS can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor.HLS uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor.HLS uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Parser.Processor.HLS, while a change to N_m3u8DL_RE.Parser.Processor.HLS can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor.HLS uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor.HLS uses N_m3u8DL_RE.Parser.Processor, so a change to N_m3u8DL_RE.Parser.Processor can break N_m3u8DL_RE.Parser.Processor.HLS, while a change to N_m3u8DL_RE.Parser.Processor.HLS can't break N_m3u8DL_RE.Parser.Processor.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor.HLS uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser.Processor.HLS uses N_m3u8DL_RE.Parser.Config, so a change to N_m3u8DL_RE.Parser.Config can break N_m3u8DL_RE.Parser.Processor.HLS, while a change to N_m3u8DL_RE.Parser.Processor.HLS can't break N_m3u8DL_RE.Parser.Config.
Position
Below the diagonal: N_m3u8DL_RE.Parser.Processor.HLS uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Processor uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Processor, while a change to N_m3u8DL_RE.Processor can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Processor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Processor uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Processor, while a change to N_m3u8DL_RE.Processor can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Processor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Processor uses N_m3u8DL_RE.Parser.Processor, so a change to N_m3u8DL_RE.Parser.Processor can break N_m3u8DL_RE.Processor, while a change to N_m3u8DL_RE.Processor can't break N_m3u8DL_RE.Parser.Processor.
Position
Below the diagonal: N_m3u8DL_RE.Processor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Processor uses N_m3u8DL_RE.Parser.Config, so a change to N_m3u8DL_RE.Parser.Config can break N_m3u8DL_RE.Processor, while a change to N_m3u8DL_RE.Processor can't break N_m3u8DL_RE.Parser.Config.
Position
Below the diagonal: N_m3u8DL_RE.Processor uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.Parser, while a change to N_m3u8DL_RE.Parser can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.Parser uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.Parser, while a change to N_m3u8DL_RE.Parser can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.Parser uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser uses N_m3u8DL_RE.Parser.Config, so a change to N_m3u8DL_RE.Parser.Config can break N_m3u8DL_RE.Parser, while a change to N_m3u8DL_RE.Parser can't break N_m3u8DL_RE.Parser.Config.
Position
Below the diagonal: N_m3u8DL_RE.Parser uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.Parser uses N_m3u8DL_RE.Parser.Extractor, so a change to N_m3u8DL_RE.Parser.Extractor can break N_m3u8DL_RE.Parser, while a change to N_m3u8DL_RE.Parser can't break N_m3u8DL_RE.Parser.Extractor.
Position
Below the diagonal: N_m3u8DL_RE.Parser uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE, while a change to N_m3u8DL_RE can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE uses N_m3u8DL_RE.CommandLine, so a change to N_m3u8DL_RE.CommandLine can break N_m3u8DL_RE, while a change to N_m3u8DL_RE can't break N_m3u8DL_RE.CommandLine.
Position
Below the diagonal: N_m3u8DL_RE uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE uses N_m3u8DL_RE.Parser, so a change to N_m3u8DL_RE.Parser can break N_m3u8DL_RE, while a change to N_m3u8DL_RE can't break N_m3u8DL_RE.Parser.
Position
Below the diagonal: N_m3u8DL_RE uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.Common.Enum, so a change to N_m3u8DL_RE.Common.Enum can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.Common.Enum.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.Common.Entity, so a change to N_m3u8DL_RE.Common.Entity can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.Common.Entity.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.Entity, so a change to N_m3u8DL_RE.Entity can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.Entity.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.CommandLine, so a change to N_m3u8DL_RE.CommandLine can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.CommandLine.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.Config, so a change to N_m3u8DL_RE.Config can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.Config.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.Util, so a change to N_m3u8DL_RE.Util can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.Util.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.Downloader, so a change to N_m3u8DL_RE.Downloader can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.Downloader.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
N_m3u8DL_RE.DownloadManager uses N_m3u8DL_RE.Parser, so a change to N_m3u8DL_RE.Parser can break N_m3u8DL_RE.DownloadManager, while a change to N_m3u8DL_RE.DownloadManager can't break N_m3u8DL_RE.Parser.
Position
Below the diagonal: N_m3u8DL_RE.DownloadManager uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 63% · Adequate · gated by D1, D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
45
High / Critical
A03:2025 — Software Supply Chain Failures
8
Medium
A07:2025 — Authentication Failures
3
High / Critical
Roadmap
First, enforce strict access controls by applying default-deny authorization policies or imperative guards to every handler. Second, harden the web security posture by removing the permissive TLS validation callback to ensure proper certificate chain verification, pinning only specific self-signed certificates where absolutely necessary. Third, address the ten static analysis findings related to process argument interpolation, prioritizing fixes in MP4DecryptUtil, PipeUtil, and MergeUtil. Fourth, resolve the six issues concerning untrusted context laundering across jobs, starting with REDACTED. Finally, document significant design decisions in a dedicated ADR folder to capture dates, contexts, decisions, and consequences for future reference.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler.
Stop accepting every TLS certificate: remove the always-true validation callback so the platform verifies the chain, hostname and expiry. If one self-signed certificate must be trusted, pin it by public key or thumbprint on the single handler that needs it and reject all others — never process-wide.
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 — 59
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 — 330
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 — 76
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 4
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
Watchdog 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. 70 of 74 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three 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; ◐ Advisory — an LLM prose judgement. 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; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 74 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 442 of 465 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog 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 analyzer environment could not build/run the test suite (a target framework / SDK band or targeting pack the analyzer image doesn't carry). This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero. We track the analyzer-image gap so it can be closed; in the meantime, no coverage collector was found in your CI either, so there is no existing report to hand us — add a collector to your test run and commit (or publish into the working tree) its Cobertura/OpenCover/lcov output, and real coverage will be read. You can widen what we reach: optional: add a coverage collector to your test run and commit (or publish into the working tree) its Cobertura/OpenCover/lcov output, and the real number is read on the next scan.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (26 contributor(s) across 616 commit(s) sampled, automation and bot accounts excluded). One of them holds 93% of the history; the other 25 hold 0.3% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D22 Internal API Consistency — not measured this run — 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 — Watchdog 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 (22,190 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"]`.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog 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. `src/N_m3u8DL-RE.Common/Entity/WebSourceResult.cs`, `src/N_m3u8DL-RE.Common/Log/CustomAnsiConsole.cs`, `src/N_m3u8DL-RE.Common/Log/Logger.cs`, `src/N_m3u8DL-RE.Common/Util/CookieFileHandler.cs`, `src/N_m3u8DL-RE.Common/Util/CookieFileJar.cs`, … (+15 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.
D39 IL Efficiency — not measured this run — Watchdog 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. IL NOT MEASURED: the analyzer's own build of this repository failed for an ENVIRONMENT reason (exit 1) — MSBuild's engine or the CLR gave up, or our image does not carry the SDK band/targeting pack this repository needs. This is OUR limitation, not a defect in the repo, and it is not a statement that this repository fails to build. D18 owns the question of whether this repository builds; it was not answered here.
P1 CI/CD gates — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it 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.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
X2 Cancellation propagation — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it 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. 28 further occurrence(s) are not listed individually; the score already reflects all 68.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does 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.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
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 — Watchdog runs 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 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment — a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D24 Comment Value: Comment value (WHY vs WHAT) is an LLM judgement over a bounded sample — it is advisory and cannot weigh a comment against the precise code change it was written to explain.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
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.
The LLM boundary
LLM-set scores this run (4): D19, D21, D24, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
56 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was SimpleDownloadManager.DownloadStreamAsync at 207. A further 2 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 ImageHeaderUtil.IsImageHeader at 22 — they are counted neither in the figure above nor in this dimension's score.
+ 51 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 2 bodies over 120 down to 120 or less in Cyclomatic Complexity — start with SimpleDownloadManager.DownloadStreamAsync (cyclomatic 207), SimpleLiveRecordManager2.RecordStreamAsync (cyclomatic 153). — 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.3/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 72 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 12 bodies over 60 down to 60 or less in Cognitive Complexity — start with SimpleLiveRecordManager2.RecordStreamAsync (cognitive 361), DASHExtractor2.ExtractStreamsAsync (cognitive 344), SimpleDownloadManager.DownloadStreamAsync (cognitive 298). — 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 12 together lifts Cognitive Complexity from 2.0 to about 3.7/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.3 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 12 MethodTooLong finding(s) in God Classes — start with SimpleDownloadManager.cs (2), SimpleLiveRecordManager2.cs (2), DASHExtractor2.cs. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 6 FileTooLong finding(s) in God Classes — start with StaticText.cs, SimpleLiveRecordManager2.cs, SimpleDownloadManager.cs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 ClassTooLong finding(s) in God Classes — start with StaticText.cs, SimpleDownloadManager.cs, SimpleLiveRecordManager2.cs. — One of this dimension's main actionable groups (5 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
39 duplicated block group(s) detected. One further row reports members as variants of one another; it aggregates block groups already counted above and is not itself counted.
+ 16 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with SimpleDownloadManager.cs (2), SimpleLiveRecordManager2.cs (2), LargeSingleFileSplitUtil.cs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with SimpleDownloadManager.cs, CSChaCha20.cs, REDACTED. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with SimpleDownloadManager.cs (3), HTTPUtil.cs. — One of this dimension's main actionable groups (4 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
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.
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.
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
432 test methods: 432 unit, 0 integration, 0 BDD, 0 e2e.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ 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.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 432 tests.
✓ On the Gold path — maintain.
Detailed fixes: d10_recommendation.md.
Do you agree with this assessment?
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.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 121 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 7 direct `PackageReference`(s), and 114 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 24 Hotspot finding(s) in Churn × Complexity Hotspots — start with SimpleLiveRecordManager2.cs, SimpleDownloadManager.cs, REDACTED. — One of this dimension's main actionable groups (24 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 10 EmptyCatchBlock finding(s) in Explicit Debt — start with REDACTED (2), DASHExtractor2.cs, CommandInvoker.cs. — One of this dimension's main actionable groups (10 issue-level).
Resolve the 4 WriteOnlyPrivateField finding(s) in Explicit Debt — start with HTTPLiveRecordManager.cs (3), MP4InitUtil.cs. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 5 CommentedOutCode finding(s) in Explicit Debt — start with SimpleLiveRecordManager2.cs (3), MSSMoovProcessor.cs, SimpleDownloadManager.cs. — One of this dimension's main actionable groups (5 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the solution is laid out in a sensible, conventional structure.
Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.
4 projects, 227 source files, 34945 hand-written lines of code (22190 production / 12755 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), 4 inter-project edges.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README is clear and complete for a tool project: it states what the software does (cross-platform DASH/HLS/MSS downloader), shows an English version link, gives star/last-commit/shield badges, explains how to find and fix bugs when the repo is up-to-date, lists Windows-only alternative cmder, Arch Linux AUR packages, and a PowerShell completion command. It also covers installation for both release and development builds (yay commands). The body is long but clipped inside a code block ('--input-dir 不能与 -i 混用') mid-architecture-outline; the outline sections exist and are not flagged as missing. The visible content is strong, so an 8 is earned.
Improve Documentation Quality — currently 8.0/10. — The repository's root README is clear and complete for a tool project: it states what the software does (cross-platform DASH/HLS/MSS downloader), shows an English version link, gives star/last-commit/shield badges, explains how to find and fix bugs when the repo is up-to-date, lists Windows-only alternative cmder, Arch Linux AUR packages, and a PowerShell completion command. It also covers installation for both release and development builds (yay commands). The body is long but clipped inside a code block ('--input-dir 不能与 -i 混用') mid-architecture-outline; the outline sections exist and are not flagged as missing. The visible content is strong, so an 8 is earned.
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
1 naming inconsistencies across 200 sampled symbols.
Two private fields in the same class are named similarly but with a numeric suffix on one, suggesting a copy-paste or refactoring artifact where the second name was not updated to reflect its distinct purpose or position.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D24 · Comment ValueExemplary◐ Sampled · advisory
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Judged by language model at low temperature (0.0-0.1) on deterministically sampled inline comments with surrounding code; findings verified back to sampled comments by substring match. Advisory, sampled.
0 of 4 projects flagged as possibly oversized/incoherent.
✓ On the Gold path — maintain.
Detailed fixes: d26_recommendation.md.
Do you agree with this assessment?
D27 · Navigability7.7 / 10Strong✓ 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.
87 % of calls cross a namespace and 1 % go through an interface, but 75 % of collaborators are co-located — so following a call takes several hops. Baseline: medium — clean/modular boundaries expected.
What to do
Improve Navigability — currently 7.7/10. — 87 % of calls cross a namespace and 1 % go through an interface, but 75 % of collaborators are co-located — so following a call takes several hops. Baseline: medium — clean/modular boundaries expected.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
2 finding(s): 0 critical, 2 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 2 REDACTED finding(s) in Secrets (history) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
45 finding(s): 0 critical, 39 high, 6 medium, 0 low. 21 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 29 file(s) — `src/N_m3u8DL-RE.Common/Entity/WebSourceResult.cs` (line 6), `src/N_m3u8DL-RE.Common/Log/CustomAnsiConsole.cs` (line 7), `src/N_m3u8DL-RE.Common/Log/Logger.cs` (line 95, line 97, line 99, …), `src/N_m3u8DL-RE.Common/Util/CookieFileHandler.cs` (line 5), `src/N_m3u8DL-RE.Common/Util/CookieFileJar.cs` (line 17), … (+24 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 22 of those file(s) — `src/N_m3u8DL-RE.Common/Entity/WebSourceResult.cs`, `src/N_m3u8DL-RE.Common/Log/CustomAnsiConsole.cs`, `src/N_m3u8DL-RE.Common/Log/Logger.cs`, `src/N_m3u8DL-RE.Common/Util/CookieFileHandler.cs`, `src/N_m3u8DL-RE.Common/Util/CookieFileJar.cs`, … (+17 more) — 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 2 of those file(s) — `src/N_m3u8DL-RE.Tests/DownloadManager/LiveSingleInitTests.cs`, `src/N_m3u8DL-RE/Util/VodPartSelector.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
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 10 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (4), REDACTED (2). — One of this dimension's main actionable groups (10 issue-level).
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (6). — One of this dimension's main actionable groups (6 issue-level).
No action in Static Analysis (SAST) — all 21 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 (21 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 63 of the 130 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 2 Boundary-crossing change coupling finding(s) in Change Coupling — start with ResString.cs, StaticText.cs. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Change coupling finding(s) in Change Coupling — start with HTTPLiveRecordManager.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.
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.
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 4 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Other · Architecture — 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.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
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 N_m3u8DL_RE.Parser.Config ↔ N_m3u8DL_RE.Parser.Processor depend on each other. The lightest dependency in the cycle is N_m3u8DL_RE.Parser.Config → N_m3u8DL_RE.Parser.Processor (N_m3u8DL_RE.Parser.Config.ParserConfig → N_m3u8DL_RE.Parser.Processor.ContentProcessor, 3 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. — src/N_m3u8DL-RE.Parser/Config/ParserConfig.cs:2
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.
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.
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.
~22.2k production LoC (341 types) across 3 project(s) / 30 namespace(s) with no recognised architectural style or layering — at this size, deliberate module boundaries would help. No DDD/clean/vertical-slice/CQRS/transaction-script organisation was detected — code is likely organised ad hoc, which makes change and onboarding harder as it grows.
What to do
Introduce deliberate module boundaries — by feature (vertical slices) if your team prefers, or by layer (domain/application/infrastructure). Even splitting into a few cohesive projects with a clear dependency direction would help.
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.
Do you agree with this assessment?
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.
Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.
Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.
No [Authorize]/policies and no imperative guard methods (throw-on-violation) were found — endpoints may be unprotected.
What to do
Protect endpoints by default-deny: [Authorize] + role/policy authorization, or imperative guard methods (throw-on-violation) called from every handler.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface. (×4) — src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:33, src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:38, src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:43, …
What to do
Finish or delete NotImplementedException stubs and replace placeholder literals before shipping.
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.
The first 2 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently. — src/N_m3u8DL-RE.Common/Log/CustomAnsiConsole.cs:82
`LiveTSExtractor` has 4 unfinished members out of 7 declared members (methods, properties, indexers and events, whether or not each carries a body) — a scaffolded type that was never implemented. — src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:8
`FetchPlayListAsync` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:33
`PreProcessContent` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:38
`PreProcessUrl` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:43
`RefreshPlayListAsync` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:48
A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers). (×24) — src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:575, src/N_m3u8DL-RE.Parser/Mp4/MP4InitUtil.cs:72, src/N_m3u8DL-RE.Parser/Mp4/MP4Parser.cs:114, …
16 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). — src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:637
6 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). (×2) — src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:736, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1143
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.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
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.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 4 of 4 project(s) that lack one — worth up to 2 pts.
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.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
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.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
README advertises Docker containerisation, but no Dockerfile/compose file exists — searched for: `dockerfile`, `docker-compose`, `compose.yaml`, `compose.yml`. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest and configuration files (package.json and other *.json, *.csproj, *.props, *.sln/*.slnx, *.yml, *.toml, *.config, tool configs such as eslint.config.js, Dockerfile); the README's own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read — a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong. — README.md:79
What to do
Reconcile the README with reality: README advertises Docker containerisation, but no Dockerfile/compose file exists.
Do you agree with this assessment?
P1 · CI/CD gates8.5 / 10Exemplary✓ 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 (`dotnet test` for the toolchain this pipeline already uses) and gate merges on it.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add CodeQL's csharp pack, or a .NET security analyzer package (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 14315 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.
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.
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.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
No benchmark suite was found by the two searches this check runs. FIRST, a BenchmarkDotNet package reference in any project file — every project the workspace loaded, plus a walk of project files on disk that never loaded, because a benchmark suite is exactly the project a partial load drops. SECOND, a script harness: a file whose name contains `benchmark` and ends `.py`, `.sh`, `.ps1`, `.bash`, `.rb`, `.js` or `.mjs`, credited ONLY when this repository's CI text also mentions benchmarks — a harness no pipeline runs is read as a fixture, deliberately. Neither search can see a benchmark suite in another ecosystem's idiom (a Go `testing.B` file, a JMH or criterion project, a pytest-benchmark run), so this is 'no benchmark found by those two searches', not a verdict that the repository has none. Where code is performance-sensitive, a benchmark guards against silent regressions — but it's a bonus here, not a deduction.
What to do
Add a benchmarking harness for the hot paths and run it in CI to catch regressions (for .NET, a BenchmarkDotNet project with [MemoryDiagnoser] to track allocations).
Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.
Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.
What to do
Raise allocation-aware density on the hot paths — currently 28 use(s) across 22,440 production line(s) (~1.2/1k). More Span/Memory, pooling (ArrayPool/ObjectPool), stackalloc and ValueTask on the allocation-heavy paths climbs this toward 10.
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 the language 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.
11 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).
`.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). (×11) — src/N_m3u8DL-RE/Util/ConcatInputServer.cs:240, src/N_m3u8DL-RE/Util/MediaProcessingProgress.cs:116, REDACTED:24, …
What to do
Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult().
Other · Security — Transport security, security headers, secure cookies, input validation, middleware order and crypto hygiene (presence, not runtime).
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
`RemoteCertificateValidationCallback` is assigned a callback that returns `true` unconditionally, so every TLS peer certificate is accepted — including one an attacker presents. Chain, expiry, revocation and hostname are all skipped, so an attacker on the network path can present any certificate and read or rewrite the traffic — the connection is encrypted to the attacker, not to the intended host. Delete the override and let the platform validate. If a specific self-signed or internally-issued certificate genuinely has to be trusted, pin THAT one — compare the presented certificate's public key or thumbprint against the expected value and return `false` for everything else — and scope it to the single handler that talks to that host rather than to the whole process. If the override exists only to get past a development certificate, gate it on a build configuration or an explicit opt-in setting so it cannot ship. — src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:19
None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is configured — defense in depth, even when a reverse proxy could set them. (−2.0 on this card.)
No UseHttpsRedirection/UseHsts and no reverse-proxy signal — transport security is unverified at the app layer. (−2.0 on this card.)
What to do
Stop accepting every TLS certificate: remove the always-true validation callback so the platform verifies the chain, hostname and expiry. If one self-signed certificate must be trusted, pin it by public key or thumbprint on the single handler that needs it and reject all others — never process-wide.
Add security response headers (Content-Security-Policy first, then Strict-Transport-Security, X-Content-Type-Options and a frame policy) — defense in depth, even when a reverse proxy could set them.
Enforce HTTPS at the app layer (UseHttpsRedirection / UseHsts) — only skip this if a reverse proxy demonstrably terminates TLS.
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.
`Thread.Sleep` parks the thread for the whole delay: no other work runs on it, and under load the pool must grow to make up for it. `await Task.Delay(…)` suspends only this method. — src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:952
`File.ReadAllBytes` blocks the thread on I/O while `File.ReadAllBytesAsync` exists to wait without one — inside a method that is already `async`, await the twin. (×6) — src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs:55, src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:332, src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:580, …
`File.ReadAllText` blocks the thread on I/O while `File.ReadAllTextAsync` exists to wait without one — inside a method that is already `async`, await the twin. — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:527
`PipeUtil.CreatePipe` is a synchronous helper that blocks (`Thread.Sleep`): called from an `async` method it parks the thread exactly as the inline call would. Make the helper `async` and `await` it (`await Task.Delay`, `SemaphoreSlim.WaitAsync`, a `TaskCompletionSource` instead of the poll). — src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:784
Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` wastes a thread and, if the task needs a context this one is holding, deadlocks. `Dispose()` returns void by contract, so it cannot simply `await`: signal the work to stop first (cancel its token, set its stop flag) so the wait is short, give the wait a TIMEOUT so a hung task cannot hang shutdown, and — where callers can use it — add an awaitable teardown (`DisposeAsync`/`StopAsync`) beside the synchronous one and let `Dispose()` remain the bounded fallback. (×2) — src/N_m3u8DL-RE/Util/ConcatInputServer.cs:240, src/N_m3u8DL-RE/Util/MediaProcessingProgress.cs:116
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. (×8) — REDACTED:24, REDACTED:64, REDACTED:173, …
`MemoryStream.Write` blocks the thread on I/O while `MemoryStream.WriteAsync` exists to wait without one — inside a method that is already `async`, await the twin. — src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:222
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
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.
`dcpt` is a `Aes`, which implements `IDisposable`, and it is created here (line 26). Every use of it in `AES128Decrypt` 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 dcpt = …;`), which releases it at the end of the scope on every path including a throw. — src/N_m3u8DL-RE/Crypto/AESUtil.cs:26
`forDecrypting` is a `ChaCha20`, which implements `IDisposable`, and it is created here (line 25). Every use of it in `DecryptPer1024Bytes` 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 forDecrypting = …;`), which releases it at the end of the scope on every path including a throw. — src/N_m3u8DL-RE/Crypto/ChaCha20Util.cs:25
`ChaCha20` declares a finalizer (line 522), 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. — src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:522
`reader` is a `BinaryReader2`, which implements `IDisposable`, and it is created here (line 116). Every use of it in `ExtractSub` 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. — src/N_m3u8DL-RE.Parser/Mp4/MP4VttUtil.cs:116
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
Other · Code Health — Whether 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.
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 45/112 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. (×27) — src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:889, src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:215, src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:307, …
No CancellationToken parameter — the body observes an ambient token instead (a field or a context object), so the work does stop on cancellation, but a caller cannot cancel this call independently of the owner that created that token. (×9) — src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:60, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:116, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:266, …
Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one. (×3) — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:925, src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:947, src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:969
What to do
Thread a CancellationToken through async methods so work stops promptly on cancellation.
Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `ArgumentNullException` tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.
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.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. 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 `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
`Debug` at line 570 is called with an argument built by `string.Join(" ", arguments.Select(argument => $"\"{argument}\""))` (line 570), whose cost grows with the collection it walks. C# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no conditional-compilation region. — REDACTED:570
What to do
Each finding names the diagnostic call and the expression inside its argument whose cost scales with a collection. Confirm from the two that the argument is built before the call — that is C#'s evaluation order, not a guess — then put the construction behind the same level check the sink applies: `if (logger.IsEnabled(LogLevel.Trace))` for Microsoft.Extensions.Logging, the repository's own debug flag where it has one, or a message template whose ARGUMENTS the logging framework only formats when the level is on. Moving the call is not the fix: it is the join/projection in the argument that is paid, wherever the call sits.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
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.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `foreach` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is enumerating invalidates the enumerator it is holding, so the next `MoveNext` throws `InvalidOperationException` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×10) — src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:957, src/N_m3u8DL-RE/DownloadManager/BinaryDownloadManager.cs:191, REDACTED:70, …
`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. — REDACTED:661
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X32 · Type resolved by simple name across every loaded assembly10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a plugin lookup names the type it means — searching every assembly loaded into the process for a candidate whose SIMPLE name equals a string supplied at runtime, and taking the first one found, is decided by assembly LOAD ORDER rather than by this source, so the same name can resolve to a different type on the next run.
Method: Roslyn syntax only, no semantic model: every invocation of `First`/`FirstOrDefault`/`Single`/`SingleOrDefault` whose OWN expression subtree contains both a `GetAssemblies()` call and a `GetTypes()`/`GetExportedTypes()` call — a single-element pick out of every type loaded into the process. A nested selector in the same chain sees no `GetAssemblies()` in its own subtree and is outside the population, so one lookup counts once however many links its chain has. A finding additionally needs both remaining halves: the selector must be `First`/`FirstOrDefault` (`Single`/`SingleOrDefault` reports the ambiguity rather than resolving it, and is counted and never reported), and the chain must carry an `==` comparison of `<lambda parameter>.Name` against something that is not a literal. The receiver must be a plain identifier bound by one of the chain’s own lambdas, which places `assembly.GetName().Name == "X"` outside the rule by construction. One exemption: a `.Name` test joined by `&&` to a `FullName`/`AssemblyQualifiedName` test on the same identifier is spared; joined by `||` it is not. Deterministic, provable per finding. Advisory.
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.
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.
~1.7 `!` suppressions per 1k syntax nodes — 247 suppression(s) across the 143103 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.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 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 — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — 19 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 41 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.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations 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 — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D12 Dependency Hygiene — Dependency hygiene not measured
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
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
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) — 20 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
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.
D39 IL Efficiency — IL not measured — the analyzer's build of the target did not succeed
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.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage not measured — analyzer environment
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (1 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
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
EmptyCatchBlock src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:114— 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 src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:957— 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 src/N_m3u8DL-RE/DownloadManager/BinaryDownloadManager.cs:191— 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:70— 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 src/N_m3u8DL-RE/Util/ConcatInputServer.cs:69— 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 src/N_m3u8DL-RE/Util/CultureUtil.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 REDACTED:551— 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 src/N_m3u8DL-RE/Util/ProcessUtil.cs:56— 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 src/N_m3u8DL-RE/Util/TSInfoUtil.cs:241— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
WriteOnlyPrivateField src/N_m3u8DL-RE.Parser/Mp4/MP4InitUtil.cs:16— private byte[] SYSTEM_ID_PLAYREADY — 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 src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:22— private IDownloader Downloader — 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 src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:26— private List<OutputFile> OutputFiles — 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 src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:28— private DateTime? PublishDateTime — 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.
Boundary-crossing change coupling: ResString.cs ↔ MyOption.cs src/N_m3u8DL-RE.Common/Resource/ResString.cs:1— `src/N_m3u8DL-RE.Common/Resource/ResString.cs` (context N_m3u8DL-RE.Common) and `src/N_m3u8DL-RE/CommandLine/MyOption.cs` (context N_m3u8DL-RE) sit in DIFFERENT parts of the tree yet change together 80% of the time (33 of the 41 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 33 shared commits counted here, the most recent 3 are `2f64dcbb` 使用本机虚拟输入解决 FFmpeg 合并分片时的句柄耗尽 (#983); `141321e8` 支持 Netscape Cookie 文件及响应 Cookie 更新 (#972); `4b0276d4` 支持通过 --interface 指定网络接口或本机 IP (#970) — run `git show` on any of them.
Boundary-crossing change coupling: StaticText.cs ↔ MyOption.cs src/N_m3u8DL-RE.Common/Resource/StaticText.cs:1— `src/N_m3u8DL-RE.Common/Resource/StaticText.cs` (context N_m3u8DL-RE.Common) and `src/N_m3u8DL-RE/CommandLine/MyOption.cs` (context N_m3u8DL-RE) sit in DIFFERENT parts of the tree yet change together 80% of the time (33 of the 41 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 33 shared commits counted here, the most recent 3 are `2f64dcbb` 使用本机虚拟输入解决 FFmpeg 合并分片时的句柄耗尽 (#983); `141321e8` 支持 Netscape Cookie 文件及响应 Cookie 更新 (#972); `4b0276d4` 支持通过 --interface 指定网络接口或本机 IP (#970) — run `git show` on any of them.
Namespace dependency cycle src/N_m3u8DL-RE.Parser/Config/ParserConfig.cs:2— The namespaces N_m3u8DL_RE.Parser.Config ↔ N_m3u8DL_RE.Parser.Processor depend on each other. The lightest dependency in the cycle is N_m3u8DL_RE.Parser.Config → N_m3u8DL_RE.Parser.Processor (N_m3u8DL_RE.Parser.Config.ParserConfig → N_m3u8DL_RE.Parser.Processor.ContentProcessor, 3 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.
TLS certificate validation disabled src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:19— `RemoteCertificateValidationCallback` is assigned a callback that returns `true` unconditionally, so every TLS peer certificate is accepted — including one an attacker presents. Chain, expiry, revocation and hostname are all skipped, so an attacker on the network path can present any certificate and read or rewrite the traffic — the connection is encrypted to the attacker, not to the intended host. Delete the override and let the platform validate. If a specific self-signed or internally-issued certificate genuinely has to be trusted, pin THAT one — compare the presented certificate's public key or thumbprint against the expected value and return `false` for everything else — and scope it to the single handler that talks to that host rather than to the whole process. If the override exists only to get past a development certificate, gate it on a build configuration or an explicit opt-in setting so it cannot ship.
Serious — 330 finding(s)
X2 · Cancellation propagation· Async method without CancellationToken · ×27
Async method without CancellationToken: InvokeArgs src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:889— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: EncryptStreamAsync src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:215— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DecryptStreamAsync src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:307— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: WorkStreamsAsync src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:383— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RunAsync src/N_m3u8DL-RE/DownloadManager/BinaryDownloadRunner.cs:20— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DownloadWithLogAsync src/N_m3u8DL-RE/DownloadManager/BinaryDownloadRunner.cs:92— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DownloadWithProgressAsync src/N_m3u8DL-RE/DownloadManager/BinaryDownloadRunner.cs:125— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ReadInfoAsync src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:166— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: TimeCounterAsync src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:207— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: TryRecordStreamAsync src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:241— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: StartRecordAsync src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:259— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: SearchKeyAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:60— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ChangeSpecInfoAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:72— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DownloadStreamAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:107— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: StartDownloadAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:862— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DownloadPartsAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:17— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: MergeSubtitlesAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:179— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: SearchKeyAsync src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:170— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ChangeSpecInfoAsync src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:226— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: PlayListProduceAsync src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:915— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: StartRecordCoreAsync src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1107— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: DoWorkAsync REDACTED:81— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: WriteRawFilesAsync REDACTED:624— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: CheckUpdateAsync REDACTED:647— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: Get302Async REDACTED:668— No CancellationToken parameter — this work can't be stopped early once started.
Hotspot: src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:266— src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 153 in SimpleLiveRecordManager2.RecordStreamAsync at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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: src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:107— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 207 in SimpleDownloadManager.DownloadStreamAsync at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:81— REDACTED changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in Program.DoWorkAsync at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:63— src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in DASHExtractor2.ExtractStreamsAsync at line 63. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:371— REDACTED changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in MergeUtil.MuxInputsAsync at line 371. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/N_m3u8DL-RE/Util/FileToolUtil.cs src/N_m3u8DL-RE/Util/FileToolUtil.cs:16— src/N_m3u8DL-RE/Util/FileToolUtil.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in FileToolUtil.ExecuteAsync at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Util/FileToolUtil.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: src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:223— src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in HLSExtractor.ParseListAsync at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.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: src/N_m3u8DL-RE/Util/FilterUtil.cs src/N_m3u8DL-RE/Util/FilterUtil.cs:13— src/N_m3u8DL-RE/Util/FilterUtil.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in FilterUtil.DoFilterKeep at line 13. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Util/FilterUtil.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: src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:889— src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CommandInvoker.InvokeArgs at line 889. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:13— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in MP4DecryptUtil.DecryptAsync at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:17— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in SimpleDownloadManager.DownloadPartsAsync at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.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: src/N_m3u8DL-RE/Util/OtherUtil.cs src/N_m3u8DL-RE/Util/OtherUtil.cs:285— src/N_m3u8DL-RE/Util/OtherUtil.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in OtherUtil.FindAvailableOutputPath at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Util/OtherUtil.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: src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:60— src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in HTTPLiveRecordManager.RecordStreamAsync at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.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: src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs:83— src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SimpleDownloader.DownClipAsync at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Downloader/SimpleDownloader.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: src/N_m3u8DL-RE/Util/RecordingTrack.cs src/N_m3u8DL-RE/Util/RecordingTrack.cs:56— src/N_m3u8DL-RE/Util/RecordingTrack.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in RecordingTrack.Read at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Util/RecordingTrack.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: src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:175— src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in HTTPUtil.GetWebSourceResultAsync at line 175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE.Common/Util/HTTPUtil.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: src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs:27— src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DefaultHLSKeyProcessor.Process at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.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: src/N_m3u8DL-RE/CommandLine/ToolCommands.cs src/N_m3u8DL-RE/CommandLine/ToolCommands.cs:107— src/N_m3u8DL-RE/CommandLine/ToolCommands.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ToolCommands.CreateFileCommand at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/CommandLine/ToolCommands.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: src/N_m3u8DL-RE/Util/VodStreamPlanner.cs src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:12— src/N_m3u8DL-RE/Util/VodStreamPlanner.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in VodStreamPlanner.Build at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Util/VodStreamPlanner.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: src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs:28— src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MP4MediaInfoUtil.ReadTiming at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.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: src/N_m3u8DL-RE/DownloadManager/LiveSegmentTracker.cs src/N_m3u8DL-RE/DownloadManager/LiveSegmentTracker.cs:20— src/N_m3u8DL-RE/DownloadManager/LiveSegmentTracker.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LiveSegmentTracker.FindMatchingIndex at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/DownloadManager/LiveSegmentTracker.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: src/N_m3u8DL-RE/CommandLine/ConfigFile.cs src/N_m3u8DL-RE/CommandLine/ConfigFile.cs:140— src/N_m3u8DL-RE/CommandLine/ConfigFile.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ConfigFile.Merge at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/CommandLine/ConfigFile.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: src/N_m3u8DL-RE/Util/DownloadUtil.cs src/N_m3u8DL-RE/Util/DownloadUtil.cs:71— src/N_m3u8DL-RE/Util/DownloadUtil.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DownloadUtil.DownloadToFileCoreAsync at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Util/DownloadUtil.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: src/N_m3u8DL-RE/Util/MuxSubtitleTimeline.cs src/N_m3u8DL-RE/Util/MuxSubtitleTimeline.cs:38— src/N_m3u8DL-RE/Util/MuxSubtitleTimeline.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in MuxSubtitleTimeline.CreateAsync at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 01:51:23 +08:00' --until='2026-10-23 01:51:23 +08:00' --full-history --no-merges -- src/N_m3u8DL-RE/Util/MuxSubtitleTimeline.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.
MethodTooLong: SimpleDownloadManager.DownloadStreamAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:107— MethodTooLong — DownloadStreamAsync runs 437 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 337 over it, 4.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: DASHExtractor2.ExtractStreamsAsync src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:63— MethodTooLong — ExtractStreamsAsync runs 352 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 252 over it, 3.52× 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: SimpleLiveRecordManager2.RecordStreamAsync src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:266— MethodTooLong — RecordStreamAsync runs 351 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 251 over it, 3.51× 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: Program.DoWorkAsync REDACTED:81— MethodTooLong — DoWorkAsync runs 275 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 175 over it, 2.75× 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: HLSExtractor.ParseListAsync src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:223— MethodTooLong — ParseListAsync runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.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: SimpleLiveRecordManager2.StartRecordCoreAsync src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1107— MethodTooLong — StartRecordCoreAsync runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× 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: FileToolUtil.ExecuteAsync src/N_m3u8DL-RE/Util/FileToolUtil.cs:16— MethodTooLong — ExecuteAsync runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MSSExtractor.ExtractStreamsAsync src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:45— MethodTooLong — ExtractStreamsAsync runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SimpleDownloadManager.StartDownloadAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:862— MethodTooLong — StartDownloadAsync runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× 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: SimpleDownloadManager.DownloadPartsAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:17— MethodTooLong — DownloadPartsAsync runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MP4TtmlUtil.ExtractSub REDACTED:193— MethodTooLong — ExtractSub runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MergeUtil.MuxInputsAsync REDACTED:371— MethodTooLong — MuxInputsAsync runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Sync-over-async blocking — 11 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 src/N_m3u8DL-RE/Util/ConcatInputServer.cs:240— `.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 src/N_m3u8DL-RE/Util/MediaProcessingProgress.cs:116— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:24— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:65— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:174— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:275— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:361— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:368— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:325— `.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 src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs:90— `.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 src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs:102— `.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 (deadlock risk) src/N_m3u8DL-RE/Util/ConcatInputServer.cs:240— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` wastes a thread and, if the task needs a context this one is holding, deadlocks. `Dispose()` returns void by contract, so it cannot simply `await`: signal the work to stop first (cancel its token, set its stop flag) so the wait is short, give the wait a TIMEOUT so a hung task cannot hang shutdown, and — where callers can use it — add an awaitable teardown (`DisposeAsync`/`StopAsync`) beside the synchronous one and let `Dispose()` remain the bounded fallback.
Sync-over-async (deadlock risk) src/N_m3u8DL-RE/Util/MediaProcessingProgress.cs:116— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` wastes a thread and, if the task needs a context this one is holding, deadlocks. `Dispose()` returns void by contract, so it cannot simply `await`: signal the work to stop first (cancel its token, set its stop flag) so the wait is short, give the wait a TIMEOUT so a hung task cannot hang shutdown, and — where callers can use it — add an awaitable teardown (`DisposeAsync`/`StopAsync`) beside the synchronous one and let `Dispose()` remain the bounded fallback.
Sync-over-async (deadlock risk) REDACTED:24— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) REDACTED:64— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) REDACTED:173— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) REDACTED:274— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) REDACTED:360— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) REDACTED:367— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) REDACTED:325— 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) src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs:90— 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.
Swallowed exception (empty catch) src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:957— 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) src/N_m3u8DL-RE/DownloadManager/BinaryDownloadManager.cs:191— 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:70— 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:88— 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) src/N_m3u8DL-RE/Util/ConcatInputServer.cs:69— 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) src/N_m3u8DL-RE/Util/CultureUtil.cs:31— 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:551— 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) src/N_m3u8DL-RE/Util/ProcessUtil.cs:56— 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) src/N_m3u8DL-RE/Util/TSInfoUtil.cs:241— 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) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:114— 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.
FileTooLong: Resource/StaticText.cs src/N_m3u8DL-RE.Common/Resource/StaticText.cs— FileTooLong — 1487 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 987 over it, 2.97× 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: DownloadManager/SimpleLiveRecordManager2.cs src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs— FileTooLong — 786 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 286 over it, 1.57× 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: DownloadManager/SimpleDownloadManager.cs src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs— FileTooLong — 632 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 132 over it, 1.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: CommandLine/CommandInvoker.cs src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs— FileTooLong — 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 over it, 1.20× 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: Mp4/MSSMoovProcessor.cs src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs— FileTooLong — 541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 41 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: Extractor/DASHExtractor2.cs src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs— FileTooLong — 527 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 27 over it, 1.05× 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.
Duplicated block (6 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:729— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:729-734 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:771-776 — 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) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:404— src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:404-409 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:468-473 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:404` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/N_m3u8DL-RE/Util/LargeSingleFileSplitUtil.cs:54— src/N_m3u8DL-RE/Util/LargeSingleFileSplitUtil.cs:54-59 | src/N_m3u8DL-RE/Util/LargeSingleFileSplitUtil.cs:74-79 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:339— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:339-344 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:471-476 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:469` calls `Add`, `TrackFile` and `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:338` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:430— src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:430-435 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:970-975 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:383— src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:383-388 | src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:423-428 — 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.
Blocking `File.ReadAllBytes` inside an `async` method src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs:55— `File.ReadAllBytes` blocks the thread on I/O while `File.ReadAllBytesAsync` exists to wait without one — inside a method that is already `async`, await the twin.
Blocking `File.ReadAllBytes` inside an `async` method src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:332— `File.ReadAllBytes` blocks the thread on I/O while `File.ReadAllBytesAsync` exists to wait without one — inside a method that is already `async`, await the twin.
Blocking `File.ReadAllBytes` inside an `async` method src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:580— `File.ReadAllBytes` blocks the thread on I/O while `File.ReadAllBytesAsync` exists to wait without one — inside a method that is already `async`, await the twin.
Blocking `File.ReadAllBytes` inside an `async` method src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:591— `File.ReadAllBytes` blocks the thread on I/O while `File.ReadAllBytesAsync` exists to wait without one — inside a method that is already `async`, await the twin.
Blocking `File.ReadAllBytes` inside an `async` method src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:462— `File.ReadAllBytes` blocks the thread on I/O while `File.ReadAllBytesAsync` exists to wait without one — inside a method that is already `async`, await the twin.
Blocking `File.ReadAllBytes` inside an `async` method src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:632— `File.ReadAllBytes` blocks the thread on I/O while `File.ReadAllBytesAsync` exists to wait without one — inside a method that is already `async`, await the twin.
ClassTooLong: StaticText src/N_m3u8DL-RE.Common/Resource/StaticText.cs— ClassTooLong — 1486 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 1086 over it, 3.72× 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: SimpleDownloadManager src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs— ClassTooLong — 768 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods, declared across 2 files: DownloadManager/SimpleDownloadManager.cs (7), DownloadManager/SimpleDownloadManager.Parts.cs (4). The bar is 400 significant lines; this is 368 over it, 1.92× 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: SimpleLiveRecordManager2 src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs— ClassTooLong — 762 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 362 over it, 1.91× 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: MSSMoovProcessor src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs— ClassTooLong — 535 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 135 over it, 1.34× 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: DASHExtractor2 src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs— ClassTooLong — 515 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 115 over it, 1.29× 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.
Duplicated block (5 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:410— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:410-414 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:559-563 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:410` 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) src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:504— src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:504-508 | src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:510-514 — 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) REDACTED:324— REDACTED:324-328 | REDACTED:343-347 — 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) src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:519— src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:519-523 | src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:537-541 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:519` 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) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:445— src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:445-449 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:551-555 — 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 (9 lines × 2) src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:89— src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:89-97 | src/N_m3u8DL-RE/Util/DownloadUtil.cs:123-131 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:89` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:575— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:575-583 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:627-635 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:575` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1008— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1008-1016 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1271-1279 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1008` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1281` calls `Select`, `ToArray` and `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1017` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:62— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:62-70 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:172-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. 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.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:33— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:38— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:43— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:48— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:33— `FetchPlayListAsync` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:38— `PreProcessContent` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:43— `PreProcessUrl` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:48— `RefreshPlayListAsync` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Duplicated block (12 lines × 2) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:828— src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:828-839 | src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:321-332 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:828` 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 (12 lines × 2) src/N_m3u8DL-RE/Util/ImageHeaderUtil.cs:40— src/N_m3u8DL-RE/Util/ImageHeaderUtil.cs:40-51 | src/N_m3u8DL-RE/Util/ImageHeaderUtil.cs:66-77 — 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. 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) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:279— src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:279-290 | src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:306-317 — 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. 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 (11 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1058— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1058-1068 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1327-1337 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1058` 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 (11 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:515— src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:515-525 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:562-572 — 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. 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 (11 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:664— src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:664-674 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:708-718 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:664` 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.
X18 · Disposal-pattern correctness· Disposable created and abandoned in the method that made it · ×3
Disposable created and abandoned in the method that made it src/N_m3u8DL-RE/Crypto/AESUtil.cs:26— `dcpt` is a `Aes`, which implements `IDisposable`, and it is created here (line 26). Every use of it in `AES128Decrypt` 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 dcpt = …;`), 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 src/N_m3u8DL-RE/Crypto/ChaCha20Util.cs:25— `forDecrypting` is a `ChaCha20`, which implements `IDisposable`, and it is created here (line 25). Every use of it in `DecryptPer1024Bytes` 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 forDecrypting = …;`), 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 src/N_m3u8DL-RE.Parser/Mp4/MP4VttUtil.cs:116— `reader` is a `BinaryReader2`, which implements `IDisposable`, and it is created here (line 116). Every use of it in `ExtractSub` 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.
X2 · Cancellation propagation· Async local function without CancellationToken · ×3
Async local function without CancellationToken: DownloadTrackAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:925— Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one.
Async local function without CancellationToken: DownloadBatchAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:947— Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one.
Async local function without CancellationToken: DownloadMediaAsync src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:969— Neither takes a CancellationToken nor reads the one of the function it sits in, while it calls something that takes one — this work can't be stopped early once started. Take the token, or pass on the enclosing one.
Dead code: GetWebSourceAsync src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:152— Method GetWebSourceAsync — Roslyn's SymbolFinder walked every project the solution loads, including N_m3u8DL-RE.Common, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: GenMoof src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:766— Method GenMoof — Roslyn's SymbolFinder walked every project the solution loads, including N_m3u8DL-RE.Parser, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Duplicated block (19 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1034— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1034-1052 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1304-1322 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1034` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1302` calls `CreateAsync`, `Select`, `ToArray` and `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1033` 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 (19 lines × 2) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:732— src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:732-750 | src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:360-378 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:732` 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 (10 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:371— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:371-380 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:413-422 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1024— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1024-1033 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1290-1299 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1024` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (7 lines × 2) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:627— src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:627-633 | src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:244-250 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:627` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:279— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:279-285 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:398-404 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:279` 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.
Appears unstructured (no recognised architecture) — ~22.2k production LoC (341 types) across 3 project(s) / 30 namespace(s) with no recognised architectural style or layering — at this size, deliberate module boundaries would help. No DDD/clean/vertical-slice/CQRS/transaction-script organisation was detected — code is likely organised ad hoc, which makes change and onboarding harder as it grows.
SimpleDownloadManager.DownloadStreamAsync (cyclomatic 207) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:107— SimpleDownloadManager.DownloadStreamAsync has cyclomatic complexity 207 (threshold 15). Of this number, 200 points are the body's own statements and 7 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.
SimpleLiveRecordManager2.RecordStreamAsync (cyclomatic 153) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:266— SimpleLiveRecordManager2.RecordStreamAsync has cyclomatic complexity 153 (threshold 15). Of this number, 144 points are the body's own statements and 9 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.
DASHExtractor2.ExtractStreamsAsync (cyclomatic 114) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:63— DASHExtractor2.ExtractStreamsAsync has cyclomatic complexity 114 (threshold 15). Of this number, 102 points are the body's own statements and 12 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.
Program.DoWorkAsync (cyclomatic 111) REDACTED:81— Program.DoWorkAsync has cyclomatic complexity 111 (threshold 15). Of this number, 110 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.
FileToolUtil.ExecuteAsync (cyclomatic 71) src/N_m3u8DL-RE/Util/FileToolUtil.cs:16— FileToolUtil.ExecuteAsync has cyclomatic complexity 71 (threshold 15). Of this number, 41 points are the body's own statements and 30 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.
HLSExtractor.ParseListAsync (cyclomatic 71) src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:223— HLSExtractor.ParseListAsync has cyclomatic complexity 71 (threshold 15). Of this number, 68 points are the body's own statements and 3 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.
MergeUtil.MuxInputsAsync (cyclomatic 61) REDACTED:371— MergeUtil.MuxInputsAsync has cyclomatic complexity 61 (threshold 15). Of this number, 60 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.
ImageHeaderUtil.ProcessAsync (cyclomatic 54) src/N_m3u8DL-RE/Util/ImageHeaderUtil.cs:23— ImageHeaderUtil.ProcessAsync has cyclomatic complexity 54 (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.
SimpleDownloadManager.StartDownloadAsync (cyclomatic 48) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:862— SimpleDownloadManager.StartDownloadAsync has cyclomatic complexity 48 (threshold 15). Of this number, 21 points are the body's own statements and 27 belong to 8 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.
RecordingTrack.Read (cyclomatic 44) src/N_m3u8DL-RE/Util/RecordingTrack.cs:56— RecordingTrack.Read has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SimpleLiveRecordManager2.PlayListProduceCoreAsync (cyclomatic 42) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:935— SimpleLiveRecordManager2.PlayListProduceCoreAsync has cyclomatic complexity 42 (threshold 15). Of this number, 20 points are the body's own statements and 22 belong to 5 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.
MP4TtmlUtil.ExtractSub (cyclomatic 40) REDACTED:193— MP4TtmlUtil.ExtractSub has cyclomatic complexity 40 (threshold 15). Of this number, 38 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.
TSInfoUtil.ReadServices (cyclomatic 39) src/N_m3u8DL-RE/Util/TSInfoUtil.cs:12— TSInfoUtil.ReadServices 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.
SimpleLiveRecordManager2.StartRecordCoreAsync (cyclomatic 38) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1107— SimpleLiveRecordManager2.StartRecordCoreAsync has cyclomatic complexity 38 (threshold 15). Of this number, 20 points are the body's own statements and 18 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.
MP4DecryptUtil.DecryptAsync (cyclomatic 38) REDACTED:13— MP4DecryptUtil.DecryptAsync has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FilterUtil.DoFilterKeep (cyclomatic 37) src/N_m3u8DL-RE/Util/FilterUtil.cs:13— FilterUtil.DoFilterKeep has cyclomatic complexity 37 (threshold 15). Of this number, 27 points are the body's own statements and 10 belong to 10 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SimpleDownloadManager.DownloadPartsAsync (cyclomatic 35) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:17— SimpleDownloadManager.DownloadPartsAsync has cyclomatic complexity 35 (threshold 15). Of this number, 33 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.
VodStreamPlanner.Build (cyclomatic 35) src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:12— VodStreamPlanner.Build has cyclomatic complexity 35 (threshold 15). Of this number, 28 points are the body's own statements and 7 belong to 5 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.
DASHExtractor2.RefreshPlayListAsync (cyclomatic 30) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:730— DASHExtractor2.RefreshPlayListAsync has cyclomatic complexity 30 (threshold 15). Of this number, 19 points are the body's own statements and 11 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.
MP4VttUtil.ExtractSub (cyclomatic 29) src/N_m3u8DL-RE.Parser/Mp4/MP4VttUtil.cs:55— MP4VttUtil.ExtractSub has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body's own statements and 7 belong to 5 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.
ToolCommands.CreateFileCommand (cyclomatic 26) src/N_m3u8DL-RE/CommandLine/ToolCommands.cs:107— ToolCommands.CreateFileCommand has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 7 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 157). 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.
MSSExtractor.ExtractStreamsAsync (cyclomatic 26) src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:45— MSSExtractor.ExtractStreamsAsync 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.
DefaultHLSContentProcessor.Process (cyclomatic 25) src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSContentProcessor.cs:25— DefaultHLSContentProcessor.Process 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.
SimpleDownloader.DownClipAsync (cyclomatic 24) src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs:83— SimpleDownloader.DownClipAsync has cyclomatic complexity 24 (threshold 15). Of this number, 20 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.
HLSExtractor.ParseMasterListAsync (cyclomatic 23) src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:79— HLSExtractor.ParseMasterListAsync 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.
MediaProcessingColumn.Render (cyclomatic 22) src/N_m3u8DL-RE/Column/MediaProcessingColumn.cs:16— MediaProcessingColumn.Render 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.
LiveSegmentTracker.FindMatchingIndex (cyclomatic 22) src/N_m3u8DL-RE/DownloadManager/LiveSegmentTracker.cs:20— LiveSegmentTracker.FindMatchingIndex has cyclomatic complexity 22 (threshold 15). Of this number, 14 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.
MP4MediaInfoUtil.ReadTiming (cyclomatic 22) src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs:28— MP4MediaInfoUtil.ReadTiming has cyclomatic 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MergeUtil.MergeByFFmpeg (cyclomatic 21) REDACTED:223— MergeUtil.MergeByFFmpeg 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.
HTTPUtil.GetEncodingFromBom (cyclomatic 21) src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:235— HTTPUtil.GetEncodingFromBom 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.
NetscapeCookieFile.Parse (cyclomatic 21) src/N_m3u8DL-RE.Common/Util/NetscapeCookieFile.cs:28— NetscapeCookieFile.Parse 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.
CommandInvoker.ParseStreamFilter (cyclomatic 20) src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:448— CommandInvoker.ParseStreamFilter 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.
FilterUtil.SyncStreams (cyclomatic 20) src/N_m3u8DL-RE/Util/FilterUtil.cs:190— FilterUtil.SyncStreams has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body's own statements and 5 belong to 3 function literals inside it that branch. 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.
MergeUtil.MergeByFFmpegAsync (cyclomatic 20) REDACTED:284— MergeUtil.MergeByFFmpegAsync has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
RecordingTrack.PrepareAsync (cyclomatic 20) src/N_m3u8DL-RE/Util/RecordingTrack.cs:188— RecordingTrack.PrepareAsync 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.
DASHExtractor2.ReadTrackMetadata (cyclomatic 20) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:645— DASHExtractor2.ReadTrackMetadata has cyclomatic 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, 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.
MP4MediaInfoUtil.ReadTrackInfo (cyclomatic 20) src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs:120— MP4MediaInfoUtil.ReadTrackInfo has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 164, 137, 148, …). 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.
DefaultHLSKeyProcessor.Process (cyclomatic 20) src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs:27— DefaultHLSKeyProcessor.Process 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.
ConfigFile.Merge (cyclomatic 19) src/N_m3u8DL-RE/CommandLine/ConfigFile.cs:140— ConfigFile.Merge has cyclomatic complexity 19 (threshold 15). Of this number, 17 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.
DoctorUtil.ProbeAsync (cyclomatic 19) src/N_m3u8DL-RE/Util/DoctorUtil.cs:72— DoctorUtil.ProbeAsync 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.
MediaToolProgress.ReadFFmpeg (cyclomatic 19) src/N_m3u8DL-RE/Util/MediaProcessingProgress.cs:174— MediaToolProgress.ReadFFmpeg 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.
OtherUtil.FindAvailableOutputPath (cyclomatic 19) src/N_m3u8DL-RE/Util/OtherUtil.cs:285— OtherUtil.FindAvailableOutputPath 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.
LiveCatchupWindow.Validate (cyclomatic 18) src/N_m3u8DL-RE/DownloadManager/LiveCatchupWindow.cs:15— LiveCatchupWindow.Validate has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
StreamFilter.ToString (cyclomatic 18) src/N_m3u8DL-RE/Entity/StreamFilter.cs:29— StreamFilter.ToString 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.
Program.CheckMediaTools (cyclomatic 18) REDACTED:559— Program.CheckMediaTools 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.
DownloadUtil.DownloadToFileCoreAsync (cyclomatic 18) src/N_m3u8DL-RE/Util/DownloadUtil.cs:71— DownloadUtil.DownloadToFileCoreAsync 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.
FilterUtil.CleanAd (cyclomatic 18) src/N_m3u8DL-RE/Util/FilterUtil.cs:328— FilterUtil.CleanAd 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.
TSInfoUtil.DecodeText (cyclomatic 18) src/N_m3u8DL-RE/Util/TSInfoUtil.cs:198— TSInfoUtil.DecodeText 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.
NetworkInterfaceBinding.Create (cyclomatic 17) src/N_m3u8DL-RE.Common/Util/NetworkInterfaceBinding.cs:30— NetworkInterfaceBinding.Create has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body's own statements and 5 belong to 2 function literals inside it that branch. 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.
IPTVExtractor.ExtractStreamsAsync (cyclomatic 17) src/N_m3u8DL-RE.Parser/Extractor/IPTVExtractor.cs:31— IPTVExtractor.ExtractStreamsAsync 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.
MP4Parser.ParseNext (cyclomatic 17) src/N_m3u8DL-RE.Parser/Mp4/MP4Parser.cs:98— MP4Parser.ParseNext 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.
ConfigFile.MergeUtility (cyclomatic 16) src/N_m3u8DL-RE/CommandLine/ConfigFile.cs:267— ConfigFile.MergeUtility has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
HTTPLiveRecordManager.RecordStreamAsync (cyclomatic 16) src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:60— HTTPLiveRecordManager.RecordStreamAsync 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.
ConcatInputServer.RespondAsync (cyclomatic 16) src/N_m3u8DL-RE/Util/ConcatInputServer.cs:101— ConcatInputServer.RespondAsync 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.
HTTPUtil.GetWebSourceResultAsync (cyclomatic 16) src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:175— HTTPUtil.GetWebSourceResultAsync 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.
MSSMoovProcessor.GetSampleEntryBox (cyclomatic 16) src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:433— MSSMoovProcessor.GetSampleEntryBox 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.
TodoComment REDACTED:299— // TODO: handle the case that shaka packager actually decrypted (key ID == ZeroKid) — 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.
SimpleLiveRecordManager2.RecordStreamAsync (cognitive 361) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:266— SimpleLiveRecordManager2.RecordStreamAsync has cognitive complexity 361 (threshold 15). Of this number, 348 points are the body's own statements and 13 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.
DASHExtractor2.ExtractStreamsAsync (cognitive 344) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:63— DASHExtractor2.ExtractStreamsAsync has cognitive complexity 344 (threshold 15). Of this number, 340 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SimpleDownloadManager.DownloadStreamAsync (cognitive 298) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:107— SimpleDownloadManager.DownloadStreamAsync has cognitive complexity 298 (threshold 15). Of this number, 292 points are the body's own statements and 6 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.
MergeUtil.MuxInputsAsync (cognitive 135) REDACTED:371— MergeUtil.MuxInputsAsync has cognitive complexity 135 (threshold 15). Of this number, 134 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.
Program.DoWorkAsync (cognitive 129) REDACTED:81— Program.DoWorkAsync has cognitive complexity 129 (threshold 15). Of this number, 128 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.
FileToolUtil.ExecuteAsync (cognitive 110) src/N_m3u8DL-RE/Util/FileToolUtil.cs:16— FileToolUtil.ExecuteAsync has cognitive complexity 110 (threshold 15). Of this number, 58 points are the body's own statements and 52 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.
HLSExtractor.ParseListAsync (cognitive 102) src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:223— HLSExtractor.ParseListAsync has cognitive complexity 102 (threshold 15). Of this number, 99 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.
MP4TtmlUtil.ExtractSub (cognitive 98) REDACTED:193— MP4TtmlUtil.ExtractSub has cognitive complexity 98 (threshold 15). Of this number, 97 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.
SimpleLiveRecordManager2.PlayListProduceCoreAsync (cognitive 75) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:935— SimpleLiveRecordManager2.PlayListProduceCoreAsync has cognitive complexity 75 (threshold 15). Of this number, 38 points are the body's own statements and 37 belong to 5 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.
MP4VttUtil.ExtractSub (cognitive 72) src/N_m3u8DL-RE.Parser/Mp4/MP4VttUtil.cs:55— MP4VttUtil.ExtractSub has cognitive complexity 72 (threshold 15). Of this number, 61 points are the body's own statements and 11 belong to 5 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.
TSInfoUtil.ReadServices (cognitive 70) src/N_m3u8DL-RE/Util/TSInfoUtil.cs:12— TSInfoUtil.ReadServices has cognitive complexity 70 (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.
MSSExtractor.ExtractStreamsAsync (cognitive 66) src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:45— MSSExtractor.ExtractStreamsAsync 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.
SimpleDownloadManager.StartDownloadAsync (cognitive 59) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:862— SimpleDownloadManager.StartDownloadAsync has cognitive complexity 59 (threshold 15). Of this number, 21 points are the body's own statements and 38 belong to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HLSExtractor.ParseMasterListAsync (cognitive 54) src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:79— HLSExtractor.ParseMasterListAsync 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.
VodStreamPlanner.Build (cognitive 53) src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:12— VodStreamPlanner.Build has cognitive complexity 53 (threshold 15). Of this number, 47 points are the body's own statements and 6 belong to 5 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.
SimpleLiveRecordManager2.StartRecordCoreAsync (cognitive 52) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1107— SimpleLiveRecordManager2.StartRecordCoreAsync has cognitive complexity 52 (threshold 15). Of this number, 25 points are the body's own statements and 27 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.
RecordingTrack.Read (cognitive 52) src/N_m3u8DL-RE/Util/RecordingTrack.cs:56— RecordingTrack.Read has cognitive complexity 52 (threshold 15). Of this number, 51 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.
SimpleDownloadManager.DownloadPartsAsync (cognitive 49) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:17— SimpleDownloadManager.DownloadPartsAsync 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.
MP4DecryptUtil.DecryptAsync (cognitive 49) REDACTED:13— MP4DecryptUtil.DecryptAsync 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.
RecordingTrack.PrepareAsync (cognitive 42) src/N_m3u8DL-RE/Util/RecordingTrack.cs:188— RecordingTrack.PrepareAsync has cognitive complexity 42 (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.
IPTVExtractor.ExtractStreamsAsync (cognitive 37) src/N_m3u8DL-RE.Parser/Extractor/IPTVExtractor.cs:31— IPTVExtractor.ExtractStreamsAsync 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.
FilterUtil.DoFilterKeep (cognitive 36) src/N_m3u8DL-RE/Util/FilterUtil.cs:13— FilterUtil.DoFilterKeep has cognitive complexity 36 (threshold 15). Of this number, 26 points are the body's own statements and 10 belong to 10 function literals inside it that branch. 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.
FilterUtil.CleanAd (cognitive 35) src/N_m3u8DL-RE/Util/FilterUtil.cs:328— FilterUtil.CleanAd 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.
FilterUtil.SyncStreams (cognitive 34) src/N_m3u8DL-RE/Util/FilterUtil.cs:190— FilterUtil.SyncStreams has cognitive complexity 34 (threshold 15). Of this number, 29 points are the body's own statements and 5 belong to 3 function literals inside it that branch. 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.
MP4MediaInfoUtil.ReadTiming (cognitive 33) src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs:28— MP4MediaInfoUtil.ReadTiming has cognitive complexity 33 (threshold 15). Of this number, 32 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.
MSSMoovProcessor.GetSampleEntryBox (cognitive 33) src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:433— MSSMoovProcessor.GetSampleEntryBox 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.
MediaProcessingColumn.Render (cognitive 32) src/N_m3u8DL-RE/Column/MediaProcessingColumn.cs:16— MediaProcessingColumn.Render 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.
SimpleDownloader.DownClipAsync (cognitive 32) src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs:83— SimpleDownloader.DownClipAsync has cognitive complexity 32 (threshold 15). Of this number, 23 points are the body's own statements and 9 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.
ImageHeaderUtil.ProcessAsync (cognitive 32) src/N_m3u8DL-RE/Util/ImageHeaderUtil.cs:23— ImageHeaderUtil.ProcessAsync 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.
VodStreamPlanner.AlignPeriods (cognitive 32) src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:171— VodStreamPlanner.AlignPeriods has cognitive complexity 32 (threshold 15). Of this number, 28 points are the body's own statements and 4 belong to 4 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.
NetscapeCookieFile.Parse (cognitive 32) src/N_m3u8DL-RE.Common/Util/NetscapeCookieFile.cs:28— NetscapeCookieFile.Parse 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.
DASHExtractor2.RefreshPlayListAsync (cognitive 32) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:730— DASHExtractor2.RefreshPlayListAsync has cognitive complexity 32 (threshold 15). Of this number, 28 points are the body's own statements and 4 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.
MergeUtil.MergeByFFmpeg (cognitive 31) REDACTED:223— MergeUtil.MergeByFFmpeg 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.
Program.CheckMediaTools (cognitive 30) REDACTED:559— Program.CheckMediaTools 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.
ConfigFile.Merge (cognitive 28) src/N_m3u8DL-RE/CommandLine/ConfigFile.cs:140— ConfigFile.Merge has cognitive complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 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.
LiveSegmentTracker.FindMatchingIndex (cognitive 27) src/N_m3u8DL-RE/DownloadManager/LiveSegmentTracker.cs:20— LiveSegmentTracker.FindMatchingIndex has cognitive complexity 27 (threshold 15). Of this number, 21 points are the body's own statements and 6 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.
OtherUtil.FindAvailableOutputPath (cognitive 27) src/N_m3u8DL-RE/Util/OtherUtil.cs:285— OtherUtil.FindAvailableOutputPath 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.
ConfigFile.MergeUtility (cognitive 26) src/N_m3u8DL-RE/CommandLine/ConfigFile.cs:267— ConfigFile.MergeUtility has cognitive complexity 26 (threshold 15). Of this number, 25 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.
HLSExtractor.FetchPlayListAsync (cognitive 26) src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:622— HLSExtractor.FetchPlayListAsync has cognitive complexity 26 (threshold 15). Of this number, 25 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.
DefaultHLSKeyProcessor.Process (cognitive 26) src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSKeyProcessor.cs:27— DefaultHLSKeyProcessor.Process 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.
BinaryDownloadManager.DownloadSequentialAsync (cognitive 25) src/N_m3u8DL-RE/DownloadManager/BinaryDownloadManager.cs:277— BinaryDownloadManager.DownloadSequentialAsync 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.
NetworkInterfaceBinding.Bind (cognitive 25) src/N_m3u8DL-RE.Common/Util/NetworkInterfaceBinding.cs:94— NetworkInterfaceBinding.Bind 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.
ToolCommands.CreateFileCommand (cognitive 24) src/N_m3u8DL-RE/CommandLine/ToolCommands.cs:107— ToolCommands.CreateFileCommand has cognitive complexity 24 (threshold 15). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 157). 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.
SimpleLiveRecordManager2.DownloadLiveSegmentAsync (cognitive 24) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:116— SimpleLiveRecordManager2.DownloadLiveSegmentAsync 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.
FileToolUtil.CompareNatural (cognitive 24) src/N_m3u8DL-RE/Util/FileToolUtil.cs:270— FileToolUtil.CompareNatural 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.
VodStreamPlanner.AlignHlsTimeline (cognitive 24) src/N_m3u8DL-RE/Util/VodStreamPlanner.Hls.cs:8— VodStreamPlanner.AlignHlsTimeline has cognitive complexity 24 (threshold 15). Of this number, 20 points are the body's own statements and 4 belong to 3 function literals inside it that branch. 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.
MP4MediaInfoUtil.ReadFragment (cognitive 24) src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs:356— MP4MediaInfoUtil.ReadFragment has cognitive complexity 24 (threshold 15). None of this is in the body itself: all 24 points belong to 3 function literals inside it that branch (lines 360, 368, 375). 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.
MergeUtil.MergeByFFmpegAsync (cognitive 23) REDACTED:284— MergeUtil.MergeByFFmpegAsync has cognitive complexity 23 (threshold 15). Of this number, 22 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.
MP4MediaInfoUtil.ReadSamples (cognitive 23) src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs:315— MP4MediaInfoUtil.ReadSamples 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.
MP4Parser.ParseNext (cognitive 23) src/N_m3u8DL-RE.Parser/Mp4/MP4Parser.cs:98— MP4Parser.ParseNext 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.
DefaultHLSContentProcessor.Process (cognitive 23) src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSContentProcessor.cs:25— DefaultHLSContentProcessor.Process has cognitive complexity 23 (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.
DownloadUtil.DownloadToFileCoreAsync (cognitive 22) src/N_m3u8DL-RE/Util/DownloadUtil.cs:71— DownloadUtil.DownloadToFileCoreAsync 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.
FilterUtil.SelectStreams (cognitive 22) src/N_m3u8DL-RE/Util/FilterUtil.cs:109— FilterUtil.SelectStreams has cognitive complexity 22 (threshold 15). Of this number, 20 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.
MuxSubtitleTimeline.CreateAsync (cognitive 22) src/N_m3u8DL-RE/Util/MuxSubtitleTimeline.cs:38— MuxSubtitleTimeline.CreateAsync 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.
CommandInvoker.ParseStreamFilter (cognitive 21) src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:448— CommandInvoker.ParseStreamFilter has cognitive complexity 21 (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.
BinaryDownloadManager.FetchBlockAsync (cognitive 21) src/N_m3u8DL-RE/DownloadManager/BinaryDownloadManager.cs:209— BinaryDownloadManager.FetchBlockAsync 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.
HTTPLiveRecordManager.RecordStreamAsync (cognitive 21) src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:60— HTTPLiveRecordManager.RecordStreamAsync 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.
LiveCatchupWindow.Validate (cognitive 21) src/N_m3u8DL-RE/DownloadManager/LiveCatchupWindow.cs:15— LiveCatchupWindow.Validate has cognitive complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WebVttSub.Parse (cognitive 21) src/N_m3u8DL-RE.Common/Entity/WebVttSub.cs:47— WebVttSub.Parse 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.
ChaCha20.WorkBytes (cognitive 20) src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:408— ChaCha20.WorkBytes has cognitive 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.
MediaToolProgress.ReadFFmpeg (cognitive 20) src/N_m3u8DL-RE/Util/MediaProcessingProgress.cs:174— MediaToolProgress.ReadFFmpeg 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.
ComplexParamParser.GetValue (cognitive 18) src/N_m3u8DL-RE/CommandLine/ComplexParamParser.cs:13— ComplexParamParser.GetValue 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.
FilterUtil.ApplyCustomRange (cognitive 18) src/N_m3u8DL-RE/Util/FilterUtil.cs:275— FilterUtil.ApplyCustomRange has cognitive complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 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.
SectionBuffer.Append (cognitive 18) src/N_m3u8DL-RE/Util/TSInfoUtil.cs:151— SectionBuffer.Append 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.
DASHExtractor2.ReadTrackMetadata (cognitive 18) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:645— DASHExtractor2.ReadTrackMetadata has cognitive complexity 18 (threshold 15). Of this number, 13 points are the body's own statements and 5 belong to 2 function literals inside it that branch. 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.
ToolCommands.AddTo (cognitive 17) src/N_m3u8DL-RE/CommandLine/ToolCommands.cs:16— ToolCommands.AddTo has cognitive complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 38, 53, 66, …). 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.
LiveCatchupWindow.TimedSegments (cognitive 17) src/N_m3u8DL-RE/DownloadManager/LiveCatchupWindow.cs:77— LiveCatchupWindow.TimedSegments 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.
StreamFilter.ToString (cognitive 17) src/N_m3u8DL-RE/Entity/StreamFilter.cs:29— StreamFilter.ToString 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.
MuxSubtitleTimeline.Repair (cognitive 17) src/N_m3u8DL-RE/Util/MuxSubtitleTimeline.cs:135— MuxSubtitleTimeline.Repair 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.
NetworkInterfaceBinding.Create (cognitive 17) src/N_m3u8DL-RE.Common/Util/NetworkInterfaceBinding.cs:30— NetworkInterfaceBinding.Create has cognitive complexity 17 (threshold 15). Of this number, 14 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.
MP4MediaInfoUtil.ReadTrack (cognitive 17) src/N_m3u8DL-RE.Parser/Mp4/MP4MediaInfoUtil.cs:237— MP4MediaInfoUtil.ReadTrack has cognitive complexity 17 (threshold 15). None of this is in the body itself: all 17 points belong to 5 function literals inside it that branch (lines 291, 274, 242, …). 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.
ConcatInputServer.RespondAsync (cognitive 16) src/N_m3u8DL-RE/Util/ConcatInputServer.cs:101— ConcatInputServer.RespondAsync 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.
ConcatInputServer.TryGetRange (cognitive 16) src/N_m3u8DL-RE/Util/ConcatInputServer.cs:159— ConcatInputServer.TryGetRange 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.
MergeUtil.RunMediaToolAsync (cognitive 16) REDACTED:560— MergeUtil.RunMediaToolAsync has cognitive complexity 16 (threshold 15). Of this number, 8 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StreamSpec.ToString (cognitive 16) src/N_m3u8DL-RE.Common/Entity/StreamSpec.cs:164— StreamSpec.ToString 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.
HTTPUtil.DoGetAsync (cognitive 16) src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:63— HTTPUtil.DoGetAsync 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.
DASHExtractor2.ResolvePeriodTimings (cognitive 16) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:706— DASHExtractor2.ResolvePeriodTimings has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyMethods: CommandInvoker src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs— TooManyMethods — 584 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. 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.
Change coupling: HTTPLiveRecordManager.cs ↔ SimpleLiveRecordManager2.cs src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:1— `src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs` and `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs` change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). 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 7 shared commits counted here, the most recent 3 are `d07cf222` 优化终端配色以兼顾深浅背景 (#998); `e9254c6e` 修复直播录制时长统计和字幕偏移精度 (#975); `3518c87c` 直播录制时显示已录制文件大小 (#960) — run `git show` on any of them.
Near-duplicate member pair (49 shared lines) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:863— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:863-1071 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1108-1344 — These two members are variants of one another: 49 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.
Duplicated block (25–26 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:628— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:628-652 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:681-706 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:628` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (14 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:348— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:348-361 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:480-493 — 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 (16 lines × 2) src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:273— src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:273-288 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:878-899 — 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 (14 lines × 4) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:554— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:554-567 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:597-610 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:646-659 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:700-713 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:642` calls `TryWriteImagePngsAsync`, `GetEnvironmentVariable` and `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:596` 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 (3–15 lines × 3) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:25— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.Parts.cs:25-27 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:168-182 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:309-323 — 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. 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 (15 lines × 2) src/N_m3u8DL-RE/Util/VodStreamPlanner.Hls.cs:25— src/N_m3u8DL-RE/Util/VodStreamPlanner.Hls.cs:25-39 | src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:196-210 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/Util/VodStreamPlanner.Hls.cs:25` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (13 lines × 2) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:326— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:326-338 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:456-468 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:326` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:469` calls `Add`, `TrackFile` and `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:339` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:387— src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:387-396 | src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:149-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. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:387` 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 (4–10 lines × 3) src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:618— src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:618-621 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:678-687 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:722-731 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:678` 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 × 3) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:543— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:543-549 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:630-636 | src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:683-689 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:543` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 3) src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:282— src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:282-286 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:513-517 | src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:560-564 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:282` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 3) src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:849— src/N_m3u8DL-RE.Parser/Extractor/DASHExtractor2.cs:849-858 | src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:68-77 | src/N_m3u8DL-RE.Parser/Extractor/MSSExtractor.cs:336-345 — 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.
IC1 · Incompleteness & stubs· Both branches open with the same statements · ×1
Both branches open with the same statements — the condition does not decide them src/N_m3u8DL-RE.Common/Log/CustomAnsiConsole.cs:82— The first 2 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently.
Skeleton type — most members are unfinished src/N_m3u8DL-RE.Parser/Extractor/LiveTSExtractor.cs:8— `LiveTSExtractor` has 4 unfinished members out of 7 declared members (methods, properties, indexers and events, whether or not each carries a body) — a scaffolded type that was never implemented.
SC1 · Supply-chain hygiene· NuGet dependencies are not locked · ×1
NuGet dependencies are not locked — No packages.lock.json and no central package management — 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.
Blocking `Thread.Sleep` inside an `async` method src/N_m3u8DL-RE/CommandLine/CommandInvoker.cs:952— `Thread.Sleep` parks the thread for the whole delay: no other work runs on it, and under load the pool must grow to make up for it. `await Task.Delay(…)` suspends only this method.
Blocking `File.ReadAllText` inside an `async` method src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:527— `File.ReadAllText` blocks the thread on I/O while `File.ReadAllTextAsync` exists to wait without one — inside a method that is already `async`, await the twin.
Blocking `PipeUtil.CreatePipe` inside an `async` method src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:784— `PipeUtil.CreatePipe` is a synchronous helper that blocks (`Thread.Sleep`): called from an `async` method it parks the thread exactly as the inline call would. Make the helper `async` and `await` it (`await Task.Delay`, `SemaphoreSlim.WaitAsync`, a `TaskCompletionSource` instead of the poll).
Blocking `MemoryStream.Write` inside an `async` method src/N_m3u8DL-RE.Common/Util/HTTPUtil.cs:222— `MemoryStream.Write` blocks the thread on I/O while `MemoryStream.WriteAsync` exists to wait without one — inside a method that is already `async`, await the twin.
X18 · Disposal-pattern correctness· Finalizer on a type that owns no unmanaged resource · ×1
Finalizer on a type that owns no unmanaged resource src/N_m3u8DL-RE/Crypto/CSChaCha20.cs:522— `ChaCha20` declares a finalizer (line 522), 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.
Swallowed exception (caught, then discarded) REDACTED:661— `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.
Commented-out code src/N_m3u8DL-RE.Parser/Extractor/HLSExtractor.cs:575— 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 src/N_m3u8DL-RE.Parser/Mp4/MP4InitUtil.cs:72— 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 src/N_m3u8DL-RE.Parser/Mp4/MP4Parser.cs:114— 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 REDACTED:101— 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 REDACTED:102— 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 src/N_m3u8DL-RE.Parser/Mp4/MP4VttUtil.cs:194— 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 src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:229— 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 src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:230— 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 src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:637— 16 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 src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:669— 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 src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:756— 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 src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:864— 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 src/N_m3u8DL-RE.Parser/Mp4/MSSMoovProcessor.cs:865— 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 src/N_m3u8DL-RE.Parser/Processor/HLS/DefaultHLSContentProcessor.cs:43— 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 src/N_m3u8DL-RE.Parser/StreamExtractor.cs:98— 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 src/N_m3u8DL-RE.Parser/StreamExtractor.cs:105— 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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:673— 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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:674— 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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:675— 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 src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:694— 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 src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:695— 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 src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:696— 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 src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:736— 6 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 src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs:1143— 6 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 src/N_m3u8DL-RE/Downloader/SimpleDownloader.cs:61— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Duplicated predicate src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:76— `!DownloaderConfig.MyOptions.BinaryMerge && legacyDolbyVision` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:242— `!DownloaderConfig.MyOptions.BinaryMerge && streamSpec.MediaType != MediaType.SUBTITLES` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:282— `(mediaInit.IsEncrypted || !string.IsNullOrEmpty(currentKID)) && DownloaderConfig.MyOptions.MP4RealTimeDecryption && !string.IsNullOrEmpty(cu…` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:668— `DownloaderConfig.MyOptions.AutoSubtitleFix && streamSpec is { MediaType: Common.Enum.MediaType.SUBTITLES, Extension: not null } && streamSpe…` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:620— `DownloaderConfig.MyOptions.AutoSubtitleFix && streamSpec is { MediaType: Common.Enum.MediaType.SUBTITLES, Extension: not null } && streamSpe…` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:518— `DownloaderConfig.MyOptions.AutoSubtitleFix && streamSpec is { MediaType: Common.Enum.MediaType.SUBTITLES, Extension: not null } && streamSpe…` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:576— `DownloaderConfig.MyOptions.AutoSubtitleFix && streamSpec.MediaType == Common.Enum.MediaType.SUBTITLES && streamSpec.Codecs != "stpp" && stre…` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:82— `DownloaderConfig.MyOptions.MuxAfterDone && legacyDolbyVision && DownloaderConfig.MyOptions.MuxOptions?.UseMkvmerge != true` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs:45— `OperatingSystem.IsWindows() || OperatingSystem.IsMacOS()` appears character-identically in 5 files — src/N_m3u8DL-RE/DownloadManager/HTTPLiveRecordManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.cs, src/N_m3u8DL-RE/Util/FileToolUtil.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:291— `decryptEngine == DecryptEngine.MP4DECRYPT && DownloaderConfig.MyOptions.Keys is { Length: > 0 }` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/LiveSegmentNotFoundPolicy.cs:31— `double.IsFinite(segment.Duration) && segment.Duration > 0` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/LiveSegmentNotFoundPolicy.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1041— `exitCode == 0 || DownloaderConfig.MyOptions.MuxOptions.UseMkvmerge && exitCode == 1` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:196— `intervals.Count > 0 && span.Start <= intervals[^1].End + 0.001` appears character-identically in 2 files — src/N_m3u8DL-RE/Util/VodStreamPlanner.Hls.cs, src/N_m3u8DL-RE/Util/VodStreamPlanner.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:74— `mediainfos.Any(m => m.DolbyVison) && !await BinaryToolUtil.FFmpegSupportsDolbyVisionAsync(DownloaderConfig.MyOptions.FFmpegBinaryPath)` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:334— `seg.IsEncrypted && DownloaderConfig.MyOptions.MP4RealTimeDecryption && !string.IsNullOrEmpty(currentKID)` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:411— `seg.IsEncrypted && DownloaderConfig.MyOptions.MP4RealTimeDecryption && result is { Success: true } && !string.IsNullOrEmpty(currentKID)` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:239— `span.Start >= i.Start && span.End <= i.End` appears character-identically in 2 files — src/N_m3u8DL-RE/Util/VodStreamPlanner.Hls.cs, src/N_m3u8DL-RE/Util/VodStreamPlanner.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 src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs:1009— `success && DownloaderConfig.MyOptions.MuxAfterDone && OutputFiles.Count > 0` appears character-identically in 2 files — src/N_m3u8DL-RE/DownloadManager/SimpleDownloadManager.cs, src/N_m3u8DL-RE/DownloadManager/SimpleLiveRecordManager2.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 src/N_m3u8DL-RE/Column/BinaryDownloadSpeedColumn.cs:16— `task.IsFinished || task.StopTime != null || !task.IsStarted` appears character-identically in 2 files — src/N_m3u8DL-RE/Column/BinaryDownloadSpeedColumn.cs, src/N_m3u8DL-RE/Column/DownloadSpeedColumn.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Silent fallback default on parse failure REDACTED:78— `GetOrder` falls back to `0` when `int.TryParse(str, out var order)` 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 src/N_m3u8DL-RE/Util/VodPartSelector.cs:162— `ResolutionArea` falls back to `0` when `values.Length == 2 && int.TryParse(values[0], out var width) && int.TryParse(val…` 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 src/N_m3u8DL-RE/Util/VodStreamPlanner.cs:315— `Pixels` falls back to `0` when `values is { Length: 2 } && long.TryParse(values[0], out var width) && long.TryPa…` 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 src/N_m3u8DL-RE.Common/Resource/ResString.cs:309— `GetText` returns `"<...LANG TEXT MISSING...>"` when `StaticText.LANG_DIC.TryGetValue(key, out var textObj)` 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 in catch src/N_m3u8DL-RE/DownloadManager/BinaryDownloadManager.cs:114— `SupportsRangesAsync` swallows `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 src/N_m3u8DL-RE/Util/BinaryToolUtil.cs:41— `ProbeDolbyVisionAsync` swallows `Exception` into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
No ADRs found — 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/`.
D21 · Naming Consistency· Two private fields in the same class are named similarly but with a numeric suffix on one, suggesting a copy-paste or refactoring artifact where the second name was not updated to reflect its distinct purpose or position. · ×1
Two private fields in the same class are named similarly but with a numeric suffix on one, suggesting a copy-paste or refactoring artifact where the second name was not updated to reflect its distinct purpose or position. — Rename `MyRegex1` to a descriptive name indicating its specific role (e.g., `MyRegexForLineStart` or `MyRegexForTimestamp`), or rename `MyRegex` if they are part of a collection. (symbols: N_m3u8DL_RE.Common.Log.NonAnsiWriter.MyRegex, N_m3u8DL_RE.Common.Log.NonAnsiWriter.MyRegex1)
D28 · Secrets (history)· Rotate the exposed credentials · ×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.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
README/code drift README.md:79— README advertises Docker containerisation, but no Dockerfile/compose file exists — searched for: `dockerfile`, `docker-compose`, `compose.yaml`, `compose.yml`. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest and configuration files (package.json and other *.json, *.csproj, *.props, *.sln/*.slnx, *.yml, *.toml, *.config, tool configs such as eslint.config.js, Dockerfile); the README's own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read — a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong.
P12 · CI test-gate honesty· Sleep-based test synchronization · ×1
Sleep-based test synchronization — 16 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.
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 14315 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
PF1 · Benchmark discipline· No performance benchmarks · ×1
No performance benchmarks — No benchmark suite was found by the two searches this check runs. FIRST, a BenchmarkDotNet package reference in any project file — every project the workspace loaded, plus a walk of project files on disk that never loaded, because a benchmark suite is exactly the project a partial load drops. SECOND, a script harness: a file whose name contains `benchmark` and ends `.py`, `.sh`, `.ps1`, `.bash`, `.rb`, `.js` or `.mjs`, credited ONLY when this repository's CI text also mentions benchmarks — a harness no pipeline runs is read as a fixture, deliberately. Neither search can see a benchmark suite in another ecosystem's idiom (a Go `testing.B` file, a JMH or criterion project, a pytest-benchmark run), so this is 'no benchmark found by those two searches', not a verdict that the repository has none. Where code is performance-sensitive, a benchmark guards against silent regressions — but it's a bonus here, not a deduction.
No security response headers detected — None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is configured — defense in depth, even when a reverse proxy could set them. (−2.0 on this card.)
No app-layer HTTPS enforcement detected — No UseHttpsRedirection/UseHsts and no reverse-proxy signal — transport security is unverified at the app layer. (−2.0 on this card.)
X2 · Cancellation propagation· Not all async methods take a CancellationToken · ×1
Not all async methods take a CancellationToken — Only 45/112 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.
X23 · Unguarded diagnostic materialisation· Diagnostic log message is built whether or not it is wanted · ×1
Diagnostic log message is built whether or not it is wanted REDACTED:570— `Debug` at line 570 is called with an argument built by `string.Join(" ", arguments.Select(argument => $"\"{argument}\""))` (line 570), whose cost grows with the collection it walks. C# evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because Debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `IsEnabled` test, no debug flag, no conditional-compilation region.
Null-forgiving operator (`!`) suppressions reduce the NRT score — ~1.7 `!` suppressions per 1k syntax nodes — 247 suppression(s) across the 143103 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.
Off the main sequence: N_m3u8DL-RE.Common src/N_m3u8DL-RE.Common/N_m3u8DL-RE.Common.csproj:1— N_m3u8DL-RE.Common: abstractness 0.00, instability 0.00, distance 1.00 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.
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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 20 file(s) — `src/N_m3u8DL-RE.Common/Entity/WebSourceResult.cs`, `src/N_m3u8DL-RE.Common/Log/CustomAnsiConsole.cs`, `src/N_m3u8DL-RE.Common/Log/Logger.cs`, `src/N_m3u8DL-RE.Common/Util/CookieFileHandler.cs`, `src/N_m3u8DL-RE.Common/Util/CookieFileJar.cs`, … (+15 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
0
—
Run 01a167f2-5ed5-7fe1-b6e7-ece0a224027f · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 59 · Warnings: 330 · Recommendations: 72 · Info: 4 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 23-10-2026 @ 08:48 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.