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

tennc/webshell

Measured 13 November 2026, 21:38 UTC, at code version 6b17eae

Bus factor is not measured: No living knowledge left to concentrate.

CAI score 26out of 100 Weak
CriticalWeakAdequateStrongExemplary
Down 1 since the last survey

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

A large codebase: 304,368 lines of product code, tests not counted · Estimated rebuild effort: about 2.1 person-years · Weakest lens: Production Readiness, 12

Findings by how serious they are

351 critical 5487 serious 292 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
13 November 2026, 21:38 UTC

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

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

30of 30 dimensions measured by tools.
6122of 6130 findings point to an exact file and line, so you can open each one in the code. The other 8 concern the repository as a whole, such as missing documentation.
30dimensions across 6 lenses, read from 304,368 lines of product code.
Chapters

Executive summary

tennc/webshell falls short of our standard for production because the project has no automated tests and we found no working pipeline that builds or tests changes to the code. It scores 26 out of 100 and is rated Weak, and 258 of its 351 critical findings are security problems in its code and in the build pipeline.

Production Readiness, at 12, is the weakest lens and counts most in the score. The best first step is adding automated tests, worth about 14 points. Adding an automated build and test pipeline comes next, worth about 5 points. Raising Production Readiness to 70 would lift the score to about 39.

257 weaknesses in the code could be used by an attacker. One pipeline step runs a download nobody checks, and thirty-nine form fields can't be read by a screen reader. Fixing the weaknesses the scanner points to, checking the download against a checksum and labelling the form fields would close these risks. The 27 images with no text description need a text description.

The product code is 304,368 lines, about €300,000 to rebuild.

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

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

If Production Readiness rose from 12 to 70, the lowest score rated Strong, the score would rise from 26 to about 39.

Code composition: what the lines of code are
Business logic 85%Supporting code 15%
New since the last survey: 206 findings

These 206 critical or serious findings weren't in the previous survey, on 24 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.

  • Code Duplication · Near-duplicate member family (16 members, 59 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (12 members, 15 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (8 members, 25 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (5 members, 67 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (5 members, 16 shared lines) REDACTED
  • Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED
  • Code Duplication · Edited copy of a member (7 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (85 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 8+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (12 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 19+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (4 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (5 members, 1+ corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (29 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (42 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (33 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 6+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (40 corresponding lines) php/phpkit-1.0/phpkitcli.py
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (14 corresponding lines) REDACTED
  • Code Duplication · Edited copy of a member (12 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (11 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (11 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 4+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (11 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (11 corresponding lines) REDACTED
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 7+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (8 members, 1+ corresponding lines) php/wso/wso-4.1.3.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (5 members, 7+ corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (20 corresponding lines) REDACTED
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (9 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (18 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) REDACTED
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php
  • Code Duplication · Edited copies of one member (6 members, 4+ corresponding lines) REDACTED
  • Code Duplication · Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php

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

Fixed since the last survey: 1736 findings

These 1736 critical or serious findings were in the previous survey, on 24 October 2026, and are gone from this one. The first 100 are listed here.

  • Code Duplication · Near-duplicate member family (16 members, 59 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (15 members, 7 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (8 members, 25 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (5 members, 67 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (5 members, 47 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (5 members, 12 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (4 members, 22 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (3 members, 6 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (3 members, 6 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (3 members, 6 shared lines) REDACTED
  • Code Duplication · Near-duplicate member family (3 members, 6 shared lines) REDACTED
  • Code Duplication · Near-duplicate member pair (137 shared lines) REDACTED
  • Code Duplication · Edited copy of a member (12 corresponding lines) REDACTED
  • Code Duplication · Members sharing a duplicated core (13 members, 50+ identical tokens) REDACTED
  • Code Duplication · Duplicated block (55 lines × 3) REDACTED
  • Code Duplication · Duplicated block (32 lines × 8) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (13–32 lines × 2) REDACTED
  • Code Duplication · Duplicated block (31 lines × 4) REDACTED
  • Code Duplication · Duplicated block (29 lines × 8) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (22–28 lines × 8) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (24 lines × 16) REDACTED
  • Code Duplication · Duplicated block (23 lines × 4) REDACTED
  • Code Duplication · Duplicated block (21–22 lines × 7) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (18 lines × 13) REDACTED
  • Code Duplication · Duplicated block (17 lines × 2) REDACTED
  • Code Duplication · Duplicated block (16 lines × 11) REDACTED
  • Code Duplication · Duplicated block (15 lines × 8) REDACTED
  • Code Duplication · Duplicated block (15 lines × 4) REDACTED
  • Code Duplication · Duplicated block (14–15 lines × 2) REDACTED
  • Code Duplication · Duplicated block (11–14 lines × 8) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (13 lines × 13) REDACTED
  • Code Duplication · Duplicated block (12 lines × 5) REDACTED
  • Code Duplication · Duplicated block (11 lines × 11) REDACTED
  • Code Duplication · Duplicated block (11 lines × 3) REDACTED
  • Code Duplication · Duplicated block (10 lines × 4) REDACTED
  • Code Duplication · Duplicated block (9 lines × 4) REDACTED
  • Code Duplication · Duplicated block (9 lines × 4) REDACTED
  • Code Duplication · Duplicated block (9 lines × 3) REDACTED
  • Code Duplication · Duplicated block (9 lines × 2) REDACTED
  • Code Duplication · Duplicated block (9 lines × 2) REDACTED
  • Code Duplication · Duplicated block (1–8 lines × 6) REDACTED
  • Code Duplication · Duplicated block (7 lines × 8) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (7 lines × 5) REDACTED
  • Code Duplication · Duplicated block (7 lines × 3) REDACTED
  • Code Duplication · Duplicated block (7 lines × 3) REDACTED
  • Code Duplication · Duplicated block (6 lines × 15) REDACTED
  • Code Duplication · Duplicated block (6 lines × 13) REDACTED
  • Code Duplication · Duplicated block (6 lines × 4) REDACTED
  • Code Duplication · Duplicated block (6 lines × 3) REDACTED
  • Code Duplication · Duplicated block (6 lines × 2) REDACTED
  • Code Duplication · Duplicated block (6 lines × 2) REDACTED
  • Code Duplication · Duplicated block (6 lines × 2) REDACTED
  • Code Duplication · Duplicated block (3–5 lines × 16) REDACTED
  • Code Duplication · Duplicated block (5 lines × 13) REDACTED
  • Code Duplication · Duplicated block (5 lines × 7) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (5 lines × 5) REDACTED
  • Code Duplication · Duplicated block (5 lines × 4) REDACTED
  • Code Duplication · Duplicated block (5 lines × 3) REDACTED
  • Code Duplication · Duplicated block (5 lines × 3) REDACTED
  • Code Duplication · Duplicated block (5 lines × 2) REDACTED
  • Code Duplication · Duplicated block (5 lines × 5) REDACTED
  • Code Duplication · Duplicated block (11 lines × 3) REDACTED
  • Code Duplication · Duplicated block (5 lines × 2) REDACTED
  • Code Duplication · Duplicated block (5 lines × 8) php/wso/wso-4.1.3.php
  • Code Duplication · Duplicated block (10 lines × 4) REDACTED
  • Secrets (history) · Secret: generic-api-key 138shell/R/r57 Shell.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/R/r57 Shell.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/R/r57.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/R/r57.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/R/r577.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/R/r577.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/S/SnIpEr_SA Shell.txt
  • Secrets (history) · Secret: generic-api-key 138shell/S/SnIpEr_SA Shell.txt
  • Secrets (history) · Secret: generic-api-key 138shell/S/s.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/S/s.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/S/spy.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/S/spy.php.txt
  • Secrets (history) · Secret: generic-api-key 138shell/T/telnet.pl.txt
  • Secrets (history) · Secret: generic-api-key asp/ASPXspy2.aspx
  • Secrets (history) · Secret: generic-api-key aspx/ASPXspy2.aspx
  • Secrets (history) · Secret: generic-api-key aspx/AspxSpy2014Final.aspx
  • Secrets (history) · Secret: generic-api-key aspx/icesword.aspx
  • Secrets (history) · Secret: generic-api-key aspx/lpl38-com-aspx.txt
  • Secrets (history) · Secret: generic-api-key aspx/wso.aspx
  • Secrets (history) · Secret: facebook-page-access-token content/Webshell免杀的思考与学习 - 先知社区.mhtml
  • Secrets (history) · Secret: generic-api-key net-friend/aspx/1.aspx
  • Secrets (history) · Secret: generic-api-key net-friend/aspx/aspx.aspx
  • Secrets (history) · Secret: generic-api-key net-friend/aspx/aspxspy.aspx
  • Secrets (history) · Secret: generic-api-key net-friend/aspx/aspxspy/1.aspx
  • Secrets (history) · Secret: generic-api-key net-friend/aspx/aspxspy/aspxspy.aspx
  • Secrets (history) · Secret: generic-api-key net-friend/aspx/view.aspx
  • Secrets (history) · Secret: generic-api-key net-friend/aspx/干净清爽的大马,不怎么好用.aspx
  • Secrets (history) · Secret: generic-api-key other/ololo.cfm
  • Secrets (history) · Secret: generic-api-key REDACTED.no.txt
  • Secrets (history) · Secret: generic-api-key REDACTED.txt
  • Secrets (history) · Secret: generic-api-key REDACTED
  • Secrets (history) · Secret: generic-api-key REDACTED
  • Secrets (history) · Secret: generic-api-key REDACTED
  • Secrets (history) · Secret: generic-api-key REDACTED
  • Secrets (history) · Secret: generic-api-key REDACTED
Rebuild cost: about €300,000 · Estimate
Cost to rebuild€100,000 to €500,000, for 1,666 to 5,287 hours of work, about 2.1 person-years for 1 to 4 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 26. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 304,368 lines of product code
Comment linesThe estimate prices 303,803 lines. Comment lines count towards the size of 304,368 lines but aren't priced as work.
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 1 No automated tests finding(s) in Code Coverage.
Raises the score by about 14 points · High effort · Code Coverage
2
Add a CI workflow that builds and runs the test suite on every push/PR.
Raises the score by about 5 points · Medium effort · CI/CD gates
3
Run what this repository's stack ships: phpstan or psalm — or `semgrep --config=auto`, which runs on any language — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
Raises the score by about 5 points · Medium effort · Security & performance tooling

Diagnosis: what the measurements show together

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

Where the investment is most exposed · Value at risk
This code would cost about €300,000 to build again, about 2.1 person-years of work. Its weakest lens is Production Readiness, at 12 (Critical). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No automated tests finding(s) in Code Coverage. Of all the actions in this report, it raises the score most for the work it takes: about 14 points for high effort, because it clears the 1 Code Coverage findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 4.9 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 8% to 18% on every change.
How this is estimated: It rests on an assumption of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4)
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.

At a glance — Code Health · 49% · Weak · gated by D1, D2, X5 ·

At a glance — Architecture · 90% · Exemplary ·

At a glance — Maturity · 56% · Adequate · gated by D34 ·

At a glance — Readiness · 12% · Critical · gated by D8, P1, P3 ·

At a glance — Security · 59% · Adequate · gated by D29 ·

At a glance — Accessibility · 19% · Critical · gated by AC1, AC2, AC3, AC4 ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection4060High / Critical
A01:2025 — Broken Access Control1Medium
A02:2025 — Security Misconfiguration1Medium

Roadmap

Top priorities: Resolve the 1 No automated tests finding(s) in Code Coverage; Add a CI workflow that builds and runs the test suite on every push/PR; Run what this repository's stack ships: phpstan or psalm — or `semgrep --config=auto`, which runs on any language — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.

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

Do thisHelpsEffortDimension
Resolve the 1 No automated tests finding(s) in Code Coverage.+13.9 ptsHighCode Coverage
Add a CI workflow that builds and runs the test suite on every push/PR.+5.2 ptsMediumCI/CD gates
Run what this repository's stack ships: phpstan or psalm — or `semgrep --config=auto`, which runs on any language — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.+5.2 ptsMediumSecurity & performance tooling
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.+3.2 ptsMediumText alternatives
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+3.2 ptsMediumKeyboard semantics
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.+2.7 ptsMediumObservability
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.+2.5 ptsMediumPage structure
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.+2.1 ptsMediumForms & labels

File quality

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

FileScoreBandWorst signal
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED

How the grades work

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

Critical — 351

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

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

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

Could not be resolved — 24

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

Methodology & how to trust this report

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

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

What we checked — 30 dimensions across the health lenses
D1D2D3D4D6D7D8D15D17D29D32D34D35D37AC1AC2AC3AC4AC6AX10GD1M1M2M3P1P2P3P6S1X5

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

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1d6d8-dc3c-7862-9a7c-9c4f0b036916.

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

Run transparency — what happened this run

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

  • D5 Coupling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No dependency manifest this pass reads for hygiene (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)) was found in this repository, so no package was assessed. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED — a gap in the analyzer, not a verdict about this repository. This row is about dependency HYGIENE — outdated, deprecated or unmaintained direct dependencies; known CVEs in the same dependency graph are a separate question, reported under D30 wherever the manifest is OSV-readable.
  • D13 Secret Scanning — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Secret Scanning couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
  • D14 License Compliance — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — no dependency manifest this pass reads for licence data (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)) was found in this repository, so it declares no third-party dependency closure to grade. A gap in the analyzer, NOT a finding that this repository's licences are compliant: a manifest in an ecosystem outside that list, or third-party code copied into the tree, is not read — so this dimension asserts nothing about this repository's licensing in either direction.
  • 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. All 229 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains — nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness). Counted over 20 of the 404 production source files in this repository: 175 are under the ~2,400-byte size floor this dimension measures over, and the remaining 209 have no attributable history left to measure.
  • D19 Documentation Quality — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
  • D20 ADR Quality — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The ADR lexicon (adr-lexicon-1) covers de, en, it, nl. A record identified as another language, or whose language could not be identified (fewer than 25 words of prose, or no clear winner), is never read with English rules: its missing-section, status, consequence-cost and same-question rules abstain, and only the structural rules (title, single option, dangling link, enforcement field) run.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D24 compares a comment's words with the identifiers, literals and constructs of the code it annotates, using English function-word and rationale lexicons. Comments in another script or language were left unread rather than counted as clean.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D28 Secrets (history) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `gitleaks` TIMED OUT after 75s against a 75s budget, so we killed its process tree. The budget is ours; the work may simply be larger than it allows. Nothing about this repository is asserted by the absence of a result; the budget is ours to raise, and raising it is our backlog item, not an action for this repository's owner.
  • D32 Data Compliance (PII/GDPR) — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. `php/2022-08-26-05.php`, `php/20220206.php`, `php/PHPshell/NIX REMOTE WEB-SHELL v.0.5 alpha Lite Public Version/NIX REMOTE WEB-SHELL.php`, `REDACTED`, `REDACTED`, … (+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.
  • D44 Platform End-of-Life — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
  • AC2 Forms & labels — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 615 further occurrence(s) are not listed individually; the score already reflects all 655.
  • AC3 Page structure — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 544 further occurrence(s) are not listed individually; the score already reflects all 584.
  • AX3 Project dependency cycles — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over which project references which. That is a language-neutral question, but the project-reference graph is collected from MSBuild .csproj/.fsproj/.vbproj, Gradle, Maven, Cargo, npm/pnpm/yarn, Go module (and dep/glide/godep), Python pyproject.toml/setup.cfg/setup.py, SwiftPM, sbt, Mill, RubyGems, Composer, Mix/rebar3, pub, Unity assembly-definition, Deno/JSR, Tuist, CMake, Bazel, Xcode and XcodeGen builds and uni-app uni_modules plugins, or — when none declares a module — from the imports between a JavaScript/TypeScript, Python, Ruby, loose Rust, build-less C# or manifest-less Go tree's top-level directories, or as one module when all of a tree's source is one directory, and this repository offers none of them — so there was no graph to read, and re-running the same commit reads the same nothing. Its modules are declared as: C# parsed as syntax-only projects (no committed project file), which carry no references between them. A reader for that graph is the collector this check is missing. That is a COLLECTOR gap in this analyzer — no change to the scan image closes it — and not a finding that the repository is free of what this check looks for.
  • AX4 Dependency direction — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the direction each project reference points. That is a language-neutral question, but the project-reference graph is collected from MSBuild .csproj/.fsproj/.vbproj, Gradle, Maven, Cargo, npm/pnpm/yarn, Go module (and dep/glide/godep), Python pyproject.toml/setup.cfg/setup.py, SwiftPM, sbt, Mill, RubyGems, Composer, Mix/rebar3, pub, Unity assembly-definition, Deno/JSR, Tuist, CMake, Bazel, Xcode and XcodeGen builds and uni-app uni_modules plugins, or — when none declares a module — from the imports between a JavaScript/TypeScript, Python, Ruby, loose Rust, build-less C# or manifest-less Go tree's top-level directories, or as one module when all of a tree's source is one directory, and this repository offers none of them — so there was no graph to read, and re-running the same commit reads the same nothing. Its modules are declared as: C# parsed as syntax-only projects (no committed project file), which carry no references between them. A reader for that graph is the collector this check is missing. That is a COLLECTOR gap in this analyzer — no change to the scan image closes it — and not a finding that the repository is free of what this check looks for.
  • AX8 Test isolation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over which projects are test projects, and what they reference. That is a language-neutral question, but the project-reference graph is collected from MSBuild .csproj/.fsproj/.vbproj, Gradle, Maven, Cargo, npm/pnpm/yarn, Go module (and dep/glide/godep), Python pyproject.toml/setup.cfg/setup.py, SwiftPM, sbt, Mill, RubyGems, Composer, Mix/rebar3, pub, Unity assembly-definition, Deno/JSR, Tuist, CMake, Bazel, Xcode and XcodeGen builds and uni-app uni_modules plugins, or — when none declares a module — from the imports between a JavaScript/TypeScript, Python, Ruby, loose Rust, build-less C# or manifest-less Go tree's top-level directories, or as one module when all of a tree's source is one directory, and this repository offers none of them — so there was no graph to read, and re-running the same commit reads the same nothing. Its modules are declared as: C# parsed as syntax-only projects (no committed project file), which carry no references between them. A reader for that graph is the collector this check is missing. That is a COLLECTOR gap in this analyzer — no change to the scan image closes it — and not a finding that the repository is free of what this check looks for.
  • AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 133 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • P10 Library API & versioning — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads NuGet packaging and C# public API, and npm, PyPI, crates.io, Maven/Gradle, Go module, RubyGems, Composer, SwiftPM, CocoaPods, pub.dev, Hex, sbt, Mill and scala-cli package manifests only, and no .NET project and no package manifest of those ecosystems was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • P5 DR & Backup — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found. Whether there is anything here to recover could NOT be determined: persistence is detected from deployment/container manifests and from dependency manifests, and neither was readable by this pass, so a data store this code opens directly — a file, an embedded database — would not be visible to it. The blindness is this analyzer's, not a finding that the repository holds no data. You can widen what we reach: keep the deployment/container manifest or a dependency manifest in this repository — or a link to the ops repo that holds the DR evidence — so the persistence probe has something to read.
  • X10 Duplicated predicate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 18 further occurrence(s) are not listed individually; the score already reflects all 58.
  • X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X13 Undrained process stream — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X24 Document value interpolated into markup unescaped — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This repository's C# was parsed (it ships no .sln or .csproj, so it was read as syntax-only projects), but this check proves its findings from resolved symbols and a reference-free parse resolves none. It abstained rather than report a clean bill it could not earn. That is a gap in this analyzer's reach into build-less repositories — not a finding that the repository is free of what this check looks for.
  • X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • 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.
  • D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • 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.
  • 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").
  • D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
  • 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.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • 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.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity2.9 / 10Weak✓ Tool-verified

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

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

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

300 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was 0.actionFilesMan at 64. A further 5 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 4.get_translations at 42 — they are counted neither in the figure above nor in this dimension's score.

my_sql.dump (cyclomatic 20) · ×5REDACTED:489
my_sql.connect (cyclomatic 16) · ×5REDACTED:349
source.exe (cyclomatic 22) · ×4REDACTED:251
source.gp (cyclomatic 18) · ×4REDACTED:227
zip.ExtractFile (cyclomatic 26) · ×3REDACTED:2406

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

What to do

  1. Bring the 80 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with 0.actionFilesMan (cyclomatic 64), 1.actionFilesMan (cyclomatic 64), 2.actionFilesMan (cyclomatic 64). — 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 80 together lifts Cyclomatic Complexity from 2.9 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.

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

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

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

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

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

458 method(s) exceeded the cognitive complexity threshold of 15; the worst was 0.actionFilesMan at 143.

my_sql.dump (cognitive 33) · ×5REDACTED:489
my_sql.query (cognitive 29) · ×5REDACTED:401
my_sql.connect (cognitive 23) · ×5REDACTED:349
my_sql.get_result (cognitive 17) · ×5REDACTED:452
source.exe (cognitive 44) · ×4REDACTED:251

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

What to do

  1. Bring the 203 bodies over 30 down to 30 or less in Cognitive Complexity — start with 0.actionFilesMan (cognitive 143), 1.actionFilesMan (cognitive 143), 2.actionFilesMan (cognitive 143). — 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 203 together lifts Cognitive Complexity from 2.0 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.

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

D3 · God Classes8.8 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

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

164 god class(es) detected.

MethodTooLong: wso_404.actionlfiscan · ×74REDACTED:463
FileTooLong: REDACTED · ×73REDACTED
TooManyMethods: fbi · ×16REDACTED:1
ClassTooLong: projectREDACTED:3

What to do

  1. Resolve the 74 MethodTooLong finding(s) in God Classes — start with REDACTED (8), REDACTED (5), REDACTED (4). — One of this dimension's main actionable groups (74 warning-level).
  2. Resolve the 73 FileTooLong finding(s) in God Classes — start with REDACTED (2), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (73 warning-level).
  3. Resolve the 16 TooManyMethods finding(s) in God Classes — start with REDACTED (2), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (16 warning-level).

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

D4 · Code Duplication5.8 / 10Adequate✓ Tool-verified

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

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

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

436 duplicated block group(s) detected. 10.5 % of the production lines (31,440 of 298,577) are in a reported copy. A further 265 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Edited copies of one member (3 members, 1+ corresponding lines) · ×35b4tm4n-toolz/database/adminer-4.5.0.php:127
Edited copy of a member (1 corresponding lines) · ×26b4tm4n-toolz/database/adminer-4.5.0.php:1654
Edited copy of a member (2 corresponding lines) · ×24b4tm4n-toolz/database/adminer-4.5.0.php:1649
Members sharing a duplicated core (4 members, 50+ identical tokens) · ×21REDACTED:661
Edited copies of one member (3 members, 2+ corresponding lines) · ×18b4tm4n-toolz/database/adminer-4.5.0.php:1599

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

What to do

  1. Resolve the 35 Edited copies of one member (3 members, 1+ corresponding lines) finding(s) in Code Duplication — start with adminer-4.5.0.php (34), cvwfzthj.php. — One of this dimension's main actionable groups (35 warning-level).
  2. Resolve the 26 Edited copy of a member (1 corresponding lines) finding(s) in Code Duplication — start with adminer-4.5.0.php (21), REDACTED (4), REDACTED. — One of this dimension's main actionable groups (26 warning-level).
  3. Resolve the 24 Edited copy of a member (2 corresponding lines) finding(s) in Code Duplication — start with adminer-4.5.0.php (21), REDACTED, general.php. — One of this dimension's main actionable groups (24 warning-level).

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

D6 · Cohesion (LCOM4)8.8 / 10Strong✓ Tool-verified

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

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

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

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

3 of 31 classes have LCOM4 above 3.

Low cohesion: Adminer (LCOM4 25) · ×3b4tm4n-toolz/database/adminer-4.5.0.php:1410

What to do

  1. Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) — start with adminer-4.5.0.php, REDACTED, adminer-4.2.4.php. — One of this dimension's main actionable groups (3 warning-level).

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

D7 · Architectural Integrity6.0 / 10Adequate✓ Tool-verified

What it measures: Whether the code respects its intended layering / architecture rules.

Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.

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

No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).

Detailed fixes: d7_recommendation.md.

D8 · Code Coverage0.0 / 10Critical✓ Tool-verified

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

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

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

No automated tests — no test code was found in this repository.

No automated tests

What to do

  1. Resolve the 1 No automated tests finding(s) in Code Coverage. — One of this dimension's main actionable groups (1 issue-level).

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

D15 · Churn × Complexity Hotspots10.0 / 10Exemplary✓ Tool-verified

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

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

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

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D17 · Explicit Debt10.0 / 10Stronggated by 7 serious findings✓ Tool-verified

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

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

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

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

TodoComment · ×7REDACTED:2

What to do

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

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

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

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

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

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

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

4240 finding(s): 0 critical, 258 high, 3966 medium, 16 low. semgrep hit a parse error in 37 file(s) — `b4tm4n-toolz/database/adminer-4.5.0.php`, `fuzzdb-webshell/sh/cmd.sh`, `php/2022-08-26-05.php` (line 2), `php/20220206.php` (line 1), `php/PHPshell/NIX REMOTE WEB-SHELL v.0.5 alpha Lite Public Version/NIX REMOTE WEB-SHELL.php`, … (+32 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.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 236 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (18), REDACTED (15), REDACTED (14). — One of this dimension's main actionable groups (236 issue-level).
  2. Resolve the 21 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (21 issue-level).
  3. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

D32 · Data Compliance (PII/GDPR)9.0 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Likely personal-data (PII / GDPR) handling concerns — logging or storing data without safeguards.

Method: Heuristic PII/GDPR LEAK scan via semgrep across the repo, using our own ruleset: personal data crossing a boundary it should not — reaching a log/console sink, a URL or query string, or unprotected browser storage. Matches map to severity and a 0-10 wide normalizer. A clean sweep is unscored rather than an unearned 10, and is a statement about the leak paths checked only — this dimension does not inventory the personal data a repository holds (the personal-data map and the C1-C5 compliance cards do that), so it never reports that a repository has no personal-data surface. Reported LOUDLY as a measurement gap if the ruleset is missing from the analyzer image. Exhaustive over the leak paths, advisory-leaning; degrades on parse failure.

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

1 finding(s): 0 critical, 0 high, 1 medium, 0 low. semgrep could not parse 20 file(s) — `php/2022-08-26-05.php`, `php/20220206.php`, `php/PHPshell/NIX REMOTE WEB-SHELL v.0.5 alpha Lite Public Version/NIX REMOTE WEB-SHELL.php`, `REDACTED`, `REDACTED`, … (+15 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.

REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Data Compliance (PII/GDPR) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

D34 · Knowledge Freshness0.0 / 10Critical✓ Tool-verified

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

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

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

229 of 229 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is php/ucen.php. Counted over 229 of the 404 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×226REDACTED:1
Most significant orphaned file · ×3php/ucen.php:1
Dormant codebase

What to do

  1. Resolve the 226 Orphaned file finding(s) in Knowledge Freshness — start with REDACTED (2), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (226 recommendation-level).
  2. Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with ucen.php, adminer-4.2.4.php, adminer-4.5.0.php. — One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

D35 · Change Coupling10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D37 · Vulnerability-disclosure Policy4.0 / 10Weak✓ Tool-verified

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

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

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

A vulnerability-disclosure policy (REDACTED) is present but lists no reporting contact.

REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Vulnerability-disclosure Policy — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

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

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives1.0 / 10Critical✓ Tool-verified

Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.

  • An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. (×27) — jsp/JspWebshell 1.2.jsp:488, jsp/JspWebshell 1.2.jsp:493, jsp/hackk8/JSP/JspWebshell 1.2.jsp:488, …

What to do

  • Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
AC2 · Forms & labels2.9 / 10Weak✓ Tool-verified

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×39) — drag/mysql数据库脱单个表.jsp:75, drag/mysql数据库脱单个表.jsp:76, drag/mysql数据库脱单个表.jsp:77, …
  • This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. — drag/system.jsp:541

What to do

  • Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
AC3 · Page structure2.1 / 10Critical✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). (×10) — drag/system.jsp:499, fuzzdb-webshell/jsp/browser.jsp:977, fuzzdb-webshell/jsp/browser.jsp:1179, …
  • The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×11) — fuzzdb-webshell/jsp/browser.jsp:895, fuzzdb-webshell/jsp/cmd.jsp:12, fuzzdb-webshell/jsp/list.jsp:15, …
  • A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. (×8) — fuzzdb-webshell/jsp/browser.jsp:895, fuzzdb-webshell/jsp/cmd.jsp:12, fuzzdb-webshell/jsp/list.jsp:15, …
  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×11) — fuzzdb-webshell/jsp/browser.jsp:895, fuzzdb-webshell/jsp/cmd.jsp:12, fuzzdb-webshell/jsp/list.jsp:15, …

What to do

  • Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
AC4 · Keyboard semantics1.0 / 10Critical✓ Tool-verified

Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".

  • A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler. (×4) — jsp/JspWebshell 1.2.jsp:450, jsp/hackk8/JSP/JspWebshell 1.2.jsp:450, jsp/hackk8/JSP_66/JspWebshell 1.2.jsp:450, …
  • An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action. (×7) — jsp/netspy/netspy.jsp:294, jsp/netspy/netspy.jsp:295, jsp/netspy/netspy.jsp:296, …
  • This <tr> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabindex="0", so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabindex="0"="0" so the element can receive that focus. (×2) — jsp/x7.jsp:1159, jsp/x7.jsp:1169

What to do

  • Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
AC6 · Visual & motion safety5.4 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×7) — fuzzdb-webshell/jsp/browser.jsp:914, jsp/hackk8/fuck-jsp/ma2.jsp:447, jsp/hackk8/jsp2/browser.jsp:914, …
  • `body` sets color: red on background-color: white — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×4) — jsp/123.jsp:8, jsp/12302.jsp:7, jsp/hackk8/JSP/minupload.jsp:8, …
  • `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×11) — jsp/201.jsp:1074, jsp/3.jsp:1053, jsp/hackk8/JSP/other/download.jsp:1053, …
  • `.bottom` sets color: #fff on background-color: #888 — 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — jsp/SJavaWebManageV1.4.jsp:863
  • `.tableHeader` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×3) — jsp/hackk8/fuck-jsp/ma2.jsp:442, jsp/ma2.jsp:442, net-friend/jsp/ma2.jsp:442
  • `.tableHeaderLight` sets color: #666666 on background-color: #cccccc — 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×3) — jsp/hackk8/fuck-jsp/ma2.jsp:443, jsp/ma2.jsp:443, net-friend/jsp/ma2.jsp:443
  • `.btn:hover` moves (`transition: background-position .1s linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — php/webshell免杀-提升兼容性.html:17
  • `.btn.active` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — php/webshell免杀-提升兼容性.html:17
  • `h1` sets color: red on background-color: white — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — php/PHPshell/【phpshell-2.1】/style.css:12
  • `input.button` sets color: #8C5900 on background-color: #EF9C00 — 2.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×3) — net-friend/jsp/jspbrowser/example-css.css:1, jsp/jspbrowser/example-css.css:1, jsp/hackk8/fuck-jsp/jspbrowser/example-css.css:1
  • `th` sets color: #022F55 on background-color: #BC001D — 2.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×3) — net-friend/jsp/jspbrowser/example-css.css:12, jsp/jspbrowser/example-css.css:12, jsp/hackk8/fuck-jsp/jspbrowser/example-css.css:12

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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

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

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

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

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.

M1 · Documentation (README)6.0 / 10Adequate✓ Tool-verified

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

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

What to do

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

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

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

  • No 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

  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
M3 · Folder & project structure6.0 / 10Adequate✓ Tool-verified

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

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

  • Most of the production code is in directories of its own, but 2 application file(s) sit at the repository root beside the build and tooling files (`php_niu_3.php`, `REDACTED`).
P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified

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

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

  • No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.

What to do

  • Add a CI workflow that builds and runs the test suite on every push/PR.
P2 · Observability4.6 / 10Weak✓ Tool-verified

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

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

  • Only 1/5 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `.`, `.`, `.`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
  • Add a health-check endpoint (Laravel's /up health route or a /health route) so orchestrators and load balancers can probe liveness/readiness.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add phpstan or psalm (or `semgrep --config=auto`, which runs on any language) — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

  • Run what this repository's stack ships: phpstan or psalm — or `semgrep --config=auto`, which runs on any language — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

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

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

S1 · Cryptographic Hygiene8.0 / 10Strong✓ Tool-verified

Other · Security — Cryptographic hygiene (weak hash/cipher, password key-derivation). This codebase has no web surface, so transport/header/cookie/CSRF controls are N/A and only crypto is scored. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself — a page handed to a consumer runs in that consumer's origin.

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.

  • `http://xslt.alexa.com/site_stats/js/t/c?url=` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 9 such include(s) across the repository's markup. — jsp/520.jsp:1175

What to do

  • Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • 0/1 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.

What to do

  • Put every file in a nullable-enabled context — `#nullable enable` at its top, or commit a project file with <Nullable>enable</Nullable> — and resolve warnings rather than suppressing with `!`.

WCAG coverage — what static analysis assessed

Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC1 · Text alternatives1.1.1, 1.2.2, 1.2.5Partial signal
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC4 · Keyboard semantics2.1.1, 2.4.3Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only

Not statically assessed — these 40 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.2.1, 1.2.3, 1.2.4, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

Reference — by lens

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

LensScoreRatingImpact
Code Health49%Weak — gated by D1, D2, X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture90%ExemplaryStrongest area.
Maturity56%Adequate — gated by D34Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness12%Critical — gated by D8, P1, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security59%Adequate — gated by D29Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility19%Critical — gated by AC1, AC2, AC3, AC4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 1 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.

  • X10 Duplicated predicate — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for

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

  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 83 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.

  • AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
  • AX1 Captive dependencies — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository commits no project file of a kind this check models. This is a gap in the analyzer, not a finding about this repository
  • AX4 Dependency direction — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository commits no project file of a kind this check models. This is a gap in the analyzer, not a finding about this repository
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — no public interfaces
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) that was not loaded for this repository, because the repository commits no project file of a kind this check models. This is a gap in the analyzer, not a finding about this repository
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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.
  • C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • D10 Test Quality — No tests were found in the analyzed repository to assess for quality.
  • D11 Test Reliability — No test suite was found to re-run, so reliability couldn't be assessed. Two searches produced that zero and both came back empty: the classifier that reads the loaded workspace recognised no suite it could run, and a walk of the source on disk — which covers the JS/TS `*.test.*` and `*.spec.*` conventions and probes for a Pester suite — found no test source in any other ecosystem either. Neither search reaches a suite that is missing from the loaded workspace and carries no name either walk recognises, so this is 'no suite found by those two searches', not a verdict that the repository has none.
  • D12 Dependency Hygiene — Dependency hygiene not measured — no supported dependency manifest was read
  • D13 Secret Scanning — Secret Scanning not included (time budget)
  • D14 License Compliance — No dependency manifest found — no declared dependency closure to grade for licences
  • D16 Bus Factor — dormant codebase — no living knowledge left to concentrate
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D19 Documentation Quality — D19 withholds "Documentation: empty section": 2 candidate(s) were measured and not published.
  • D20 ADR Quality — 2 ADR(s) are written in a language our ADR lexicon does not cover, or are too short to tell (undetermined); their sections and statuses were not judged.
  • D21 Naming Consistency — Naming consistency does not read PHP yet; not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — 2 of 2 comment blocks were not judged (2 in a non-Latin script): redundancy is judged by word overlap with the code's identifiers, which cannot be measured across languages.
  • D25 ADR Conformance — None of 0 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
  • D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
  • D27 Navigability — symbol resolution incomplete — navigability not assessed
  • D28 Secrets (history) — gitleaks killed before it finished — this repository's working tree not scanned
  • D30 Dependency Vulnerabilities — 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).
  • 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.
  • D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
  • 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).
  • D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
  • D5 Coupling — D5 reads a .NET project-reference graph only — this repository's production source is .php, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable (this repository commits no MSBuild project, so its C# was read as syntax-only projects — a handler marked ONLY by an interface from a package is not visible without a build)
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • IC1 Incompleteness & stubs — IC1 reached only 0% of this repository's production lines — php (294,648 lines), perl (5,393 lines), python (1,583 lines), java (1,366 lines), vbscript (192 lines), c (150 lines), ruby (97 lines), javascript (56 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • M4 Documentation accuracy — Not applicable: the 51 current-state document(s) make no claim of a kind M4 checks.
  • P10 Library API & versioning — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — no CI workflow found
  • P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • PF3 Async & latency hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X12 Unreachable branch — X12 reached only 0% of this repository's production lines — php (294,648 lines), perl (5,393 lines), python (1,583 lines), java (1,366 lines), vbscript (192 lines), c (150 lines), ruby (97 lines), javascript (56 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X13 Undrained process stream — X13 reached only 0% of this repository's production lines — php (294,648 lines), perl (5,393 lines), python (1,583 lines), java (1,366 lines), vbscript (192 lines), c (150 lines), ruby (97 lines), javascript (56 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — X16 reached only 0% of this repository's production lines — php (294,648 lines), perl (5,393 lines), python (1,583 lines), java (1,366 lines), vbscript (192 lines), c (150 lines), ruby (97 lines), javascript (56 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — X18 reached only 0% of this repository's production lines — php (294,648 lines), perl (5,393 lines), python (1,583 lines), java (1,366 lines), vbscript (192 lines), c (150 lines), ruby (97 lines), javascript (56 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no async method does work a token could cancel
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — X24 reached only 0% of this repository's production lines — php (294,648 lines), perl (5,393 lines), python (1,583 lines), java (1,366 lines), vbscript (192 lines), c (150 lines), ruby (97 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X27 Collection changed while being enumerated — This check needs a compiled C# program and this repository commits no project file to compile, so only its syntax could be read. That is a limit of the analyzer, not a finding about your code.
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — X3 reached only 0% of this repository's production lines — php (294,648 lines), perl (5,393 lines), python (1,583 lines), java (1,366 lines), vbscript (192 lines), c (150 lines), ruby (97 lines), javascript (56 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 351 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 211 more in this group — see findings.md.
AC2 · Forms & labels · <input> without a programmatic label · ×32
  • <input> without a programmatic label drag/mysql数据库脱单个表.jsp:75 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label drag/mysql数据库脱单个表.jsp:76 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label drag/mysql数据库脱单个表.jsp:77 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label drag/mysql数据库脱单个表.jsp:78 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label drag/mysql数据库脱单个表.jsp:79 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label drag/system.jsp:154 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label drag/system.jsp:157 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/browser.jsp:1021 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/browser.jsp:1182 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/browser.jsp:1183 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/browser.jsp:1757 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/browser.jsp:1782 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/cmd.jsp:14 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/cmdjsp.jsp:4 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/jsp-reverse.jsp:54 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/jsp-reverse.jsp:56 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/list.jsp:17 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/up.jsp:15 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/win32/cmd_win32.jsp:14 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label fuzzdb-webshell/jsp/win32/up_win32.jsp:15 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label jsp/1.jsp:14 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label jsp/102.jsp:14 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label jsp/123.jsp:39 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label jsp/12302.jsp:38 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label jsp/2.jsp:1171 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • + 7 more in this group — see findings.md.
AC1 · Text alternatives · <img> without a text alternative · ×27
  • <img> without a text alternative jsp/JspWebshell 1.2.jsp:488 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative jsp/JspWebshell 1.2.jsp:493 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative jsp/hackk8/JSP/JspWebshell 1.2.jsp:488 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative jsp/hackk8/JSP/JspWebshell 1.2.jsp:493 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative jsp/hackk8/JSP_66/JspWebshell 1.2.jsp:488 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative jsp/hackk8/JSP_66/JspWebshell 1.2.jsp:493 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:63 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:66 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:68 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:120 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:122 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:157 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:159 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:161 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:168 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:169 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:171 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:176 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:228 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:230 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:234 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:245 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:247 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:249 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative php/webshell免杀-提升兼容性.html:253 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • + 2 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC3 · Page structure · <html> without a lang · ×11
  • <html> without a lang fuzzdb-webshell/jsp/browser.jsp:895 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang fuzzdb-webshell/jsp/cmd.jsp:12 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang fuzzdb-webshell/jsp/list.jsp:15 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang fuzzdb-webshell/jsp/up.jsp:1 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang fuzzdb-webshell/jsp/win32/cmd_win32.jsp:12 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang fuzzdb-webshell/jsp/win32/up_win32.jsp:1 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang jsp/1.jsp:12 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang jsp/102.jsp:12 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang jsp/123.jsp:4 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang jsp/12302.jsp:3 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang jsp/2.jsp:1076 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC3 · Page structure · Document without a <title> · ×8
  • Document without a <title> fuzzdb-webshell/jsp/browser.jsp:895 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> fuzzdb-webshell/jsp/cmd.jsp:12 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> fuzzdb-webshell/jsp/list.jsp:15 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> fuzzdb-webshell/jsp/up.jsp:1 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> fuzzdb-webshell/jsp/win32/cmd_win32.jsp:12 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> fuzzdb-webshell/jsp/win32/up_win32.jsp:1 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> jsp/1.jsp:12 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> jsp/102.jsp:12 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
AC2 · Forms & labels · <textarea> without a programmatic label · ×4
  • <textarea> without a programmatic label drag/system.jsp:295 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <textarea> without a programmatic label drag/system.jsp:335 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <textarea> without a programmatic label jsp/123.jsp:42 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <textarea> without a programmatic label jsp/12302.jsp:41 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC4 · Keyboard semantics · Click handler on a non-interactive <td> · ×4
  • Click handler on a non-interactive <td> jsp/JspWebshell 1.2.jsp:450 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <td> jsp/hackk8/JSP/JspWebshell 1.2.jsp:450 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <td> jsp/hackk8/JSP_66/JspWebshell 1.2.jsp:450 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <td> web-malware-collection-13-06-2012/JSP/JspWebshell 1.2.jsp:450 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
AC2 · Forms & labels · <select> without a programmatic label · ×3
  • <select> without a programmatic label drag/system.jsp:507 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label jsp/2.jsp:1224 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label jsp/2.jsp:1609 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC4 · Keyboard semantics · Hover-only interaction on <tr> · ×2
  • Hover-only interaction on <tr> jsp/x7.jsp:1159 — This <tr> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabindex="0", so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabindex="0"="0" so the element can receive that focus.
  • Hover-only interaction on <tr> jsp/x7.jsp:1169 — This <tr> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabindex="0", so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabindex="0"="0" so the element can receive that focus.
AC2 · Forms & labels · <label> that labels no control · ×1
  • <label> that labels no control drag/system.jsp:541 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D8 · Code Coverage · No automated tests · ×1
  • No automated tests — No automated tests — no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (PHPUnit or Pest), and run it in CI so the gap cannot reopen.
Serious — 5487 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 1734 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 1459 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×205
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 180 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×106
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 81 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×87
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 62 more in this group — see findings.md.
D3 · God Classes · MethodTooLong · ×74
  • MethodTooLong: wso_404.actionlfiscan REDACTED:463 — MethodTooLong — actionlfiscan runs 319 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 219 over it, 3.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: other-decode.actionSql REDACTED:1120 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 3.actionSql php/wso/wso-4.1.3.php:1229 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 0.actionSql php/wso/wso-4.2.0.php:1226 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 1.actionSql php/wso/wso-4.2.1.php:1222 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 2.actionSql php/wso/wso-4.2.2.php:1221 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 3.actionSql php/wso/wso-4.2.3.php:1225 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 4.actionSql php/wso/wso-4.2.4.php:1230 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 5.actionSql php/wso/wso-4.2.5.php:1236 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: wso2.actionSql REDACTED:1122 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 1.actionSql REDACTED:1122 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: v.actionSql php/zxc/.v.php:1236 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: 5.actionSql REDACTED:1115 — MethodTooLong — actionSql runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92× 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: wso_404.actionSql REDACTED:1608 — MethodTooLong — actionSql runs 286 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 186 over it, 2.86× 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: WSO_4_0_5.actionSql REDACTED:1193 — MethodTooLong — actionSql runs 241 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 141 over it, 2.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: wso.actionSql REDACTED:1127 — MethodTooLong — actionSql runs 241 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 141 over it, 2.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: project.js REDACTED:4 — MethodTooLong — js runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.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: project.show REDACTED:266 — MethodTooLong — show runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78× 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: Customize.Request aspx/httpHandlers_backdoor/Customize.cs:38 — MethodTooLong — Request 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: kyo.���䆀嘉��尟���嬨�友�弣��庘����廜閦��峉�锁����訏�����矣�庣��揯������娅������覮���聜��妗 php/zxc/kyo.php:7 — MethodTooLong — ���䆀嘉��尟���嬨�友�弣��庘����廜閦��峉�锁����訏�����矣�庣��揯������娅������覮���聜��妗 runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74× 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: 4.actionFilesMan php/wso/wso-4.2.4.php:756 — MethodTooLong — actionFilesMan runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: 5.actionFilesMan php/wso/wso-4.2.5.php:762 — MethodTooLong — actionFilesMan runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: v.actionFilesMan php/zxc/.v.php:765 — MethodTooLong — actionFilesMan runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: 3.actionFilesMan php/wso/wso-4.1.3.php:756 — MethodTooLong — actionFilesMan runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67× 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: 0.actionFilesMan php/wso/wso-4.2.0.php:752 — MethodTooLong — actionFilesMan runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67× 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.
  • + 49 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×73
  • FileTooLong: REDACTED REDACTED — FileTooLong — 4281 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3781 over it, 8.56× 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: REDACTED REDACTED — FileTooLong — 3561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3061 over it, 7.12× 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: REDACTED REDACTED — FileTooLong — 2428 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1928 over it, 4.86× 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: REDACTED REDACTED — FileTooLong — 2226 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1726 over it, 4.45× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 2216 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1716 over it, 4.43× 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: REDACTED REDACTED — FileTooLong — 2071 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1571 over it, 4.14× 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: REDACTED REDACTED — FileTooLong — 1972 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1472 over it, 3.94× 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: www-7jyewu-cn/免杀php大马.php www-7jyewu-cn/免杀php大马.php — FileTooLong — 1972 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1472 over it, 3.94× 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: www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php — FileTooLong — 1972 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1472 over it, 3.94× 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: REDACTED REDACTED — FileTooLong — 1927 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1427 over it, 3.85× 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: source/b374k-2.8.source.php php/b374k/source/b374k-2.8.source.php — FileTooLong — 1873 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1373 over it, 3.75× 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: REDACTED REDACTED — FileTooLong — 1741 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1241 over it, 3.48× 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: REDACTED REDACTED — FileTooLong — 1735 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1235 over it, 3.47× 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: REDACTED REDACTED — FileTooLong — 1735 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1235 over it, 3.47× 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: REDACTED REDACTED — FileTooLong — 1720 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1220 over it, 3.44× 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: REDACTED REDACTED — FileTooLong — 1694 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1194 over it, 3.39× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1175 over it, 3.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: php/angel大马.php php/angel大马.php — FileTooLong — 1675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1175 over it, 3.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1671 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1171 over it, 3.34× 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: REDACTED REDACTED — FileTooLong — 1669 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1169 over it, 3.34× 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: REDACTED REDACTED — FileTooLong — 1646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1146 over it, 3.29× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1144 over it, 3.29× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: 【r57_Mohajer22】/r57_Mohajer22.php php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php — FileTooLong — 1643 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1143 over it, 3.29× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1615 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1115 over it, 3.23× 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: 【r57】/r57.php php/PHPshell/【r57】/r57.php — FileTooLong — 1568 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1068 over it, 3.14× 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.
  • + 48 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×63
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 38 more in this group — see findings.md.
D4 · Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) · ×35
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:127 — b4tm4n-toolz/database/adminer-4.5.0.php:127-127 | REDACTED:323-323 | php/twitter/adminer-4.2.4.php:121-121 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:114 — b4tm4n-toolz/database/adminer-4.5.0.php:114-114 | REDACTED:313-313 | php/twitter/adminer-4.2.4.php:109-109 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:172 — b4tm4n-toolz/database/adminer-4.5.0.php:172-172 | REDACTED:369-370 | php/twitter/adminer-4.2.4.php:163-163 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1488 — b4tm4n-toolz/database/adminer-4.5.0.php:1488-1488 | REDACTED:1192-1192 | php/twitter/adminer-4.2.4.php:1392-1392 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1495 — b4tm4n-toolz/database/adminer-4.5.0.php:1495-1496 | REDACTED:1198-1198 | php/twitter/adminer-4.2.4.php:1398-1399 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:76 — b4tm4n-toolz/database/adminer-4.5.0.php:76-76 | REDACTED:281-281 | php/twitter/adminer-4.2.4.php:71-71 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:58 — b4tm4n-toolz/database/adminer-4.5.0.php:58-58 | REDACTED:267-267 | php/twitter/adminer-4.2.4.php:53-53 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1468 — b4tm4n-toolz/database/adminer-4.5.0.php:1468-1468 | REDACTED:1172-1172 | php/twitter/adminer-4.2.4.php:1372-1372 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1493 — b4tm4n-toolz/database/adminer-4.5.0.php:1493-1493 | REDACTED:1197-1197 | php/twitter/adminer-4.2.4.php:1397-1397 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1508 — b4tm4n-toolz/database/adminer-4.5.0.php:1508-1508 | REDACTED:1251-1251 | php/twitter/adminer-4.2.4.php:1411-1411 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1601 — b4tm4n-toolz/database/adminer-4.5.0.php:1601-1601 | REDACTED:1315-1315 | php/twitter/adminer-4.2.4.php:1492-1492 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:50 — b4tm4n-toolz/database/adminer-4.5.0.php:50-50 | REDACTED:261-261 | php/twitter/adminer-4.2.4.php:45-45 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:78 — b4tm4n-toolz/database/adminer-4.5.0.php:78-78 | REDACTED:283-283 | php/twitter/adminer-4.2.4.php:73-73 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1611 — b4tm4n-toolz/database/adminer-4.5.0.php:1611-1611 | REDACTED:1325-1325 | php/twitter/adminer-4.2.4.php:1502-1502 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:128 — b4tm4n-toolz/database/adminer-4.5.0.php:128-128 | REDACTED:324-324 | php/twitter/adminer-4.2.4.php:122-122 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:36 — b4tm4n-toolz/database/adminer-4.5.0.php:36-36 | REDACTED:248-248 | php/twitter/adminer-4.2.4.php:32-32 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1482 — b4tm4n-toolz/database/adminer-4.5.0.php:1482-1482 | REDACTED:1187-1187 | php/twitter/adminer-4.2.4.php:1386-1386 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1628 — b4tm4n-toolz/database/adminer-4.5.0.php:1628-1628 | REDACTED:1345-1345 | php/twitter/adminer-4.2.4.php:1524-1524 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:111 — b4tm4n-toolz/database/adminer-4.5.0.php:111-111 | REDACTED:311-311 | php/twitter/adminer-4.2.4.php:106-106 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1583 — b4tm4n-toolz/database/adminer-4.5.0.php:1583-1583 | REDACTED:1302-1302 | php/twitter/adminer-4.2.4.php:1475-1475 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:98 — b4tm4n-toolz/database/adminer-4.5.0.php:98-98 | REDACTED:299-299 | php/twitter/adminer-4.2.4.php:93-93 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:94 — b4tm4n-toolz/database/adminer-4.5.0.php:94-94 | REDACTED:297-297 | php/twitter/adminer-4.2.4.php:89-89 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:113 — b4tm4n-toolz/database/adminer-4.5.0.php:113-113 | REDACTED:312-312 | php/twitter/adminer-4.2.4.php:108-108 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1610 — b4tm4n-toolz/database/adminer-4.5.0.php:1610-1610 | REDACTED:1324-1324 | php/twitter/adminer-4.2.4.php:1501-1501 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1614 — b4tm4n-toolz/database/adminer-4.5.0.php:1614-1614 | REDACTED:1328-1328 | php/twitter/adminer-4.2.4.php:1505-1505 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • + 10 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×33
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 8 more in this group — see findings.md.
D4 · Code Duplication · Edited copy of a member (1 corresponding lines) · ×26
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1654 — b4tm4n-toolz/database/adminer-4.5.0.php:1654-1654 | php/twitter/adminer-4.2.4.php:1550-1550 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1597 — b4tm4n-toolz/database/adminer-4.5.0.php:1597-1597 | php/twitter/adminer-4.2.4.php:1488-1488 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:199 — b4tm4n-toolz/database/adminer-4.5.0.php:199-199 | php/twitter/adminer-4.2.4.php:190-190 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1501 — b4tm4n-toolz/database/adminer-4.5.0.php:1501-1501 | php/twitter/adminer-4.2.4.php:1404-1404 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:126 — b4tm4n-toolz/database/adminer-4.5.0.php:126-126 | php/twitter/adminer-4.2.4.php:120-120 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1458 — b4tm4n-toolz/database/adminer-4.5.0.php:1458-1458 | php/twitter/adminer-4.2.4.php:1366-1366 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:57 — b4tm4n-toolz/database/adminer-4.5.0.php:57-57 | php/twitter/adminer-4.2.4.php:52-52 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1639 — b4tm4n-toolz/database/adminer-4.5.0.php:1639-1639 | php/twitter/adminer-4.2.4.php:1535-1535 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:147 — b4tm4n-toolz/database/adminer-4.5.0.php:147-147 | php/twitter/adminer-4.2.4.php:139-139 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:137 — b4tm4n-toolz/database/adminer-4.5.0.php:137-137 | php/twitter/adminer-4.2.4.php:129-129 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1643 — b4tm4n-toolz/database/adminer-4.5.0.php:1643-1643 | php/twitter/adminer-4.2.4.php:1539-1539 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1634 — b4tm4n-toolz/database/adminer-4.5.0.php:1634-1634 | php/twitter/adminer-4.2.4.php:1530-1530 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1567 — b4tm4n-toolz/database/adminer-4.5.0.php:1567-1567 | php/twitter/adminer-4.2.4.php:1458-1458 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1452 — b4tm4n-toolz/database/adminer-4.5.0.php:1452-1452 | php/twitter/adminer-4.2.4.php:1362-1362 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:53 — b4tm4n-toolz/database/adminer-4.5.0.php:53-53 | php/twitter/adminer-4.2.4.php:48-48 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1642 — b4tm4n-toolz/database/adminer-4.5.0.php:1642-1642 | php/twitter/adminer-4.2.4.php:1538-1538 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:54 — b4tm4n-toolz/database/adminer-4.5.0.php:54-54 | php/twitter/adminer-4.2.4.php:49-49 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1648 — b4tm4n-toolz/database/adminer-4.5.0.php:1648-1648 | php/twitter/adminer-4.2.4.php:1544-1544 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) REDACTED:255 — REDACTED:255-255 | php/twitter/adminer-4.2.4.php:40-40 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:157 — b4tm4n-toolz/database/adminer-4.5.0.php:157-157 | php/twitter/adminer-4.2.4.php:149-149 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:112 — b4tm4n-toolz/database/adminer-4.5.0.php:112-112 | php/twitter/adminer-4.2.4.php:107-107 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:144 — b4tm4n-toolz/database/adminer-4.5.0.php:144-144 | php/twitter/adminer-4.2.4.php:136-136 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) REDACTED:97 — REDACTED:97-97 | REDACTED:108-108 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) REDACTED:98 — REDACTED:98-98 | REDACTED:109-109 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) REDACTED:99 — REDACTED:99-99 | REDACTED:110-110 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • + 1 more in this group — see findings.md.
D4 · Code Duplication · Edited copy of a member (2 corresponding lines) · ×24
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1649 — b4tm4n-toolz/database/adminer-4.5.0.php:1649-1650 | php/twitter/adminer-4.2.4.php:1545-1546 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:140 — b4tm4n-toolz/database/adminer-4.5.0.php:140-141 | php/twitter/adminer-4.2.4.php:132-133 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:158 — b4tm4n-toolz/database/adminer-4.5.0.php:158-159 | php/twitter/adminer-4.2.4.php:150-151 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:64 — b4tm4n-toolz/database/adminer-4.5.0.php:64-65 | php/twitter/adminer-4.2.4.php:59-60 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1527 — b4tm4n-toolz/database/adminer-4.5.0.php:1527-1528 | php/twitter/adminer-4.2.4.php:1429-1430 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1635 — b4tm4n-toolz/database/adminer-4.5.0.php:1635-1636 | php/twitter/adminer-4.2.4.php:1531-1532 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1464 — b4tm4n-toolz/database/adminer-4.5.0.php:1464-1465 | php/twitter/adminer-4.2.4.php:1368-1369 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1632 — b4tm4n-toolz/database/adminer-4.5.0.php:1632-1633 | php/twitter/adminer-4.2.4.php:1528-1529 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:213 — b4tm4n-toolz/database/adminer-4.5.0.php:213-214 | php/twitter/adminer-4.2.4.php:204-205 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1595 — b4tm4n-toolz/database/adminer-4.5.0.php:1595-1596 | php/twitter/adminer-4.2.4.php:1486-1487 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:82 — b4tm4n-toolz/database/adminer-4.5.0.php:82-83 | php/twitter/adminer-4.2.4.php:77-78 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) REDACTED:277 — REDACTED:277-278 | php/twitter/adminer-4.2.4.php:66-67 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:69 — b4tm4n-toolz/database/adminer-4.5.0.php:69-70 | php/twitter/adminer-4.2.4.php:64-65 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) php/general.php:2 — php/general.php:2-3 | php/session91.php:2-3 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:133 — b4tm4n-toolz/database/adminer-4.5.0.php:133-134 | php/twitter/adminer-4.2.4.php:127-128 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:62 — b4tm4n-toolz/database/adminer-4.5.0.php:62-63 | php/twitter/adminer-4.2.4.php:57-58 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1646 — b4tm4n-toolz/database/adminer-4.5.0.php:1646-1647 | php/twitter/adminer-4.2.4.php:1542-1543 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:205 — b4tm4n-toolz/database/adminer-4.5.0.php:205-206 | php/twitter/adminer-4.2.4.php:196-197 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:88 — b4tm4n-toolz/database/adminer-4.5.0.php:88-89 | php/twitter/adminer-4.2.4.php:83-84 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:200 — b4tm4n-toolz/database/adminer-4.5.0.php:200-201 | php/twitter/adminer-4.2.4.php:191-192 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:104 — b4tm4n-toolz/database/adminer-4.5.0.php:104-105 | php/twitter/adminer-4.2.4.php:99-100 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:66 — b4tm4n-toolz/database/adminer-4.5.0.php:66-67 | php/twitter/adminer-4.2.4.php:61-62 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:142 — b4tm4n-toolz/database/adminer-4.5.0.php:142-143 | php/twitter/adminer-4.2.4.php:134-135 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (2 corresponding lines) REDACTED:461 — REDACTED:461-462 | REDACTED:483-484 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.2 · ×21
  • Low contrast colour pair in CSS (3.2:1) fuzzdb-webshell/jsp/browser.jsp:914 — `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/201.jsp:1074 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/3.jsp:1053 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/hackk8/JSP/other/download.jsp:1053 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/hackk8/JSP_66/other/download.jsp:1053 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/hackk8/fuck-jsp/jspbrowser/Browser.jsp:1074 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/hackk8/fuck-jsp/ma2.jsp:442 — `.tableHeader` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/hackk8/fuck-jsp/ma2.jsp:447 — `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/hackk8/jsp2/browser.jsp:914 — `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/hackk8/jsp_77/browser.jsp:914 — `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/jsp_File_browser.jsp:1074 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/jspbrowser/Browser.jsp:1074 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/ma.jsp:1053 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/ma2.jsp:442 — `.tableHeader` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/ma2.jsp:447 — `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/pyth.jsp:1074 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) jsp/shell.jsp:1074 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) net-friend/jsp/jspbrowser/Browser.jsp:1074 — `input.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) net-friend/jsp/ma2.jsp:442 — `.tableHeader` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) net-friend/jsp/ma2.jsp:447 — `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) web-malware-collection-13-06-2012/JSP/browser.jsp:914 — `.button` sets color: #666666 on background-color: #c0c0c0 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×21
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:661 — REDACTED:661-686 | REDACTED:411-436 | REDACTED:224-245 | REDACTED:433-458 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1652 — REDACTED:1652-1661 | php/angel大马.php:1652-1661 | REDACTED:1652-1661 | REDACTED:1649-1658 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1704 — REDACTED:1704-1713 | php/angel大马.php:1704-1713 | REDACTED:1704-1713 | REDACTED:1701-1710 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1725 — REDACTED:1725-1742 | php/angel大马.php:1725-1742 | REDACTED:1725-1742 | REDACTED:1722-1739 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1811 — REDACTED:1811-1824 | php/angel大马.php:1811-1824 | REDACTED:1811-1824 | REDACTED:1808-1821 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1882 — REDACTED:1882-1905 | php/angel大马.php:1882-1905 | REDACTED:1882-1905 | REDACTED:1879-1902 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:2004 — REDACTED:2004-2009 | php/angel大马.php:2004-2009 | REDACTED:2002-2007 | REDACTED:1999-2004 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:2058 — REDACTED:2058-2067 | php/angel大马.php:2058-2067 | REDACTED:2055-2064 | REDACTED:2052-2061 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:2071 — REDACTED:2071-2097 | php/angel大马.php:2071-2097 | REDACTED:2068-2094 | REDACTED:2065-2091 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:2100 — REDACTED:2100-2108 | php/angel大马.php:2100-2108 | REDACTED:2097-2105 | REDACTED:2094-2102 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1118 — REDACTED:1118-1141 | php/PHPshell/【r57_iFX】/r57_iFX.php:895-918 | php/PHPshell/【r57_karta】/r57_kartal.php:866-889 | php/PHPshell/【r57】/r57.php:1123-1146 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1145 — REDACTED:1145-1167 | php/PHPshell/【r57_iFX】/r57_iFX.php:922-944 | php/PHPshell/【r57_karta】/r57_kartal.php:893-915 | php/PHPshell/【r57】/r57.php:1150-1172 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1200 — REDACTED:1200-1235 | php/PHPshell/【r57_iFX】/r57_iFX.php:977-1012 | php/PHPshell/【r57_karta】/r57_kartal.php:948-983 | php/PHPshell/【r57】/r57.php:1205-1240 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:329 — REDACTED:329-336 | REDACTED:371-378 | REDACTED:375-382 | REDACTED:418-425 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:693 — REDACTED:693-714 | REDACTED:726-747 | REDACTED:803-824 | REDACTED:812-831 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:58 — REDACTED:58-141 | REDACTED:119-202 | REDACTED:129-269 | REDACTED:133-213 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:890 — REDACTED:890-953 | REDACTED:1435-1503 | REDACTED:957-1020 | REDACTED:872-929 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:15 — REDACTED:15-37 | REDACTED:15-37 | REDACTED:15-37 | REDACTED:15-37 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:16 — REDACTED:16-80 | REDACTED:16-80 | REDACTED:16-80 | REDACTED:16-80 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) fuzzdb-webshell/jsp/UpServlet.java:15 — fuzzdb-webshell/jsp/UpServlet.java:15-24 | fuzzdb-webshell/servlet/UpServlet.java:15-24 | jsp/hackk8/jsp2/UpServlet.java:15-24 | jsp/hackk8/jsp_77/UpServlet.java:15-24 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) fuzzdb-webshell/jsp/UpServlet.java:27 — fuzzdb-webshell/jsp/UpServlet.java:27-64 | fuzzdb-webshell/servlet/UpServlet.java:27-64 | jsp/hackk8/jsp2/UpServlet.java:27-64 | jsp/hackk8/jsp_77/UpServlet.java:27-64 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D29 · Static Analysis (SAST) · REDACTED · ×20
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) · ×18
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1599 — b4tm4n-toolz/database/adminer-4.5.0.php:1599-1600 | REDACTED:1313-1314 | php/twitter/adminer-4.2.4.php:1490-1491 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:170 — b4tm4n-toolz/database/adminer-4.5.0.php:170-171 | REDACTED:335-368 | php/twitter/adminer-4.2.4.php:161-162 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1466 — b4tm4n-toolz/database/adminer-4.5.0.php:1466-1467 | REDACTED:1170-1171 | php/twitter/adminer-4.2.4.php:1370-1371 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1586 — b4tm4n-toolz/database/adminer-4.5.0.php:1586-1587 | REDACTED:1305-1306 | php/twitter/adminer-4.2.4.php:1478-1479 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1477 — b4tm4n-toolz/database/adminer-4.5.0.php:1477-1478 | REDACTED:1182-1183 | php/twitter/adminer-4.2.4.php:1381-1382 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1612 — b4tm4n-toolz/database/adminer-4.5.0.php:1612-1613 | REDACTED:1326-1327 | php/twitter/adminer-4.2.4.php:1503-1504 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1510 — b4tm4n-toolz/database/adminer-4.5.0.php:1510-1511 | REDACTED:1252-1253 | php/twitter/adminer-4.2.4.php:1412-1413 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1445 — b4tm4n-toolz/database/adminer-4.5.0.php:1445-1446 | REDACTED:1156-1157 | php/twitter/adminer-4.2.4.php:1355-1356 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:22 — b4tm4n-toolz/database/adminer-4.5.0.php:22-23 | REDACTED:239-240 | php/twitter/adminer-4.2.4.php:22-23 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1640 — b4tm4n-toolz/database/adminer-4.5.0.php:1640-1641 | REDACTED:1353-1354 | php/twitter/adminer-4.2.4.php:1536-1537 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:40 — b4tm4n-toolz/database/adminer-4.5.0.php:40-41 | REDACTED:252-253 | php/twitter/adminer-4.2.4.php:36-37 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:102 — b4tm4n-toolz/database/adminer-4.5.0.php:102-103 | REDACTED:305-306 | php/twitter/adminer-4.2.4.php:97-98 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:108 — b4tm4n-toolz/database/adminer-4.5.0.php:108-110 | REDACTED:309-310 | php/twitter/adminer-4.2.4.php:103-105 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1584 — b4tm4n-toolz/database/adminer-4.5.0.php:1584-1585 | REDACTED:1303-1304 | php/twitter/adminer-4.2.4.php:1476-1477 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:24 — b4tm4n-toolz/database/adminer-4.5.0.php:24-25 | REDACTED:241-242 | php/twitter/adminer-4.2.4.php:24-25 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:92 — b4tm4n-toolz/database/adminer-4.5.0.php:92-93 | REDACTED:295-296 | php/twitter/adminer-4.2.4.php:87-88 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:16 — b4tm4n-toolz/database/adminer-4.5.0.php:16-17 | REDACTED:235-236 | php/twitter/adminer-4.2.4.php:16-17 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 2+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1637 — b4tm4n-toolz/database/adminer-4.5.0.php:1637-1638 | REDACTED:1351-1352 | php/twitter/adminer-4.2.4.php:1533-1534 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D3 · God Classes · TooManyMethods · ×16
  • TooManyMethods: fbi REDACTED:1 — TooManyMethods — 90 methods. The bar is 30 methods; this is 60 over it, 3.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: G5 REDACTED:1 — TooManyMethods — 74 methods. The bar is 30 methods; this is 44 over it, 2.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Adminer REDACTED:1122 — TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: DOC_ZIBSZXBIEG REDACTED:1 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: 免杀php大马 www-7jyewu-cn/免杀php大马.php:1 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: 最新过安全狗- 免杀PHP大马 - www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: 2011 REDACTED:1 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: angel大马 php/angel大马.php:1 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: 2011 REDACTED:1 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: spy REDACTED:1 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: aioshell REDACTED:1 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: source php/b374k/source/b374k-2.8.source.php:1 — TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: 2013未加密 php/phpspy/2013未加密.php:1 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: yaps REDACTED:1 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Private-i3lue REDACTED:1 — TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: source REDACTED:1 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×14
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:1591 — REDACTED:1591-1600 | php/angel大马.php:1591-1600 | REDACTED:1591-1600 | php/phpspy/2013未加密.php:1101-1110 | REDACTED:1588-1597 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:1608 — REDACTED:1608-1612 | php/angel大马.php:1608-1612 | REDACTED:1608-1612 | php/phpspy/2013未加密.php:1121-1125 | REDACTED:1605-1609 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:1665 — REDACTED:1665-1690 | php/angel大马.php:1665-1690 | REDACTED:1665-1690 | php/phpspy/2013未加密.php:1136-1161 | REDACTED:1662-1687 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:1848 — REDACTED:1848-1855 | php/angel大马.php:1848-1855 | REDACTED:1848-1855 | php/phpspy/2013未加密.php:1306-1313 | REDACTED:1845-1852 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:351 — REDACTED:351-378 | REDACTED:320-347 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:427-454 | REDACTED:344-371 | REDACTED:305-332 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:383 — REDACTED:383-398 | REDACTED:352-367 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:459-474 | REDACTED:376-391 | REDACTED:337-352 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:403 — REDACTED:403-450 | REDACTED:372-419 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:479-526 | REDACTED:396-443 | REDACTED:357-404 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:454 — REDACTED:454-487 | REDACTED:423-456 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:530-563 | REDACTED:447-480 | REDACTED:408-441 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:491 — REDACTED:491-543 | REDACTED:460-512 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:567-619 | REDACTED:484-536 | REDACTED:445-497 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:547 — REDACTED:547-561 | REDACTED:516-530 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:623-637 | REDACTED:540-554 | REDACTED:501-515 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:565 — REDACTED:565-582 | REDACTED:534-551 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:641-658 | REDACTED:558-575 | REDACTED:519-536 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:167 — REDACTED:167-180 | REDACTED:184-224 | REDACTED:233-251 | REDACTED:266-298 | REDACTED:324-342 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:632 — REDACTED:632-658 | REDACTED:665-691 | REDACTED:742-768 | REDACTED:756-783 | php/b374k/source/b374k-2.8.source.php:747-777 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
  • Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:364 — REDACTED:364-369 | REDACTED:366-371 | REDACTED:368-373 | REDACTED:366-371 | REDACTED:353-358 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
AC3 · Page structure · Page without a main landmark · ×11
  • Page without a main landmark fuzzdb-webshell/jsp/browser.jsp:895 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark fuzzdb-webshell/jsp/cmd.jsp:12 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark fuzzdb-webshell/jsp/list.jsp:15 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark fuzzdb-webshell/jsp/up.jsp:1 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark fuzzdb-webshell/jsp/win32/cmd_win32.jsp:12 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark fuzzdb-webshell/jsp/win32/up_win32.jsp:1 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark jsp/1.jsp:12 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark jsp/102.jsp:12 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark jsp/123.jsp:4 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark jsp/12302.jsp:3 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark jsp/2.jsp:1076 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
AC3 · Page structure · Data table has no header cells · ×10
  • Data table has no header cells drag/system.jsp:499 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells fuzzdb-webshell/jsp/browser.jsp:977 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells fuzzdb-webshell/jsp/browser.jsp:1179 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells jsp/2.jsp:1140 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells jsp/2.jsp:1143 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells jsp/2.jsp:1219 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells jsp/2.jsp:1257 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells jsp/2.jsp:1517 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells jsp/2.jsp:1604 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells jsp/2.jsp:1653 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×10
  • Duplicated block (11 lines × 3) REDACTED:163 — REDACTED:163-173 | REDACTED:188-198 | php/b374k/source/b374k-2.8.source.php:244-254 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:163` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 3) REDACTED:329 — REDACTED:329-339 | REDACTED:331-341 | REDACTED:331-341 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 3) REDACTED:209 — REDACTED:209-219 | REDACTED:270-280 | REDACTED:295-308 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:209` 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 (11 lines × 3) REDACTED:877 — REDACTED:877-887 | REDACTED:569-579 | REDACTED:406-416 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (11 lines × 3) REDACTED:680 — REDACTED:680-690 | REDACTED:713-723 | REDACTED:790-800 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 3) REDACTED:717 — REDACTED:717-727 | REDACTED:750-760 | REDACTED:827-837 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 3) REDACTED:748 — REDACTED:748-758 | REDACTED:781-791 | REDACTED:858-868 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 3) REDACTED:1960 — REDACTED:1960-1970 | www-7jyewu-cn/免杀php大马.php:1960-1970 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1960-1970 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 3) REDACTED:567 — REDACTED:567-577 | REDACTED:572-582 | REDACTED:625-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:567` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (11 lines × 3) REDACTED:807 — REDACTED:807-817 | REDACTED:563-573 | REDACTED:548-558 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×10
  • Duplicated block (7 lines × 2) REDACTED:344 — REDACTED:344-350 | REDACTED:322-328 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (7 lines × 2) REDACTED:328 — REDACTED:328-334 | REDACTED:371-377 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 547 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) REDACTED:142 — REDACTED:142-148 | php/b374k/source/b374k-2.8.source.php:189-195 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) REDACTED:702 — REDACTED:702-708 | REDACTED:460-466 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) REDACTED:1097 — REDACTED:1097-1103 | REDACTED:1146-1152 — 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 (7 lines × 2) REDACTED:1121 — REDACTED:1121-1127 | REDACTED:1162-1168 — 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 (7 lines × 2) REDACTED:410 — REDACTED:410-416 | php/b374k/source/b374k-2.8.source.php:471-477 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) REDACTED:630 — REDACTED:630-636 | REDACTED:630-636 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) REDACTED:276 — REDACTED:276-282 | php/b374k/source/b374k-2.8.source.php:337-343 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (7 lines × 2) REDACTED:393 — REDACTED:393-399 | REDACTED:397-403 — 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 `REDACTED:393` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×10
  • Duplicated block (6 lines × 2) REDACTED:187 — REDACTED:187-192 | REDACTED:193-198 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) REDACTED:432 — REDACTED:432-437 | REDACTED:489-494 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:432` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:437` calls `cs` and `REDACTED:494` does not — after which the two agree again for 5 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) REDACTED:152 — REDACTED:152-157 | php/b374k/source/b374k-2.8.source.php:199-204 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:152` 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) REDACTED:482 — REDACTED:482-487 | REDACTED:504-509 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:482` 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) php/wso/wso-4.2.0.php:879 — php/wso/wso-4.2.0.php:879-884 | REDACTED:1073-1078 — before extracting anything, compare `php/wso/wso-4.2.0.php` and `REDACTED` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) REDACTED:868 — REDACTED:868-873 | php/b374k/source/b374k-2.8.source.php:880-885 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) REDACTED:440 — REDACTED:440-445 | REDACTED:462-467 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) REDACTED:791 — REDACTED:791-796 | php/b374k/source/b374k-2.8.source.php:788-793 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) REDACTED:804 — REDACTED:804-809 | php/b374k/source/b374k-2.8.source.php:823-828 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) REDACTED:839 — REDACTED:839-844 | php/b374k/source/b374k-2.8.source.php:864-869 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D29 · Static Analysis (SAST) · REDACTED · ×9
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) · ×9
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1479 — b4tm4n-toolz/database/adminer-4.5.0.php:1479-1481 | REDACTED:1184-1186 | php/twitter/adminer-4.2.4.php:1383-1385 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1623 — b4tm4n-toolz/database/adminer-4.5.0.php:1623-1627 | REDACTED:1342-1344 | php/twitter/adminer-4.2.4.php:1519-1523 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:37 — b4tm4n-toolz/database/adminer-4.5.0.php:37-39 | REDACTED:249-251 | php/twitter/adminer-4.2.4.php:33-35 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1471 — b4tm4n-toolz/database/adminer-4.5.0.php:1471-1473 | REDACTED:1175-1177 | php/twitter/adminer-4.2.4.php:1375-1377 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:79 — b4tm4n-toolz/database/adminer-4.5.0.php:79-81 | REDACTED:284-286 | php/twitter/adminer-4.2.4.php:74-76 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:129 — b4tm4n-toolz/database/adminer-4.5.0.php:129-131 | REDACTED:325-327 | php/twitter/adminer-4.2.4.php:123-125 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1629 — b4tm4n-toolz/database/adminer-4.5.0.php:1629-1631 | REDACTED:1346-1348 | php/twitter/adminer-4.2.4.php:1525-1527 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1580 — b4tm4n-toolz/database/adminer-4.5.0.php:1580-1582 | REDACTED:1299-1301 | php/twitter/adminer-4.2.4.php:1472-1474 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 3+ corresponding lines) REDACTED:116 — REDACTED:116-118 | REDACTED:120-122 | REDACTED:131-133 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×9
  • Duplicated block (5 lines × 2) REDACTED:368 — REDACTED:368-372 | REDACTED:375-379 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:368` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) REDACTED:667 — REDACTED:667-671 | REDACTED:706-710 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 65 separate duplicated blocks between them, totalling at least 1035 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Godzilla/20220213_02.php:6 — Godzilla/20220213_02.php:6-10 | REDACTED:6-10 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `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 (5 lines × 2) b4tm4n-toolz/database/adminer-4.5.0.php:1602 — b4tm4n-toolz/database/adminer-4.5.0.php:1602-1606 | php/twitter/adminer-4.2.4.php:1493-1497 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (5 lines × 2) b4tm4n-toolz/database/adminer-4.5.0.php:164 — b4tm4n-toolz/database/adminer-4.5.0.php:164-168 | php/twitter/adminer-4.2.4.php:155-159 — 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 `b4tm4n-toolz/database/adminer-4.5.0.php:164` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (5 lines × 2) REDACTED:603 — REDACTED:603-607 | REDACTED:603-607 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) REDACTED:460 — REDACTED:460-464 | php/b374k/source/b374k-2.8.source.php:521-525 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (5 lines × 2) REDACTED:652 — REDACTED:652-656 | REDACTED:1062-1066 — 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) py/Phyton Shell.py:32 — py/Phyton Shell.py:32-36 | py/d00r_py3.py:35-39 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Edited copy of a member (3 corresponding lines) · ×8
  • Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:115 — b4tm4n-toolz/database/adminer-4.5.0.php:115-118 | php/twitter/adminer-4.2.4.php:110-112 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1607 — b4tm4n-toolz/database/adminer-4.5.0.php:1607-1609 | php/twitter/adminer-4.2.4.php:1498-1500 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1588 — b4tm4n-toolz/database/adminer-4.5.0.php:1588-1590 | php/twitter/adminer-4.2.4.php:1480-1482 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1524 — b4tm4n-toolz/database/adminer-4.5.0.php:1524-1526 | php/twitter/adminer-4.2.4.php:1426-1428 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:95 — b4tm4n-toolz/database/adminer-4.5.0.php:95-97 | php/twitter/adminer-4.2.4.php:90-92 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:59 — b4tm4n-toolz/database/adminer-4.5.0.php:59-61 | php/twitter/adminer-4.2.4.php:54-56 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) php/PHPshell/PHP Shell/PHP Shell.php:48 — php/PHPshell/PHP Shell/PHP Shell.php:48-50 | web-malware-collection-13-06-2012/PHP/Macker's Private PHPShell.php:95-99 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) REDACTED:312 — REDACTED:312-314 | REDACTED:290-292 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 4+ corresponding lines) · ×8
  • Edited copies of one member (3 members, 4+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1489 — b4tm4n-toolz/database/adminer-4.5.0.php:1489-1492 | REDACTED:1193-1196 | php/twitter/adminer-4.2.4.php:1393-1396 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) REDACTED:1351 — REDACTED:1351-1354 | www-7jyewu-cn/免杀php大马.php:1351-1354 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1351-1354 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) REDACTED:1195 — REDACTED:1195-1198 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1307-1310 | php/PHPshell/【r57】/r57.php:1044-1047 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:84 — b4tm4n-toolz/database/adminer-4.5.0.php:84-87 | REDACTED:289-292 | php/twitter/adminer-4.2.4.php:79-82 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) REDACTED:1202 — REDACTED:1202-1205 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1314-1317 | php/PHPshell/【r57】/r57.php:1051-1054 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) REDACTED:663 — REDACTED:663-666 | REDACTED:115-119 | REDACTED:663-666 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) REDACTED:1387 — REDACTED:1387-1390 | www-7jyewu-cn/免杀php大马.php:1387-1390 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1387-1390 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) REDACTED:2134 — REDACTED:2134-2137 | php/angel大马.php:2134-2137 | REDACTED:2131-2134 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×8
  • Duplicated block (11 lines × 2) REDACTED:853 — REDACTED:853-863 | REDACTED:609-619 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:853` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) php/wso/wso-4.2.0.php:928 — php/wso/wso-4.2.0.php:928-938 | REDACTED:1123-1133 — before extracting anything, compare `php/wso/wso-4.2.0.php` and `REDACTED` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.2.0.php:928` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) REDACTED:421 — REDACTED:421-431 | REDACTED:451-461 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 65 separate duplicated blocks between them, totalling at least 1035 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:421` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:419` calls `showSecParam`, `implode`, `file_get_contents` and `REDACTED:451` 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 (11 lines × 2) REDACTED:1033 — REDACTED:1033-1043 | REDACTED:557-567 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) REDACTED:470 — REDACTED:470-480 | php/b374k/source/b374k-2.8.source.php:531-541 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:470` 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 (11 lines × 2) REDACTED:1981 — REDACTED:1981-1991 | php/angel大马.php:1981-1991 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) REDACTED:955 — REDACTED:955-965 | REDACTED:647-657 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) php/phpkit-1.0/phpkitcli.py:27 — php/phpkit-0.2a/phpkit.py:26-36 | php/phpkit-1.0/phpkitcli.py:27-37 — 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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×8
  • Duplicated block (10 lines × 2) php/PHPshell/PHP Shell/PHP Shell.php:124 — php/PHPshell/PHP Shell/PHP Shell.php:124-133 | web-malware-collection-13-06-2012/PHP/Macker's Private PHPShell.php:247-256 — before extracting anything, compare `php/PHPshell/PHP Shell/PHP Shell.php` and `web-malware-collection-13-06-2012/PHP/Macker's Private PHPShell.php` as WHOLE FILES: 98% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `web-malware-collection-13-06-2012/PHP/Macker's Private PHPShell.php:247` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (10 lines × 2) REDACTED:442 — REDACTED:442-451 | REDACTED:438-447 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:442` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:440` calls `cs` and `REDACTED:436` 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 (10 lines × 2) REDACTED:507 — REDACTED:507-516 | php/b374k/source/b374k-2.8.source.php:572-581 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:507` 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) REDACTED:58 — REDACTED:58-67 | REDACTED:119-128 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:58` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) php/wso/wso-4.2.0.php:916 — php/wso/wso-4.2.0.php:916-925 | REDACTED:1111-1120 — before extracting anything, compare `php/wso/wso-4.2.0.php` and `REDACTED` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.2.0.php:916` 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 (10 lines × 2) REDACTED:397 — REDACTED:397-406 | php/b374k/source/b374k-2.8.source.php:458-467 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 2) Godzilla/123.php:6 — Godzilla/123.php:6-15 | Godzilla/20220213.php:6-15 — before extracting anything, compare `Godzilla/123.php` and `Godzilla/20220213.php` as WHOLE FILES: 89% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Godzilla/123.php:6` 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 (10 lines × 2) REDACTED:140 — REDACTED:140-149 | REDACTED:58-67 — 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 `REDACTED:58` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
AC4 · Keyboard semantics · Link used as a button (placeholder href) · ×7
  • Link used as a button (placeholder href) jsp/netspy/netspy.jsp:294 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) jsp/netspy/netspy.jsp:295 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) jsp/netspy/netspy.jsp:296 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) jsp/webshell-nc.jsp:868 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) jsp/webshell-nc.jsp:873 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) jsp/webshell-nc.jsp:877 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) jsp/webshell-nc.jsp:881 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
D17 · Explicit Debt · TodoComment · ×7
  • TodoComment REDACTED:2 — // TODO :: multi_query, dump, encoding, load_file — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment py/smtpd.py:66 — # TODO: — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment REDACTED:91 — // todo: https://antichat.com/threads/470018/
  • TodoComment REDACTED:124 — // TODO change to while read foo do echo foo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment REDACTED:126 — // TODO change to while read foo do echo foo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment REDACTED:477 — // todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment REDACTED:616 — //todo: change download function — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×7
  • Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:58 — REDACTED:58-65 | REDACTED:92-99 | REDACTED:104-112 | REDACTED:108-116 | REDACTED:119-127 | REDACTED:54-61 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:216 — REDACTED:216-271 | REDACTED:248-301 | REDACTED:252-305 | REDACTED:290-343 | REDACTED:326-378 | php/b374k/source/b374k-2.8.source.php:387-439 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:340 — REDACTED:340-357 | REDACTED:382-399 | REDACTED:386-403 | REDACTED:429-450 | REDACTED:468-488 | php/b374k/source/b374k-2.8.source.php:529-549 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:425 — REDACTED:425-521 | REDACTED:468-617 | REDACTED:472-649 | REDACTED:523-727 | REDACTED:600-736 | php/b374k/source/b374k-2.8.source.php:641-727 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:207 — REDACTED:207-229 | REDACTED:232-259 | REDACTED:207-229 | REDACTED:232-259 | REDACTED:188-210 | REDACTED:213-240 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:809 — REDACTED:809-838 | REDACTED:841-872 | REDACTED:809-838 | REDACTED:841-872 | REDACTED:790-819 | REDACTED:822-853 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:2320 — REDACTED:2320-2342 | REDACTED:2381-2402 | www-7jyewu-cn/免杀php大马.php:2320-2342 | www-7jyewu-cn/免杀php大马.php:2381-2402 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2320-2342 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2381-2402 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×7
  • Duplicated block (9 lines × 3) REDACTED:340 — REDACTED:340-348 | REDACTED:382-390 | REDACTED:386-394 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:340` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 3) REDACTED:104 — REDACTED:104-112 | REDACTED:108-116 | REDACTED:119-127 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. 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 (9 lines × 3) REDACTED:422 — REDACTED:422-430 | REDACTED:452-460 | REDACTED:419-427 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 65 separate duplicated blocks between them, totalling at least 1035 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:422` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:421` calls `showSecParam`, `file_get_contents`, `ex` and `REDACTED:452` 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 (9 lines × 3) REDACTED:1227 — REDACTED:1227-1235 | www-7jyewu-cn/免杀php大马.php:1227-1235 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1227-1235 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 3) REDACTED:1600 — REDACTED:1600-1608 | www-7jyewu-cn/免杀php大马.php:1600-1608 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1600-1608 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 3) REDACTED:1018 — REDACTED:1018-1026 | REDACTED:960-968 | REDACTED:1030-1039 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 3) REDACTED:1789 — REDACTED:1789-1797 | www-7jyewu-cn/免杀php大马.php:1789-1797 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1789-1797 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×7
  • Duplicated block (8 lines × 2) REDACTED:317 — REDACTED:317-324 | REDACTED:295-302 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 2) REDACTED:177 — REDACTED:177-184 | REDACTED:233-240 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:177` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:241` calls `fputs` and `REDACTED:185` 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 (8 lines × 2) REDACTED:470 — REDACTED:470-477 | REDACTED:479-486 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:470` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) REDACTED:140 — REDACTED:140-147 | REDACTED:144-151 — 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 (8 lines × 2) REDACTED:656 — REDACTED:656-663 | php/wso/wso-4.2.0.php:696-703 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 835 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) REDACTED:266 — REDACTED:266-273 | REDACTED:244-251 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (8 lines × 2) REDACTED:256 — REDACTED:256-263 | REDACTED:234-241 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×7
  • Duplicated block (6 lines × 3) REDACTED:255 — REDACTED:255-260 | REDACTED:199-204 | REDACTED:251-256 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:255` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 3) REDACTED:442 — REDACTED:442-447 | REDACTED:499-504 | REDACTED:438-443 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:442` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:440` calls `cs` and `REDACTED:436` 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 (6 lines × 3) REDACTED:666 — REDACTED:666-671 | REDACTED:948-953 | REDACTED:1015-1020 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1020` calls `focus` and `REDACTED:671` 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 (6 lines × 3) REDACTED:2337 — REDACTED:2337-2342 | www-7jyewu-cn/免杀php大马.php:2337-2342 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2337-2342 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2337` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `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 (6 lines × 3) REDACTED:1275 — REDACTED:1275-1280 | REDACTED:1266-1271 | REDACTED:1098-1103 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 3) REDACTED:1289 — REDACTED:1289-1294 | www-7jyewu-cn/免杀php大马.php:1289-1294 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1289-1294 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 3) REDACTED:1397 — REDACTED:1397-1402 | www-7jyewu-cn/免杀php大马.php:1397-1402 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1397-1402 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1397` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×6
  • Duplicated block (13 lines × 2) REDACTED:59 — REDACTED:59-71 | REDACTED:42-54 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:53` calls `isset` and `REDACTED:36` 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 (13 lines × 2) REDACTED:328 — REDACTED:328-340 | REDACTED:306-318 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (13 lines × 2) REDACTED:1015 — REDACTED:1015-1027 | REDACTED:1183-1195 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1015` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) REDACTED:392 — REDACTED:392-404 | REDACTED:409-421 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:392` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) REDACTED:493 — REDACTED:493-505 | php/b374k/source/b374k-2.8.source.php:554-566 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:493` 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 (13 lines × 2) REDACTED:544 — REDACTED:544-556 | REDACTED:525-537 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 399 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×6
  • Duplicated block (9 lines × 2) REDACTED:852 — REDACTED:852-860 | php/b374k/source/b374k-2.8.source.php:804-812 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 2) REDACTED:449 — REDACTED:449-457 | REDACTED:471-479 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) REDACTED:2428 — REDACTED:2428-2436 | REDACTED:2446-2454 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2428` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 2) REDACTED:823 — REDACTED:823-831 | php/b374k/source/b374k-2.8.source.php:845-853 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `php/b374k/source/b374k-2.8.source.php:843` calls `elseif`, `function_exists`, `mssql_field_name` and `REDACTED:821` 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 (9 lines × 2) REDACTED:215 — REDACTED:215-223 | REDACTED:193-201 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (9 lines × 2) REDACTED:1982 — REDACTED:1982-1990 | REDACTED:1979-1987 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 313 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.0 · ×5
  • Low contrast colour pair in CSS (4.0:1) jsp/123.jsp:8 — `body` sets color: red on background-color: white — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.0:1) jsp/12302.jsp:7 — `body` sets color: red on background-color: white — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.0:1) jsp/hackk8/JSP/minupload.jsp:8 — `body` sets color: red on background-color: white — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.0:1) jsp/hackk8/JSP_66/minupload.jsp:8 — `body` sets color: red on background-color: white — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.0:1) php/PHPshell/【phpshell-2.1】/style.css:12 — `h1` sets color: red on background-color: white — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · my_sql.dump (cyclomatic 20) · ×5
  • my_sql.dump (cyclomatic 20) REDACTED:489 — my_sql.dump 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.
  • my_sql.dump (cyclomatic 20) REDACTED:458 — my_sql.dump 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.
  • my_sql.dump (cyclomatic 20) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:565 — my_sql.dump 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.
  • my_sql.dump (cyclomatic 20) REDACTED:482 — my_sql.dump 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.
  • my_sql.dump (cyclomatic 20) REDACTED:443 — my_sql.dump has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · my_sql.connect (cyclomatic 16) · ×5
  • my_sql.connect (cyclomatic 16) REDACTED:349 — my_sql.connect 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.
  • my_sql.connect (cyclomatic 16) REDACTED:318 — my_sql.connect 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.
  • my_sql.connect (cyclomatic 16) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:425 — my_sql.connect 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.
  • my_sql.connect (cyclomatic 16) REDACTED:342 — my_sql.connect 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.
  • my_sql.connect (cyclomatic 16) REDACTED:303 — my_sql.connect 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.
D2 · Cognitive Complexity · my_sql.dump (cognitive 33) · ×5
  • my_sql.dump (cognitive 33) REDACTED:489 — my_sql.dump has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • my_sql.dump (cognitive 33) REDACTED:458 — my_sql.dump has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • my_sql.dump (cognitive 33) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:565 — my_sql.dump has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • my_sql.dump (cognitive 33) REDACTED:482 — my_sql.dump has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • my_sql.dump (cognitive 33) REDACTED:443 — my_sql.dump has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (15 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · my_sql.query (cognitive 29) · ×5
  • my_sql.query (cognitive 29) REDACTED:401 — my_sql.query has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.query (cognitive 29) REDACTED:370 — my_sql.query has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.query (cognitive 29) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:477 — my_sql.query has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.query (cognitive 29) REDACTED:394 — my_sql.query has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.query (cognitive 29) REDACTED:355 — my_sql.query has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · my_sql.connect (cognitive 23) · ×5
  • my_sql.connect (cognitive 23) REDACTED:349 — my_sql.connect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.connect (cognitive 23) REDACTED:318 — my_sql.connect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.connect (cognitive 23) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:425 — my_sql.connect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.connect (cognitive 23) REDACTED:342 — my_sql.connect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.connect (cognitive 23) REDACTED:303 — my_sql.connect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · my_sql.get_result (cognitive 17) · ×5
  • my_sql.get_result (cognitive 17) REDACTED:452 — my_sql.get_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.get_result (cognitive 17) REDACTED:421 — my_sql.get_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.get_result (cognitive 17) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:528 — my_sql.get_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.get_result (cognitive 17) REDACTED:445 — my_sql.get_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • my_sql.get_result (cognitive 17) REDACTED:406 — my_sql.get_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D29 · Static Analysis (SAST) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×5
  • Edited copy of a member (4 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1502 — b4tm4n-toolz/database/adminer-4.5.0.php:1502-1505 | php/twitter/adminer-4.2.4.php:1405-1408 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) REDACTED:306 — REDACTED:306-309 | REDACTED:284-287 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) REDACTED:108 — REDACTED:108-111 | REDACTED:91-94 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) REDACTED:368 — REDACTED:368-371 | REDACTED:368-371 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) REDACTED:101 — REDACTED:101-104 | REDACTED:84-87 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×5
  • Edited copy of a member (11 corresponding lines) REDACTED:786 — REDACTED:786-796 | php/b374k/source/b374k-2.8.source.php:780-793 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) REDACTED:834 — REDACTED:834-844 | php/b374k/source/b374k-2.8.source.php:856-869 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) REDACTED:799 — REDACTED:799-809 | php/b374k/source/b374k-2.8.source.php:815-828 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) REDACTED:863 — REDACTED:863-873 | php/b374k/source/b374k-2.8.source.php:872-885 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1568 — b4tm4n-toolz/database/adminer-4.5.0.php:1568-1578 | php/twitter/adminer-4.2.4.php:1459-1470 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×5
  • Duplicated block (14 lines × 3) REDACTED:422 — REDACTED:422-435 | REDACTED:426-439 | REDACTED:477-490 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:422` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (14 lines × 3) REDACTED:937 — REDACTED:937-950 | REDACTED:629-642 | REDACTED:466-479 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (14 lines × 3) REDACTED:677 — REDACTED:677-690 | REDACTED:435-448 | REDACTED:470-483 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:677` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 3) REDACTED:914 — REDACTED:914-927 | REDACTED:980-993 | REDACTED:894-907 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 65 separate duplicated blocks between them, totalling at least 1035 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:980` 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 (14 lines × 3) REDACTED:2198 — REDACTED:2198-2211 | www-7jyewu-cn/免杀php大马.php:2198-2211 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2198-2211 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×5
  • Duplicated block (10 lines × 4) REDACTED:1652 — REDACTED:1652-1661 | php/angel大马.php:1652-1661 | REDACTED:1652-1661 | REDACTED:1649-1658 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1652` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 4) REDACTED:1704 — REDACTED:1704-1713 | php/angel大马.php:1704-1713 | REDACTED:1704-1713 | REDACTED:1701-1710 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (10 lines × 4) REDACTED:694 — REDACTED:694-703 | REDACTED:727-736 | REDACTED:804-813 | REDACTED:813-822 — 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 4 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 4) REDACTED:1533 — REDACTED:1533-1542 | REDACTED:2248-2257 | www-7jyewu-cn/免杀php大马.php:2248-2257 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2248-2257 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 4) REDACTED:2058 — REDACTED:2058-2067 | php/angel大马.php:2058-2067 | REDACTED:2055-2064 | REDACTED:2052-2061 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2058` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×5
  • Duplicated block (10 lines × 3) REDACTED:589 — REDACTED:589-598 | REDACTED:589-598 | REDACTED:570-579 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 3) REDACTED:1198 — REDACTED:1198-1207 | REDACTED:1198-1207 | REDACTED:1179-1188 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 3) REDACTED:937 — REDACTED:937-946 | REDACTED:1487-1496 | REDACTED:1003-1012 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 48 separate duplicated blocks between them, totalling at least 634 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:937` 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) REDACTED:1265 — REDACTED:1265-1274 | www-7jyewu-cn/免杀php大马.php:1265-1274 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1265-1274 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 3) REDACTED:2368 — REDACTED:2368-2377 | www-7jyewu-cn/免杀php大马.php:2368-2377 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2368-2377 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2368` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (6 lines × 5) · ×5
  • Duplicated block (6 lines × 5) REDACTED:364 — REDACTED:364-369 | REDACTED:366-371 | REDACTED:368-373 | REDACTED:366-371 | REDACTED:353-358 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 5) REDACTED:763 — REDACTED:763-768 | REDACTED:765-770 | REDACTED:1205-1210 | REDACTED:765-770 | REDACTED:752-757 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:763` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:1205` calls `is_array`, `count` and `REDACTED:763` does not — after which the two agree again for 5 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 × 5) REDACTED:311 — REDACTED:311-316 | REDACTED:285-290 | REDACTED:315-320 | REDACTED:319-324 | REDACTED:307-312 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 5) REDACTED:215 — REDACTED:215-220 | REDACTED:219-224 | REDACTED:257-262 | REDACTED:293-298 | php/b374k/source/b374k-2.8.source.php:354-359 — 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 5 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 5) REDACTED:230 — REDACTED:230-235 | REDACTED:234-239 | REDACTED:272-277 | REDACTED:308-313 | php/b374k/source/b374k-2.8.source.php:369-374 — 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 5 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×5
  • Duplicated block (5 lines × 3) REDACTED:343 — REDACTED:343-347 | REDACTED:403-407 | REDACTED:398-402 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:343` 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 × 3) REDACTED:661 — REDACTED:661-665 | REDACTED:1183-1187 | REDACTED:699-703 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 48 separate duplicated blocks between them, totalling at least 634 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:661` 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 × 3) REDACTED:1225 — REDACTED:1225-1229 | REDACTED:1216-1220 | REDACTED:1048-1052 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1225` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 3) REDACTED:1262 — REDACTED:1262-1266 | REDACTED:1253-1257 | REDACTED:1085-1089 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (5 lines × 3) REDACTED:106 — REDACTED:106-110 | REDACTED:106-110 | REDACTED:105-109 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
D1 · Cyclomatic Complexity · source.exe (cyclomatic 22) · ×4
  • source.exe (cyclomatic 22) REDACTED:251 — source.exe 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.
  • source.exe (cyclomatic 22) REDACTED:289 — source.exe 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.
  • source.exe (cyclomatic 22) REDACTED:325 — source.exe 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.
  • source.exe (cyclomatic 22) php/b374k/source/b374k-2.8.source.php:386 — source.exe has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.gp (cyclomatic 18) · ×4
  • source.gp (cyclomatic 18) REDACTED:227 — source.gp 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.
  • source.gp (cyclomatic 18) REDACTED:265 — source.gp 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.
  • source.gp (cyclomatic 18) REDACTED:301 — source.gp 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.
  • source.gp (cyclomatic 18) php/b374k/source/b374k-2.8.source.php:362 — source.gp 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.
D2 · Cognitive Complexity · source.exe (cognitive 44) · ×4
  • source.exe (cognitive 44) REDACTED:251 — source.exe has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (12 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.exe (cognitive 44) REDACTED:289 — source.exe has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (12 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.exe (cognitive 44) REDACTED:325 — source.exe has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (12 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.exe (cognitive 44) php/b374k/source/b374k-2.8.source.php:386 — source.exe has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (12 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.sql_connect (cognitive 28) · ×4
  • source.sql_connect (cognitive 28) REDACTED:664 — source.sql_connect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (28 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.sql_connect (cognitive 28) REDACTED:741 — source.sql_connect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (28 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.sql_connect (cognitive 28) REDACTED:755 — source.sql_connect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (28 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.sql_connect (cognitive 28) php/b374k/source/b374k-2.8.source.php:746 — source.sql_connect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (28 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.gp (cognitive 22) · ×4
  • source.gp (cognitive 22) REDACTED:227 — source.gp has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.gp (cognitive 22) REDACTED:265 — source.gp has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.gp (cognitive 22) REDACTED:301 — source.gp has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.gp (cognitive 22) php/b374k/source/b374k-2.8.source.php:362 — source.gp has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ListServlet.doGet (cognitive 21) · ×4
  • ListServlet.doGet (cognitive 21) REDACTED:16 — ListServlet.doGet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ListServlet.doGet (cognitive 21) REDACTED:16 — ListServlet.doGet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ListServlet.doGet (cognitive 21) REDACTED:16 — ListServlet.doGet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ListServlet.doGet (cognitive 21) REDACTED:16 — ListServlet.doGet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Members sharing a duplicated core (17 members, 50+ identical tokens) · ×4
  • Members sharing a duplicated core (17 members, 50+ identical tokens) REDACTED:305 — REDACTED:305-325 | REDACTED:230-250 | php/wso/wso-4.1.3.php:236-256 | php/wso/wso-4.2.0.php:252-272 | php/wso/wso-4.2.1.php:252-272 | php/wso/wso-4.2.2.php:251-271 | php/wso/wso-4.2.3.php:255-275 | php/wso/wso-4.2.4.php:260-280 | php/wso/wso-4.2.5.php:266-286 | REDACTED:291-311 | REDACTED:307-327 | REDACTED:313-333 | REDACTED:307-327 | php/zxc/.v.php:270-290 | REDACTED:320-340 | REDACTED:297-317 | REDACTED:298-318 — These 17 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 17 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 17 times.
  • Members sharing a duplicated core (17 members, 50+ identical tokens) REDACTED:391 — REDACTED:391-468 | REDACTED:307-382 | php/wso/wso-4.1.3.php:346-413 | php/wso/wso-4.2.0.php:346-413 | php/wso/wso-4.2.1.php:346-413 | php/wso/wso-4.2.2.php:345-412 | php/wso/wso-4.2.3.php:349-416 | php/wso/wso-4.2.4.php:354-421 | php/wso/wso-4.2.5.php:360-427 | REDACTED:367-431 | REDACTED:393-470 | REDACTED:393-460 | REDACTED:393-470 | php/zxc/.v.php:364-431 | REDACTED:397-461 | REDACTED:380-457 | REDACTED:366-427 — These 17 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 17 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 17 times.
  • Members sharing a duplicated core (17 members, 50+ identical tokens) REDACTED:1037 — REDACTED:1037-1117 | REDACTED:1109-1189 | php/wso/wso-4.1.3.php:1146-1227 | php/wso/wso-4.2.0.php:1143-1224 | php/wso/wso-4.2.1.php:1139-1220 | php/wso/wso-4.2.2.php:1138-1219 | php/wso/wso-4.2.3.php:1142-1223 | php/wso/wso-4.2.4.php:1147-1228 | php/wso/wso-4.2.5.php:1153-1234 | REDACTED:1045-1125 | REDACTED:1039-1119 | REDACTED:1525-1605 | REDACTED:1039-1119 | php/zxc/.v.php:1153-1234 | REDACTED:1043-1123 | REDACTED:1026-1106 | REDACTED:948-1026 — These 17 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 17 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 17 times.
  • Members sharing a duplicated core (17 members, 50+ identical tokens) REDACTED:117 — REDACTED:117-124 | REDACTED:284-291 | REDACTED:253-260 | php/wso/wso-4.1.3.php:275-282 | php/wso/wso-4.2.0.php:275-282 | php/wso/wso-4.2.1.php:275-282 | php/wso/wso-4.2.2.php:274-281 | php/wso/wso-4.2.3.php:278-285 | php/wso/wso-4.2.4.php:283-290 | php/wso/wso-4.2.5.php:289-296 | REDACTED:314-321 | REDACTED:336-343 | php/zxc/.v.php:293-300 | REDACTED:128-135 | REDACTED:343-350 | REDACTED:321-328 | REDACTED:321-328 — These 17 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 17 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 17 times.
D4 · Code Duplication · Members sharing a duplicated core (9 members, 50+ identical tokens) · ×4
  • Members sharing a duplicated core (9 members, 50+ identical tokens) REDACTED:1299 — REDACTED:1299-1324 | REDACTED:1274-1299 | REDACTED:1171-1196 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1386-1411 | php/PHPshell/【r57_iFX】/r57_iFX.php:948-973 | php/PHPshell/【r57_karta】/r57_kartal.php:919-944 | php/PHPshell/【r57】/r57.php:1176-1201 | REDACTED:1290-1315 | REDACTED:1122-1147 — These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times.
  • Members sharing a duplicated core (9 members, 50+ identical tokens) REDACTED:1339 — REDACTED:1339-1349 | REDACTED:1314-1324 | REDACTED:1251-1261 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1426-1436 | php/PHPshell/【r57_iFX】/r57_iFX.php:1028-1038 | php/PHPshell/【r57_karta】/r57_kartal.php:999-1009 | php/PHPshell/【r57】/r57.php:1256-1266 | REDACTED:1330-1340 | REDACTED:1162-1172 — These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times.
  • Members sharing a duplicated core (9 members, 50+ identical tokens) REDACTED:1358 — REDACTED:1358-1387 | REDACTED:1333-1362 | REDACTED:1270-1299 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1445-1474 | php/PHPshell/【r57_iFX】/r57_iFX.php:1047-1076 | php/PHPshell/【r57_karta】/r57_kartal.php:1018-1047 | php/PHPshell/【r57】/r57.php:1275-1304 | REDACTED:1349-1378 | REDACTED:1181-1210 — These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times.
  • Members sharing a duplicated core (9 members, 50+ identical tokens) REDACTED:26 — REDACTED:26-33 | php/wso/wso-4.1.3.php:265-272 | php/wso/wso-4.2.0.php:45-52 | php/wso/wso-4.2.1.php:45-52 | php/wso/wso-4.2.2.php:44-51 | php/wso/wso-4.2.3.php:44-51 | php/wso/wso-4.2.4.php:49-56 | php/wso/wso-4.2.5.php:49-56 | php/zxc/.v.php:50-59 — These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×4
  • Duplicated block (15 lines × 3) REDACTED:490 — REDACTED:490-504 | REDACTED:494-508 | REDACTED:547-561 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:490` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (15 lines × 3) REDACTED:661 — REDACTED:661-675 | REDACTED:694-708 | REDACTED:771-785 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (15 lines × 3) REDACTED:713 — REDACTED:713-727 | REDACTED:469-483 | REDACTED:506-520 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:713` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (15 lines × 3) REDACTED:1493 — REDACTED:1493-1507 | www-7jyewu-cn/免杀php大马.php:1493-1507 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1493-1507 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×4
  • Duplicated block (14 lines × 2) REDACTED:238 — REDACTED:238-251 | REDACTED:234-247 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (14 lines × 2) REDACTED:1011 — REDACTED:1011-1024 | REDACTED:535-548 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `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 (14 lines × 2) REDACTED:394 — REDACTED:394-407 | REDACTED:416-429 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (14 lines × 2) php/zxc/kyo.php:113 — php/zxc/kyo.php:113-126 | php/zxc/kyo.php:156-169 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9 lines × 5) · ×4
  • Duplicated block (9 lines × 5) REDACTED:167 — REDACTED:167-175 | REDACTED:193-201 | REDACTED:233-241 | REDACTED:266-274 | REDACTED:324-332 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:167` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 5) REDACTED:369 — REDACTED:369-377 | REDACTED:437-445 | REDACTED:481-489 | REDACTED:485-493 | REDACTED:365-373 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:369` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 5) REDACTED:450 — REDACTED:450-458 | REDACTED:364-372 | REDACTED:452-460 | REDACTED:452-460 | REDACTED:439-447 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:450` 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 (9 lines × 5) REDACTED:1025 — REDACTED:1025-1033 | REDACTED:1027-1035 | REDACTED:1513-1521 | REDACTED:1027-1035 | REDACTED:1014-1022 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1037` calls `array`, `$x10` and `REDACTED:1036` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9 lines × 4) · ×4
  • Duplicated block (9 lines × 4) REDACTED:2100 — REDACTED:2100-2108 | php/angel大马.php:2100-2108 | REDACTED:2097-2105 | REDACTED:2094-2102 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2100` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 4) REDACTED:389 — REDACTED:389-397 | REDACTED:406-414 | REDACTED:385-393 | REDACTED:402-410 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:389` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 4) REDACTED:1835 — REDACTED:1835-1843 | php/angel大马.php:1835-1843 | REDACTED:1835-1843 | REDACTED:1832-1840 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (9 lines × 4) fuzzdb-webshell/jsp/UpServlet.java:16 — fuzzdb-webshell/jsp/UpServlet.java:16-24 | fuzzdb-webshell/servlet/UpServlet.java:16-24 | jsp/hackk8/jsp2/UpServlet.java:16-24 | jsp/hackk8/jsp_77/UpServlet.java:16-24 — `fuzzdb-webshell/jsp/UpServlet.java` and `fuzzdb-webshell/servlet/UpServlet.java` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 2 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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.
D4 · Code Duplication · Duplicated block (8 lines × 5) · ×4
  • Duplicated block (8 lines × 5) REDACTED:1848 — REDACTED:1848-1855 | php/angel大马.php:1848-1855 | REDACTED:1848-1855 | php/phpspy/2013未加密.php:1306-1313 | REDACTED:1845-1852 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (8 lines × 5) REDACTED:788 — REDACTED:788-795 | REDACTED:544-551 | REDACTED:1062-1069 | REDACTED:581-588 | REDACTED:529-536 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:788` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 5) REDACTED:351 — REDACTED:351-358 | REDACTED:320-327 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:427-434 | REDACTED:344-351 | REDACTED:305-312 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:351` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 5) REDACTED:1860 — REDACTED:1860-1867 | php/angel大马.php:1860-1867 | REDACTED:1860-1867 | php/phpspy/2013未加密.php:1318-1325 | REDACTED:1857-1864 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×4
  • Duplicated block (8 lines × 4) REDACTED:423 — REDACTED:423-430 | REDACTED:444-452 | REDACTED:419-426 | REDACTED:440-448 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:423` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 4) REDACTED:853 — REDACTED:853-860 | REDACTED:609-616 | REDACTED:645-652 | REDACTED:594-601 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:853` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:652` calls `isset` and `REDACTED:860` does not — after which the two agree again for 5 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 (8 lines × 4) REDACTED:329 — REDACTED:329-336 | REDACTED:371-378 | REDACTED:375-382 | REDACTED:418-425 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (8 lines × 4) REDACTED:1747 — REDACTED:1747-1754 | php/angel大马.php:1747-1754 | REDACTED:1747-1754 | REDACTED:1744-1751 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (5 lines × 6) · ×4
  • Duplicated block (5 lines × 6) REDACTED:58 — REDACTED:58-62 | REDACTED:92-96 | REDACTED:105-109 | REDACTED:109-113 | REDACTED:120-124 | REDACTED:54-58 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:58` 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 × 6) REDACTED:256 — REDACTED:256-260 | REDACTED:200-204 | REDACTED:483-487 | REDACTED:505-509 | REDACTED:423-427 | REDACTED:252-256 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 6) REDACTED:842 — REDACTED:842-846 | php/wso/wso-4.2.0.php:918-922 | REDACTED:598-602 | REDACTED:1113-1117 | REDACTED:634-638 | REDACTED:583-587 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 835 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:842` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:640` calls `usort` and `REDACTED:848` 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 (5 lines × 6) REDACTED:2337 — REDACTED:2337-2341 | REDACTED:2368-2374 | www-7jyewu-cn/免杀php大马.php:2337-2341 | www-7jyewu-cn/免杀php大马.php:2368-2374 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2337-2341 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2368-2374 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2337` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:2375` calls `substr` and `REDACTED:2342` 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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.6 · ×3
  • Low contrast colour pair in CSS (3.6:1) jsp/hackk8/fuck-jsp/ma2.jsp:443 — `.tableHeaderLight` sets color: #666666 on background-color: #cccccc — 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.6:1) jsp/ma2.jsp:443 — `.tableHeaderLight` sets color: #666666 on background-color: #cccccc — 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.6:1) net-friend/jsp/ma2.jsp:443 — `.tableHeaderLight` sets color: #666666 on background-color: #cccccc — 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.7 · ×3
  • Low contrast colour pair in CSS (2.7:1) net-friend/jsp/jspbrowser/example-css.css:1 — `input.button` sets color: #8C5900 on background-color: #EF9C00 — 2.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.7:1) jsp/jspbrowser/example-css.css:1 — `input.button` sets color: #8C5900 on background-color: #EF9C00 — 2.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.7:1) jsp/hackk8/fuck-jsp/jspbrowser/example-css.css:1 — `input.button` sets color: #8C5900 on background-color: #EF9C00 — 2.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.0 · ×3
  • Low contrast colour pair in CSS (2.0:1) net-friend/jsp/jspbrowser/example-css.css:12 — `th` sets color: #022F55 on background-color: #BC001D — 2.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.0:1) jsp/jspbrowser/example-css.css:12 — `th` sets color: #022F55 on background-color: #BC001D — 2.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.0:1) jsp/hackk8/fuck-jsp/jspbrowser/example-css.css:12 — `th` sets color: #022F55 on background-color: #BC001D — 2.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · zip.ExtractFile (cyclomatic 26) · ×3
  • zip.ExtractFile (cyclomatic 26) REDACTED:2406 — zip.ExtractFile 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. This is NOT this file's highest cyclomatic complexity: DOC_ZIBSZXBIEG.css_showimg (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
  • zip.ExtractFile (cyclomatic 26) www-7jyewu-cn/免杀php大马.php:2406 — zip.ExtractFile 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. This is NOT this file's highest cyclomatic complexity: 免杀php大马.css_showimg (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
  • zip.ExtractFile (cyclomatic 26) www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2406 — zip.ExtractFile 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. This is NOT this file's highest cyclomatic complexity: 最新过安全狗- 免杀PHP大马 -.css_showimg (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · source.sql_connect (cyclomatic 21) · ×3
  • source.sql_connect (cyclomatic 21) REDACTED:664 — source.sql_connect 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.
  • source.sql_connect (cyclomatic 21) REDACTED:741 — source.sql_connect 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.
  • source.sql_connect (cyclomatic 21) REDACTED:755 — source.sql_connect 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.
D2 · Cognitive Complexity · zip.ExtractFile (cognitive 52) · ×3
  • zip.ExtractFile (cognitive 52) REDACTED:2406 — zip.ExtractFile has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 3 (12 pts), loops 4 (10 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • zip.ExtractFile (cognitive 52) www-7jyewu-cn/免杀php大马.php:2406 — zip.ExtractFile has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 3 (12 pts), loops 4 (10 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • zip.ExtractFile (cognitive 52) www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2406 — zip.ExtractFile has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 3 (12 pts), loops 4 (10 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.zip (cognitive 32) · ×3
  • source.zip (cognitive 32) REDACTED:428 — source.zip has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (6 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • source.zip (cognitive 32) REDACTED:467 — source.zip has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (6 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • source.zip (cognitive 32) php/b374k/source/b374k-2.8.source.php:528 — source.zip has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (6 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · eanver.eanver (cognitive 16) · ×3
  • eanver.eanver (cognitive 16) REDACTED:2197 — eanver.eanver has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • eanver.eanver (cognitive 16) www-7jyewu-cn/免杀php大马.php:2197 — eanver.eanver has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • eanver.eanver (cognitive 16) www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2197 — eanver.eanver has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×3
  • Edited copy of a member (12 corresponding lines) REDACTED:603 — REDACTED:603-614 | REDACTED:603-614 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (12 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1512 — b4tm4n-toolz/database/adminer-4.5.0.php:1512-1523 | php/twitter/adminer-4.2.4.php:1414-1425 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (12 corresponding lines) REDACTED:364 — REDACTED:364-375 | REDACTED:378-391 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×3
  • Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:293 — REDACTED:293-319 | REDACTED:262-288 | REDACTED:257-283 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:369-395 | php/PHPshell/【r57】/r57.php:262-288 | REDACTED:286-312 | REDACTED:247-273 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
  • Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:323 — REDACTED:323-330 | REDACTED:292-299 | REDACTED:287-294 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:399-406 | php/PHPshell/【r57】/r57.php:292-299 | REDACTED:316-323 | REDACTED:277-284 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
  • Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:1213 — REDACTED:1213-1221 | REDACTED:1162-1170 | REDACTED:1006-1014 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1274-1282 | php/PHPshell/【r57】/r57.php:1011-1019 | REDACTED:1204-1212 | REDACTED:1036-1044 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×3
  • Edited copy of a member (7 corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:162 — b4tm4n-toolz/database/adminer-4.5.0.php:162-168 | php/twitter/adminer-4.2.4.php:153-159 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) REDACTED:127 — REDACTED:127-133 | php/b374k/source/b374k-2.8.source.php:134-143 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) REDACTED:110 — REDACTED:110-116 | REDACTED:976-988 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (32 lines × 3) · ×3
  • Duplicated block (32 lines × 3) REDACTED:841 — REDACTED:841-872 | REDACTED:841-872 | REDACTED:822-853 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (32 lines × 3) REDACTED:1298 — REDACTED:1298-1329 | www-7jyewu-cn/免杀php大马.php:1298-1329 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1298-1329 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (32 lines × 3) REDACTED:2237 — REDACTED:2237-2268 | www-7jyewu-cn/免杀php大马.php:2237-2268 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2237-2268 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×3
  • Duplicated block (23 lines × 2) REDACTED:492 — REDACTED:492-514 | REDACTED:492-514 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (23 lines × 2) REDACTED:529 — REDACTED:529-551 | REDACTED:552-574 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (23 lines × 2) REDACTED:579 — REDACTED:579-601 | REDACTED:584-606 — 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 `REDACTED:579` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×3
  • Duplicated block (15 lines × 2) REDACTED:153 — REDACTED:153-167 | REDACTED:131-145 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (15 lines × 2) REDACTED:850 — REDACTED:850-864 | REDACTED:542-556 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (15 lines × 2) REDACTED:640 — REDACTED:640-654 | REDACTED:640-654 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (13 lines × 4) · ×3
  • Duplicated block (13 lines × 4) REDACTED:1037 — REDACTED:1037-1049 | REDACTED:1039-1051 | REDACTED:1039-1051 | REDACTED:1026-1038 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1037` 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, `REDACTED:1037` calls `array`, `$x10` and `REDACTED:1034` 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 (13 lines × 4) REDACTED:1116 — REDACTED:1116-1128 | REDACTED:1052-1064 | REDACTED:1532-1544 | REDACTED:954-966 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1116` 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 × 4) REDACTED:838 — REDACTED:838-850 | REDACTED:594-606 | REDACTED:630-642 | REDACTED:579-591 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:838` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×3
  • Duplicated block (12 lines × 3) REDACTED:369 — REDACTED:369-380 | REDACTED:437-448 | REDACTED:365-376 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:369` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 3) REDACTED:147 — REDACTED:147-158 | REDACTED:147-158 | REDACTED:128-139 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 3) REDACTED:1239 — REDACTED:1239-1250 | www-7jyewu-cn/免杀php大马.php:1239-1250 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1239-1250 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×3
  • Duplicated block (12 lines × 2) REDACTED:560 — REDACTED:560-571 | php/b374k/source/b374k-2.8.source.php:626-637 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:560` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) REDACTED:383 — REDACTED:383-394 | php/b374k/source/b374k-2.8.source.php:444-455 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 2) REDACTED:466 — REDACTED:466-477 | REDACTED:488-499 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (8 lines × 12) · ×3
  • Duplicated block (8 lines × 12) REDACTED:511 — REDACTED:511-518 | REDACTED:519-526 | REDACTED:534-541 | REDACTED:542-549 | REDACTED:550-557 | REDACTED:558-565 | php/b374k/source/b374k-2.8.source.php:576-583 | php/b374k/source/b374k-2.8.source.php:584-591 | php/b374k/source/b374k-2.8.source.php:600-607 | php/b374k/source/b374k-2.8.source.php:608-615 | php/b374k/source/b374k-2.8.source.php:616-623 | php/b374k/source/b374k-2.8.source.php:624-631 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 12) REDACTED:676 — REDACTED:676-683 | php/wso/wso-4.1.3.php:704-711 | php/wso/wso-4.2.0.php:714-721 | php/wso/wso-4.2.1.php:714-721 | php/wso/wso-4.2.2.php:713-720 | php/wso/wso-4.2.3.php:717-724 | php/wso/wso-4.2.4.php:722-729 | php/wso/wso-4.2.5.php:728-735 | REDACTED:434-441 | REDACTED:922-929 | php/zxc/.v.php:731-738 | REDACTED:469-476 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:676` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 12) REDACTED:373 — REDACTED:373-380 | php/wso/wso-4.1.3.php:313-320 | php/wso/wso-4.2.0.php:313-320 | php/wso/wso-4.2.1.php:313-320 | php/wso/wso-4.2.2.php:312-319 | php/wso/wso-4.2.3.php:316-323 | php/wso/wso-4.2.4.php:321-328 | php/wso/wso-4.2.5.php:327-334 | REDACTED:375-382 | REDACTED:375-382 | php/zxc/.v.php:331-338 | REDACTED:362-369 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×3
  • Duplicated block (8 lines × 3) REDACTED:1254 — REDACTED:1254-1261 | www-7jyewu-cn/免杀php大马.php:1254-1261 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1254-1261 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 3) REDACTED:915 — REDACTED:915-922 | REDACTED:915-922 | REDACTED:896-903 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 3) REDACTED:137 — REDACTED:137-144 | REDACTED:137-144 | REDACTED:118-125 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (7 lines × 10) · ×3
  • Duplicated block (7 lines × 10) REDACTED:262 — REDACTED:262-268 | REDACTED:206-212 | REDACTED:238-244 | REDACTED:242-248 | REDACTED:280-286 | REDACTED:316-322 | php/b374k/source/b374k-2.8.source.php:377-383 | REDACTED:489-495 | REDACTED:511-517 | REDACTED:258-264 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:262` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 10) REDACTED:832 — REDACTED:832-838 | REDACTED:427-433 | php/wso/wso-4.1.3.php:458-464 | REDACTED:727-733 | REDACTED:834-840 | REDACTED:1275-1281 | REDACTED:834-840 | REDACTED:776-782 | REDACTED:821-827 | REDACTED:675-681 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:776` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:783` calls `array` and `REDACTED:838` 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 (7 lines × 10) REDACTED:690 — REDACTED:690-696 | php/wso/wso-4.1.3.php:939-945 | php/wso/wso-4.2.0.php:936-942 | php/wso/wso-4.2.1.php:931-937 | php/wso/wso-4.2.2.php:930-936 | php/wso/wso-4.2.3.php:934-940 | REDACTED:692-698 | REDACTED:1131-1137 | REDACTED:692-698 | REDACTED:679-685 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (6 lines × 4) · ×3
  • Duplicated block (6 lines × 4) REDACTED:521 — REDACTED:521-528 | REDACTED:526-533 | REDACTED:579-586 | REDACTED:639-644 — 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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:521` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:521` calls `posix_getpwuid`, `fileowner` and `REDACTED:639` 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 × 4) REDACTED:2004 — REDACTED:2004-2009 | php/angel大马.php:2004-2009 | REDACTED:2002-2007 | REDACTED:1999-2004 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 4) REDACTED:136 — REDACTED:136-141 | REDACTED:197-202 | REDACTED:206-211 | REDACTED:208-213 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:136` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (5 lines × 5) · ×3
  • Duplicated block (5 lines × 5) REDACTED:836 — REDACTED:836-840 | php/wso/wso-4.2.0.php:912-916 | REDACTED:592-596 | REDACTED:628-632 | REDACTED:577-581 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 835 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:836` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:632` calls `cmp` and `REDACTED:581` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (5 lines × 5) REDACTED:1759 — REDACTED:1759-1763 | php/angel大马.php:1759-1763 | REDACTED:1759-1763 | php/phpspy/2013未加密.php:1195-1199 | REDACTED:1756-1760 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (5 lines × 5) REDACTED:1608 — REDACTED:1608-1612 | php/angel大马.php:1608-1612 | REDACTED:1608-1612 | php/phpspy/2013未加密.php:1121-1125 | REDACTED:1605-1609 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D6 · Cohesion (LCOM4) · Low cohesion · ×3
  • Low cohesion: Adminer (LCOM4 25) b4tm4n-toolz/database/adminer-4.5.0.php:1410 — Adminer's methods fall into 25 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Adminer (LCOM4 21) REDACTED:1122 — Adminer's methods fall into 21 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Adminer (LCOM4 21) php/twitter/adminer-4.2.4.php:1316 — Adminer's methods fall into 21 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
D1 · Cyclomatic Complexity · 3.actionSql (cyclomatic 53) · ×2
  • 3.actionSql (cyclomatic 53) php/wso/wso-4.1.3.php:1229 — 3.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • 3.actionSql (cyclomatic 53) php/wso/wso-4.2.3.php:1225 — 3.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1.actionSql (cyclomatic 53) · ×2
  • 1.actionSql (cyclomatic 53) php/wso/wso-4.2.1.php:1222 — 1.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • 1.actionSql (cyclomatic 53) REDACTED:1122 — 1.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.rs (cyclomatic 34) · ×2
  • source.rs (cyclomatic 34) REDACTED:156 — source.rs has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • source.rs (cyclomatic 34) REDACTED:183 — source.rs has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Adminer.navigation (cyclomatic 31) · ×2
  • Adminer.navigation (cyclomatic 31) b4tm4n-toolz/database/adminer-4.5.0.php:1512 — Adminer.navigation has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Adminer.navigation (cyclomatic 31) php/twitter/adminer-4.2.4.php:1414 — Adminer.navigation has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · source.showdir (cyclomatic 25) · ×2
  • source.showdir (cyclomatic 25) REDACTED:599 — source.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • source.showdir (cyclomatic 25) php/b374k/source/b374k-2.8.source.php:640 — source.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · r57.perms (cyclomatic 24) · ×2
  • r57.perms (cyclomatic 24) php/PHPshell/【r57】/r57.php:1056 — r57.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • r57.perms (cyclomatic 24) REDACTED:1054 — r57.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Adminer.dumpData (cyclomatic 23) · ×2
  • Adminer.dumpData (cyclomatic 23) b4tm4n-toolz/database/adminer-4.5.0.php:1502 — Adminer.dumpData 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.
  • Adminer.dumpData (cyclomatic 23) php/twitter/adminer-4.2.4.php:1405 — Adminer.dumpData has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 2011.getPerms (cyclomatic 23) · ×2
  • 2011.getPerms (cyclomatic 23) REDACTED:1771 — 2011.getPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • 2011.getPerms (cyclomatic 23) REDACTED:1771 — 2011.getPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 3.perms (cyclomatic 23) · ×2
  • 3.perms (cyclomatic 23) php/wso/wso-4.1.3.php:284 — 3.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • 3.perms (cyclomatic 23) php/wso/wso-4.2.3.php:287 — 3.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · source.sql_field_name (cyclomatic 20) · ×2
  • source.sql_field_name (cyclomatic 20) REDACTED:725 — source.sql_field_name 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.
  • source.sql_field_name (cyclomatic 20) REDACTED:802 — source.sql_field_name has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.sql_query (cyclomatic 19) · ×2
  • source.sql_query (cyclomatic 19) REDACTED:693 — source.sql_query 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.
  • source.sql_query (cyclomatic 19) REDACTED:770 — source.sql_query has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.sql_num_rows (cyclomatic 19) · ×2
  • source.sql_num_rows (cyclomatic 19) REDACTED:762 — source.sql_num_rows 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.
  • source.sql_num_rows (cyclomatic 19) REDACTED:839 — source.sql_num_rows has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.hardHeader (cyclomatic 19) · ×2
  • 3.hardHeader (cyclomatic 19) php/wso/wso-4.1.3.php:59 — 3.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • 3.hardHeader (cyclomatic 19) php/wso/wso-4.2.3.php:72 — 3.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · source.sql_num_fields (cyclomatic 18) · ×2
  • source.sql_num_fields (cyclomatic 18) REDACTED:712 — source.sql_num_fields has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (source.sql_fetch_data, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • source.sql_num_fields (cyclomatic 18) REDACTED:789 — source.sql_num_fields has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (source.sql_fetch_data, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · source.sql_fetch_data (cyclomatic 18) · ×2
  • source.sql_fetch_data (cyclomatic 18) REDACTED:749 — source.sql_fetch_data has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • source.sql_fetch_data (cyclomatic 18) REDACTED:826 — source.sql_fetch_data has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · source.sql_close (cyclomatic 18) · ×2
  • source.sql_close (cyclomatic 18) REDACTED:780 — source.sql_close has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_fetch_data) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • source.sql_close (cyclomatic 18) REDACTED:857 — source.sql_close has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_fetch_data) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · 3.actionSecInfo (cyclomatic 18) · ×2
  • 3.actionSecInfo (cyclomatic 18) php/wso/wso-4.1.3.php:345 — 3.actionSecInfo 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.
  • 3.actionSecInfo (cyclomatic 18) php/wso/wso-4.2.3.php:348 — 3.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2011.multi (cyclomatic 17) · ×2
  • 2011.multi (cyclomatic 17) REDACTED:1614 — 2011.multi 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.
  • 2011.multi (cyclomatic 17) REDACTED:1614 — 2011.multi has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2011.GetSFileList (cyclomatic 17) · ×2
  • 2011.GetSFileList (cyclomatic 17) REDACTED:1939 — 2011.GetSFileList 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.
  • 2011.GetSFileList (cyclomatic 17) REDACTED:1939 — 2011.GetSFileList has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.actionStringTools (cyclomatic 17) · ×2
  • 3.actionStringTools (cyclomatic 17) php/wso/wso-4.1.3.php:951 — 3.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • 3.actionStringTools (cyclomatic 17) php/wso/wso-4.2.3.php:946 — 3.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 1.actionStringTools (cyclomatic 17) · ×2
  • 1.actionStringTools (cyclomatic 17) php/wso/wso-4.2.1.php:943 — 1.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • 1.actionStringTools (cyclomatic 17) REDACTED:705 — 1.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 5.actionStringTools (cyclomatic 17) · ×2
  • 5.actionStringTools (cyclomatic 17) php/wso/wso-4.2.5.php:958 — 5.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • 5.actionStringTools (cyclomatic 17) REDACTED:692 — 5.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 3.actionBruteforce (cyclomatic 16) · ×2
  • 3.actionBruteforce (cyclomatic 16) php/wso/wso-4.1.3.php:1145 — 3.actionBruteforce 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.
  • 3.actionBruteforce (cyclomatic 16) php/wso/wso-4.2.3.php:1141 — 3.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1.actionBruteforce (cyclomatic 16) · ×2
  • 1.actionBruteforce (cyclomatic 16) php/wso/wso-4.2.1.php:1138 — 1.actionBruteforce 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.
  • 1.actionBruteforce (cyclomatic 16) REDACTED:1038 — 1.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionBruteforce (cyclomatic 16) · ×2
  • 5.actionBruteforce (cyclomatic 16) php/wso/wso-4.2.5.php:1152 — 5.actionBruteforce 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.
  • 5.actionBruteforce (cyclomatic 16) REDACTED:1025 — 5.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionBruteforce (cyclomatic 16) · ×2
  • wso2.actionBruteforce (cyclomatic 16) REDACTED:1038 — wso2.actionBruteforce 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.
  • wso2.actionBruteforce (cyclomatic 16) REDACTED:947 — wso2.actionBruteforce 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.
D2 · Cognitive Complexity · 3.actionSql (cognitive 129) · ×2
  • 3.actionSql (cognitive 129) php/wso/wso-4.1.3.php:1229 — 3.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • 3.actionSql (cognitive 129) php/wso/wso-4.2.3.php:1225 — 3.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 1.actionSql (cognitive 129) · ×2
  • 1.actionSql (cognitive 129) php/wso/wso-4.2.1.php:1222 — 1.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • 1.actionSql (cognitive 129) REDACTED:1122 — 1.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Adminer.navigation (cognitive 95) · ×2
  • Adminer.navigation (cognitive 95) b4tm4n-toolz/database/adminer-4.5.0.php:1512 — Adminer.navigation has cognitive complexity 95 (threshold 15). Drivers by points: ternaries 8 (35 pts), if/else 12 (31 pts), loops 6 (23 pts), boolean chains 6 (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • Adminer.navigation (cognitive 95) php/twitter/adminer-4.2.4.php:1414 — Adminer.navigation has cognitive complexity 95 (threshold 15). Drivers by points: ternaries 8 (35 pts), if/else 12 (31 pts), loops 6 (23 pts), boolean chains 6 (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Adminer.dumpData (cognitive 76) · ×2
  • Adminer.dumpData (cognitive 76) b4tm4n-toolz/database/adminer-4.5.0.php:1502 — Adminer.dumpData has cognitive complexity 76 (threshold 15). Drivers by points: if/else 12 (36 pts), ternaries 6 (26 pts), loops 3 (13 pts), boolean chains 1 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • Adminer.dumpData (cognitive 76) php/twitter/adminer-4.2.4.php:1405 — Adminer.dumpData has cognitive complexity 76 (threshold 15). Drivers by points: if/else 12 (36 pts), ternaries 6 (26 pts), loops 3 (13 pts), boolean chains 1 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · source.rs (cognitive 61) · ×2
  • source.rs (cognitive 61) REDACTED:156 — source.rs has cognitive complexity 61 (threshold 15). Drivers by points: if/else 33 (58 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.rs (cognitive 61) REDACTED:183 — source.rs has cognitive complexity 61 (threshold 15). Drivers by points: if/else 33 (58 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · r57.perms (cognitive 54) · ×2
  • r57.perms (cognitive 54) php/PHPshell/【r57】/r57.php:1056 — r57.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • r57.perms (cognitive 54) REDACTED:1054 — r57.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.actionBruteforce (cognitive 46) · ×2
  • 3.actionBruteforce (cognitive 46) php/wso/wso-4.1.3.php:1145 — 3.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • 3.actionBruteforce (cognitive 46) php/wso/wso-4.2.3.php:1141 — 3.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 1.actionBruteforce (cognitive 46) · ×2
  • 1.actionBruteforce (cognitive 46) php/wso/wso-4.2.1.php:1138 — 1.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • 1.actionBruteforce (cognitive 46) REDACTED:1038 — 1.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 5.actionBruteforce (cognitive 46) · ×2
  • 5.actionBruteforce (cognitive 46) php/wso/wso-4.2.5.php:1152 — 5.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • 5.actionBruteforce (cognitive 46) REDACTED:1025 — 5.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso2.actionBruteforce (cognitive 46) · ×2
  • wso2.actionBruteforce (cognitive 46) REDACTED:1038 — wso2.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • wso2.actionBruteforce (cognitive 46) REDACTED:947 — wso2.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · source.showdir (cognitive 36) · ×2
  • source.showdir (cognitive 36) REDACTED:599 — source.showdir has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (5 pts), boolean chains 4, ternaries 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.showdir (cognitive 36) php/b374k/source/b374k-2.8.source.php:640 — source.showdir has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (5 pts), boolean chains 4, ternaries 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.actionSecInfo (cognitive 36) · ×2
  • 3.actionSecInfo (cognitive 36) php/wso/wso-4.1.3.php:345 — 3.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 3.actionSecInfo (cognitive 36) php/wso/wso-4.2.3.php:348 — 3.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 2011.GetSFileList (cognitive 34) · ×2
  • 2011.GetSFileList (cognitive 34) REDACTED:1939 — 2011.GetSFileList has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • 2011.GetSFileList (cognitive 34) REDACTED:1939 — 2011.GetSFileList has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 2011.multi (cognitive 33) · ×2
  • 2011.multi (cognitive 33) REDACTED:1614 — 2011.multi has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 6 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • 2011.multi (cognitive 33) REDACTED:1614 — 2011.multi has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 6 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 3.hardHeader (cognitive 25) · ×2
  • 3.hardHeader (cognitive 25) php/wso/wso-4.1.3.php:59 — 3.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). 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.
  • 3.hardHeader (cognitive 25) php/wso/wso-4.2.3.php:72 — 3.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Adminer.dumpTable (cognitive 24) · ×2
  • Adminer.dumpTable (cognitive 24) b4tm4n-toolz/database/adminer-4.5.0.php:1501 — Adminer.dumpTable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • Adminer.dumpTable (cognitive 24) php/twitter/adminer-4.2.4.php:1404 — Adminer.dumpTable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 2011.makeselect (cognitive 24) · ×2
  • 2011.makeselect (cognitive 24) REDACTED:2070 — 2011.makeselect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (6 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 2011.makeselect (cognitive 24) REDACTED:2067 — 2011.makeselect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (6 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · r57.DirFilesR (cognitive 24) · ×2
  • r57.DirFilesR (cognitive 24) php/PHPshell/【r57】/r57.php:1174 — r57.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • r57.DirFilesR (cognitive 24) REDACTED:1120 — r57.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · source.sql_field_name (cognitive 23) · ×2
  • source.sql_field_name (cognitive 23) REDACTED:725 — source.sql_field_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (23 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.sql_field_name (cognitive 23) REDACTED:802 — source.sql_field_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (23 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Adminer.editFunctions (cognitive 22) · ×2
  • Adminer.editFunctions (cognitive 22) b4tm4n-toolz/database/adminer-4.5.0.php:1489 — Adminer.editFunctions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Adminer.editFunctions (cognitive 22) php/twitter/adminer-4.2.4.php:1393 — Adminer.editFunctions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.dlfile (cognitive 21) · ×2
  • source.dlfile (cognitive 21) REDACTED:420 — source.dlfile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.dlfile (cognitive 21) php/b374k/source/b374k-2.8.source.php:481 — source.dlfile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 2011.getPerms (cognitive 20) · ×2
  • 2011.getPerms (cognitive 20) REDACTED:1771 — 2011.getPerms has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (15 pts), if/else 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
  • 2011.getPerms (cognitive 20) REDACTED:1771 — 2011.getPerms has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (15 pts), if/else 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · source.sql_num_rows (cognitive 20) · ×2
  • source.sql_num_rows (cognitive 20) REDACTED:762 — source.sql_num_rows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.sql_num_rows (cognitive 20) REDACTED:839 — source.sql_num_rows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Min_SQL.select (cognitive 19) · ×2
  • Min_SQL.select (cognitive 19) b4tm4n-toolz/database/adminer-4.5.0.php:199 — Min_SQL.select has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 5, if/else 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Min_SQL.select (cognitive 19) php/twitter/adminer-4.2.4.php:190 — Min_SQL.select has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 5, if/else 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.actionSafeMode (cognitive 19) · ×2
  • 3.actionSafeMode (cognitive 19) php/wso/wso-4.1.3.php:1039 — 3.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 3.actionSafeMode (cognitive 19) php/wso/wso-4.2.3.php:1035 — 3.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.sql_query (cognitive 18) · ×2
  • source.sql_query (cognitive 18) REDACTED:693 — source.sql_query has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • source.sql_query (cognitive 18) REDACTED:770 — source.sql_query has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.actionStringTools (cognitive 18) · ×2
  • 3.actionStringTools (cognitive 18) php/wso/wso-4.1.3.php:951 — 3.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
  • 3.actionStringTools (cognitive 18) php/wso/wso-4.2.3.php:946 — 3.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · 1.actionStringTools (cognitive 18) · ×2
  • 1.actionStringTools (cognitive 18) php/wso/wso-4.2.1.php:943 — 1.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
  • 1.actionStringTools (cognitive 18) REDACTED:705 — 1.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · 5.actionStringTools (cognitive 18) · ×2
  • 5.actionStringTools (cognitive 18) php/wso/wso-4.2.5.php:958 — 5.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
  • 5.actionStringTools (cognitive 18) REDACTED:692 — 5.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · 2011.GetWFileList (cognitive 17) · ×2
  • 2011.GetWFileList (cognitive 17) REDACTED:1908 — 2011.GetWFileList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 2011.GetWFileList (cognitive 17) REDACTED:1908 — 2011.GetWFileList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Ani-Shell.Zip (cognitive 17) · ×2
  • Ani-Shell.Zip (cognitive 17) REDACTED:34 — Ani-Shell.Zip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Ani-Shell.Zip (cognitive 17) REDACTED:34 — Ani-Shell.Zip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.get_writabledir (cognitive 17) · ×2
  • source.get_writabledir (cognitive 17) REDACTED:374 — source.get_writabledir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (17 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • source.get_writabledir (cognitive 17) REDACTED:417 — source.get_writabledir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (17 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · source.sql_num_fields (cognitive 17) · ×2
  • source.sql_num_fields (cognitive 17) REDACTED:712 — source.sql_num_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (source.sql_fetch_data, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • source.sql_num_fields (cognitive 17) REDACTED:789 — source.sql_num_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (source.sql_fetch_data, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · source.sql_fetch_data (cognitive 17) · ×2
  • source.sql_fetch_data (cognitive 17) REDACTED:749 — source.sql_fetch_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • source.sql_fetch_data (cognitive 17) REDACTED:826 — source.sql_fetch_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · source.sql_close (cognitive 17) · ×2
  • source.sql_close (cognitive 17) REDACTED:780 — source.sql_close has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_fetch_data) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • source.sql_close (cognitive 17) REDACTED:857 — source.sql_close has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (source.sql_num_fields, source.sql_fetch_data) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · 3.perms (cognitive 17) · ×2
  • 3.perms (cognitive 17) php/wso/wso-4.1.3.php:284 — 3.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. 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.
  • 3.perms (cognitive 17) php/wso/wso-4.2.3.php:287 — 3.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 3.actionConsole (cognitive 17) · ×2
  • 3.actionConsole (cognitive 17) php/wso/wso-4.1.3.php:633 — 3.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 3.actionConsole (cognitive 17) php/wso/wso-4.2.3.php:646 — 3.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1.actionConsole (cognitive 17) · ×2
  • 1.actionConsole (cognitive 17) php/wso/wso-4.2.1.php:643 — 1.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 1.actionConsole (cognitive 17) REDACTED:948 — 1.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.actionConsole (cognitive 17) · ×2
  • 5.actionConsole (cognitive 17) php/wso/wso-4.2.5.php:657 — 5.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 5.actionConsole (cognitive 17) REDACTED:935 — 5.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.get_writabledir (cognitive 16) · ×2
  • source.get_writabledir (cognitive 16) REDACTED:459 — source.get_writabledir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • source.get_writabledir (cognitive 16) php/b374k/source/b374k-2.8.source.php:520 — source.get_writabledir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · PHPZip.GetFileList (cognitive 16) · ×2
  • PHPZip.GetFileList (cognitive 16) REDACTED:1010 — PHPZip.GetFileList has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • PHPZip.GetFileList (cognitive 16) REDACTED:534 — PHPZip.GetFileList has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (13 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (13 members, 50+ identical tokens) REDACTED:217 — REDACTED:217-227 | REDACTED:186-196 | REDACTED:181-191 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:293-303 | php/PHPshell/【r57】/r57.php:186-196 | REDACTED:210-220 | REDACTED:171-181 | REDACTED:1477-1489 | REDACTED:2218-2228 | www-7jyewu-cn/免杀php大马.php:1477-1489 | www-7jyewu-cn/免杀php大马.php:2218-2228 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1477-1489 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2218-2228 — These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times.
  • Members sharing a duplicated core (13 members, 50+ identical tokens) REDACTED:231 — REDACTED:231-274 | REDACTED:200-243 | REDACTED:195-238 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:307-350 | php/PHPshell/【r57】/r57.php:200-243 | REDACTED:1047-1101 | REDACTED:224-267 | REDACTED:571-625 | REDACTED:185-228 | REDACTED:1511-1571 | REDACTED:2231-2278 | www-7jyewu-cn/免杀php大马.php:2231-2278 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2231-2278 — These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times.
D4 · Code Duplication · Members sharing a duplicated core (11 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (11 members, 50+ identical tokens) REDACTED:1176 — REDACTED:1176-1209 | REDACTED:147-180 | REDACTED:1125-1158 | REDACTED:969-1002 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1237-1270 | php/PHPshell/【r57_iFX】/r57_iFX.php:772-805 | php/PHPshell/【r57_karta】/r57_kartal.php:743-776 | php/PHPshell/【r57】/r57.php:974-1007 | REDACTED:1167-1200 | REDACTED:450-450 | REDACTED:999-1032 — These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times.
  • Members sharing a duplicated core (11 members, 50+ identical tokens) REDACTED:283 — REDACTED:283-288 | php/wso/wso-4.1.3.php:305-310 | php/wso/wso-4.2.0.php:305-310 | php/wso/wso-4.2.1.php:305-310 | php/wso/wso-4.2.2.php:304-309 | php/wso/wso-4.2.3.php:308-313 | php/wso/wso-4.2.4.php:313-318 | php/wso/wso-4.2.5.php:319-324 | REDACTED:344-349 | php/zxc/.v.php:323-328 | REDACTED:374-379 — These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times.
D4 · Code Duplication · Edited copies of one member (3 members, 8+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 8+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1615 — b4tm4n-toolz/database/adminer-4.5.0.php:1615-1622 | REDACTED:1329-1341 | php/twitter/adminer-4.2.4.php:1506-1518 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 8+ corresponding lines) REDACTED:526 — REDACTED:526-534 | REDACTED:537-545 | REDACTED:566-573 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 4+ corresponding lines) · ×2
  • Edited copies of one member (6 members, 4+ corresponding lines) REDACTED:188 — REDACTED:188-195 | REDACTED:208-211 | REDACTED:212-215 | REDACTED:250-253 | REDACTED:286-289 | php/b374k/source/b374k-2.8.source.php:347-350 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
  • Edited copies of one member (6 members, 4+ corresponding lines) REDACTED:1238 — REDACTED:1238-1241 | REDACTED:1082-1085 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1350-1353 | php/PHPshell/【r57_iFX】/r57_iFX.php:859-862 | php/PHPshell/【r57_karta】/r57_kartal.php:830-833 | php/PHPshell/【r57】/r57.php:1087-1090 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 1+ corresponding lines) · ×2
  • Edited copies of one member (4 members, 1+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:56 — b4tm4n-toolz/database/adminer-4.5.0.php:56-56 | REDACTED:265-265 | REDACTED:266-266 | php/twitter/adminer-4.2.4.php:51-51 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 1+ corresponding lines) REDACTED:484 — REDACTED:484-494 | REDACTED:1393-1393 | www-7jyewu-cn/免杀php大马.php:1393-1393 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1393-1393 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (27 lines × 4) · ×2
  • Duplicated block (27 lines × 4) REDACTED:2071 — REDACTED:2071-2097 | php/angel大马.php:2071-2097 | REDACTED:2068-2094 | REDACTED:2065-2091 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (27 lines × 4) REDACTED:1075 — REDACTED:1075-1101 | REDACTED:1077-1103 | REDACTED:1077-1103 | REDACTED:1064-1090 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1075` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (27 lines × 2) · ×2
  • Duplicated block (27 lines × 2) REDACTED:272 — REDACTED:272-298 | REDACTED:268-294 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (27 lines × 2) REDACTED:276 — REDACTED:276-302 | REDACTED:254-280 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (26 lines × 4) · ×2
  • Duplicated block (26 lines × 4) REDACTED:1615 — REDACTED:1615-1640 | php/angel大马.php:1615-1640 | REDACTED:1615-1640 | REDACTED:1612-1637 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1615` 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 (26 lines × 4) REDACTED:443 — REDACTED:443-468 | REDACTED:445-470 | REDACTED:445-470 | REDACTED:432-457 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:443` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×2
  • Duplicated block (25 lines × 2) REDACTED:121 — REDACTED:121-145 | REDACTED:104-128 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (25 lines × 2) REDACTED:600 — REDACTED:600-624 | php/b374k/source/b374k-2.8.source.php:641-665 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (24 lines × 4) · ×2
  • Duplicated block (24 lines × 4) REDACTED:1118 — REDACTED:1118-1141 | php/PHPshell/【r57_iFX】/r57_iFX.php:895-918 | php/PHPshell/【r57_karta】/r57_kartal.php:866-889 | php/PHPshell/【r57】/r57.php:1123-1146 — before extracting anything, compare `REDACTED` and `php/PHPshell/【r57_iFX】/r57_iFX.php` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (24 lines × 4) REDACTED:1882 — REDACTED:1882-1905 | php/angel大马.php:1882-1905 | REDACTED:1882-1905 | REDACTED:1879-1902 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (24 lines × 3) · ×2
  • Duplicated block (24 lines × 3) REDACTED:1359 — REDACTED:1359-1382 | www-7jyewu-cn/免杀php大马.php:1359-1382 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1359-1382 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (24 lines × 3) REDACTED:324 — REDACTED:324-347 | REDACTED:348-371 | REDACTED:309-332 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 460 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:324` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×2
  • Duplicated block (24 lines × 2) REDACTED:229 — REDACTED:229-252 | REDACTED:207-230 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (24 lines × 2) REDACTED:355 — REDACTED:355-378 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:431-454 — before extracting anything, compare `REDACTED` and `php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 460 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:355` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×2
  • Duplicated block (21 lines × 2) REDACTED:191 — REDACTED:191-211 | REDACTED:169-189 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `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 (21 lines × 2) REDACTED:343 — REDACTED:343-363 | REDACTED:403-423 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:343` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (20 lines × 3) · ×2
  • Duplicated block (20 lines × 3) REDACTED:210 — REDACTED:210-229 | REDACTED:210-229 | REDACTED:191-210 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:191` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (20 lines × 3) REDACTED:425 — REDACTED:425-444 | REDACTED:469-488 | REDACTED:473-492 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:425` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:488` calls `closedir` and `REDACTED:444` 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.
D4 · Code Duplication · Duplicated block (19 lines × 13) · ×2
  • Duplicated block (19 lines × 13) REDACTED:843 — REDACTED:843-861 | php/wso/wso-4.1.3.php:469-487 | php/wso/wso-4.2.0.php:469-487 | php/wso/wso-4.2.1.php:469-487 | php/wso/wso-4.2.2.php:468-486 | php/wso/wso-4.2.3.php:472-490 | php/wso/wso-4.2.4.php:477-495 | php/wso/wso-4.2.5.php:483-501 | REDACTED:845-863 | REDACTED:1286-1304 | REDACTED:845-863 | php/zxc/.v.php:487-505 | REDACTED:832-850 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:843` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (19 lines × 13) REDACTED:1147 — REDACTED:1147-1165 | php/wso/wso-4.1.3.php:1184-1202 | php/wso/wso-4.2.0.php:1181-1199 | php/wso/wso-4.2.1.php:1177-1195 | php/wso/wso-4.2.2.php:1176-1194 | php/wso/wso-4.2.3.php:1180-1198 | php/wso/wso-4.2.4.php:1185-1203 | php/wso/wso-4.2.5.php:1191-1209 | REDACTED:1083-1101 | REDACTED:1563-1581 | php/zxc/.v.php:1191-1209 | REDACTED:1081-1099 | REDACTED:985-1003 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1147` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2
  • Duplicated block (18 lines × 2) REDACTED:75 — REDACTED:75-92 | REDACTED:58-75 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (18 lines × 2) REDACTED:171 — REDACTED:171-188 | REDACTED:149-166 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 214 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×2
  • Duplicated block (22 lines × 2) REDACTED:1036 — REDACTED:1036-1057 | REDACTED:976-997 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1036` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (22 lines × 2) php/phpkit-1.0/phpkitcli.py:40 — php/phpkit-0.2a/phpkit.py:39-60 | php/phpkit-1.0/phpkitcli.py:40-61 — 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.
D4 · Code Duplication · Duplicated block (17 lines × 13) · ×2
  • Duplicated block (17 lines × 13) REDACTED:869 — REDACTED:869-885 | php/wso/wso-4.1.3.php:495-511 | php/wso/wso-4.2.0.php:495-511 | php/wso/wso-4.2.1.php:495-511 | php/wso/wso-4.2.2.php:494-510 | php/wso/wso-4.2.3.php:498-514 | php/wso/wso-4.2.4.php:503-519 | php/wso/wso-4.2.5.php:509-525 | REDACTED:871-887 | REDACTED:1312-1328 | REDACTED:871-887 | php/zxc/.v.php:513-529 | REDACTED:858-874 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (17 lines × 13) REDACTED:959 — REDACTED:959-975 | php/wso/wso-4.1.3.php:1041-1057 | php/wso/wso-4.2.0.php:1038-1054 | php/wso/wso-4.2.1.php:1034-1050 | php/wso/wso-4.2.2.php:1033-1049 | php/wso/wso-4.2.3.php:1037-1053 | php/wso/wso-4.2.4.php:1042-1058 | php/wso/wso-4.2.5.php:1048-1064 | REDACTED:839-855 | REDACTED:1391-1407 | php/zxc/.v.php:1045-1061 | REDACTED:899-915 | REDACTED:821-837 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:959` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (17 lines × 3) · ×2
  • Duplicated block (17 lines × 3) REDACTED:1179 — REDACTED:1179-1195 | REDACTED:1179-1195 | REDACTED:1160-1176 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (17 lines × 3) REDACTED:1123 — REDACTED:1123-1139 | REDACTED:1059-1075 | REDACTED:961-977 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1123` 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.
D4 · Code Duplication · Duplicated block (22 lines × 3) · ×2
  • Duplicated block (22 lines × 3) REDACTED:2381 — REDACTED:2381-2402 | www-7jyewu-cn/免杀php大马.php:2381-2402 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2381-2402 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (22 lines × 3) REDACTED:693 — REDACTED:693-714 | REDACTED:726-747 | REDACTED:803-824 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (16 lines × 5) · ×2
  • Duplicated block (16 lines × 5) REDACTED:383 — REDACTED:383-398 | REDACTED:352-367 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:459-474 | REDACTED:376-391 | REDACTED:337-352 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (16 lines × 5) REDACTED:1777 — REDACTED:1777-1792 | php/angel大马.php:1777-1792 | REDACTED:1777-1792 | php/phpspy/2013未加密.php:1222-1237 | REDACTED:1774-1789 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1777` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (19 lines × 5) · ×2
  • Duplicated block (19 lines × 5) REDACTED:640 — REDACTED:640-658 | REDACTED:673-691 | REDACTED:750-768 | REDACTED:764-782 | php/b374k/source/b374k-2.8.source.php:758-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 all 5 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `php/b374k/source/b374k-2.8.source.php:756` calls `elseif`, `function_exists`, `mssql_connect` and `REDACTED:762` 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 (19 lines × 5) REDACTED:278 — REDACTED:278-296 | REDACTED:280-298 | REDACTED:283-304 | REDACTED:280-298 | REDACTED:270-288 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:278` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2
  • Duplicated block (16 lines × 2) REDACTED:583 — REDACTED:583-598 | REDACTED:804-819 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) REDACTED:201 — REDACTED:201-216 | REDACTED:262-277 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×2
  • Duplicated block (13 lines × 3) REDACTED:405 — REDACTED:405-417 | REDACTED:409-421 | REDACTED: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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:405` 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 (13 lines × 3) REDACTED:910 — REDACTED:910-922 | REDACTED:602-614 | REDACTED:439-451 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (12 lines × 11) · ×2
  • Duplicated block (12 lines × 11) REDACTED:958 — REDACTED:958-969 | php/wso/wso-4.1.3.php:644-655 | php/wso/wso-4.2.1.php:654-665 | php/wso/wso-4.2.2.php:653-664 | php/wso/wso-4.2.3.php:657-668 | php/wso/wso-4.2.4.php:662-673 | php/wso/wso-4.2.5.php:668-679 | REDACTED:960-971 | REDACTED:960-971 | php/zxc/.v.php:672-683 | REDACTED:947-958 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:958` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 11) REDACTED:1315 — REDACTED:1315-1326 | php/wso/wso-4.1.3.php:1424-1435 | php/wso/wso-4.2.1.php:1417-1428 | php/wso/wso-4.2.2.php:1416-1427 | php/wso/wso-4.2.3.php:1420-1431 | php/wso/wso-4.2.4.php:1425-1436 | php/wso/wso-4.2.5.php:1431-1442 | REDACTED:1317-1328 | REDACTED:1317-1328 | php/zxc/.v.php:1431-1442 | REDACTED:1310-1321 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1315` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1327` calls `empty`, `htmlspecialchars` and `php/wso/wso-4.1.3.php:1436` 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.
D4 · Code Duplication · Duplicated block (12 lines × 8) · ×2
  • Duplicated block (12 lines × 8) php/wso/wso-4.1.3.php:194 — php/wso/wso-4.1.3.php:194-205 | php/wso/wso-4.2.0.php:209-220 | php/wso/wso-4.2.1.php:209-220 | php/wso/wso-4.2.2.php:208-219 | php/wso/wso-4.2.3.php:212-223 | php/wso/wso-4.2.4.php:217-228 | php/wso/wso-4.2.5.php:220-231 | php/zxc/.v.php:224-235 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 8) php/wso/wso-4.1.3.php:1153 — php/wso/wso-4.1.3.php:1153-1164 | php/wso/wso-4.2.0.php:1150-1161 | php/wso/wso-4.2.1.php:1146-1157 | php/wso/wso-4.2.2.php:1145-1156 | php/wso/wso-4.2.3.php:1149-1160 | php/wso/wso-4.2.4.php:1154-1165 | php/wso/wso-4.2.5.php:1160-1171 | php/zxc/.v.php:1160-1171 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:1153` 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.
D4 · Code Duplication · Duplicated block (12 lines × 6) · ×2
  • Duplicated block (12 lines × 6) REDACTED:614 — REDACTED:614-625 | php/wso/wso-4.2.0.php:654-665 | REDACTED:895-906 | REDACTED:1446-1457 | REDACTED:962-973 | REDACTED:876-887 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 835 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:614` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:907` calls `printHeader` and `REDACTED:888` 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 (12 lines × 6) REDACTED:745 — REDACTED:745-756 | php/wso/wso-4.2.0.php:792-803 | REDACTED:501-512 | REDACTED:987-998 | REDACTED:538-549 | REDACTED:486-497 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 835 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:745` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11 lines × 8) · ×2
  • Duplicated block (11 lines × 8) php/wso/wso-4.1.3.php:985 — php/wso/wso-4.1.3.php:985-995 | php/wso/wso-4.2.0.php:981-991 | php/wso/wso-4.2.1.php:977-987 | php/wso/wso-4.2.2.php:976-986 | php/wso/wso-4.2.3.php:980-990 | php/wso/wso-4.2.4.php:986-996 | php/wso/wso-4.2.5.php:992-1002 | php/zxc/.v.php:994-1004 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:985` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 8) REDACTED:755 — REDACTED:755-765 | REDACTED:770-780 | REDACTED:511-521 | REDACTED:526-536 | REDACTED:548-558 | REDACTED:563-573 | REDACTED:496-506 | REDACTED:511-521 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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.
D4 · Code Duplication · Duplicated block (11 lines × 6) · ×2
  • Duplicated block (11 lines × 6) REDACTED:212 — REDACTED:212-222 | REDACTED:166-176 | REDACTED:186-196 | REDACTED:190-200 | REDACTED:207-217 | REDACTED:208-218 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:212` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (11 lines × 6) REDACTED:701 — REDACTED:701-711 | REDACTED:721-731 | REDACTED:741-751 | REDACTED:761-771 | REDACTED:781-791 | REDACTED:795-807 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:701` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10–11 lines × 4) · ×2
  • Duplicated block (10–11 lines × 4) REDACTED:504 — REDACTED:504-514 | REDACTED:509-519 | REDACTED:562-572 | REDACTED:625-634 — 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 4 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:509` calls `explode` and `REDACTED:503` does not — after which the two agree again for 5 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 × 4) REDACTED:1463 — REDACTED:1463-1472 | REDACTED:1397-1406 | REDACTED:1407-1417 | REDACTED:1219-1228 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1463` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:1462` calls `htmlspecialchars` and `REDACTED:1218` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9 lines × 8) · ×2
  • Duplicated block (9 lines × 8) REDACTED:125 — REDACTED:125-133 | REDACTED:193-201 | REDACTED:147-155 | REDACTED:167-175 | REDACTED:171-179 | REDACTED:188-196 | REDACTED:121-129 | REDACTED:189-197 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:125` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:125` calls `elseif` and `REDACTED:193` 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 × 8) php/wso/wso-4.1.3.php:1096 — php/wso/wso-4.1.3.php:1096-1104 | php/wso/wso-4.2.0.php:1093-1101 | php/wso/wso-4.2.1.php:1089-1097 | php/wso/wso-4.2.2.php:1088-1096 | php/wso/wso-4.2.3.php:1092-1100 | php/wso/wso-4.2.4.php:1097-1105 | php/wso/wso-4.2.5.php:1103-1111 | php/zxc/.v.php:1103-1111 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8 lines × 17) · ×2
  • Duplicated block (8 lines × 17) REDACTED:1081 — REDACTED:1081-1088 | REDACTED:1153-1160 | php/wso/wso-4.1.3.php:1190-1197 | php/wso/wso-4.2.0.php:1187-1194 | php/wso/wso-4.2.1.php:1183-1190 | php/wso/wso-4.2.2.php:1182-1189 | php/wso/wso-4.2.3.php:1186-1193 | php/wso/wso-4.2.4.php:1191-1198 | php/wso/wso-4.2.5.php:1197-1204 | REDACTED:1089-1096 | REDACTED:1083-1090 | REDACTED:1569-1576 | REDACTED:1083-1090 | php/zxc/.v.php:1197-1204 | REDACTED:1087-1094 | REDACTED:1070-1077 | REDACTED:991-998 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1081` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (8 lines × 17) REDACTED:117 — REDACTED:117-124 | REDACTED:284-291 | REDACTED:253-260 | php/wso/wso-4.1.3.php:275-282 | php/wso/wso-4.2.0.php:275-282 | php/wso/wso-4.2.1.php:275-282 | php/wso/wso-4.2.2.php:274-281 | php/wso/wso-4.2.3.php:278-285 | php/wso/wso-4.2.4.php:283-290 | php/wso/wso-4.2.5.php:289-296 | REDACTED:314-321 | REDACTED:336-343 | php/zxc/.v.php:293-300 | REDACTED:128-135 | REDACTED:343-350 | REDACTED:321-328 | REDACTED:321-328 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (8 lines × 13) · ×2
  • Duplicated block (8 lines × 13) REDACTED:734 — REDACTED:734-741 | REDACTED:898-905 | php/wso/wso-4.1.3.php:982-989 | php/wso/wso-4.2.0.php:978-985 | php/wso/wso-4.2.1.php:974-981 | php/wso/wso-4.2.2.php:973-980 | php/wso/wso-4.2.3.php:977-984 | php/wso/wso-4.2.4.php:983-990 | php/wso/wso-4.2.5.php:989-996 | REDACTED:736-743 | REDACTED:736-743 | php/zxc/.v.php:991-998 | REDACTED:723-730 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:734` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 13) REDACTED:768 — REDACTED:768-775 | REDACTED:932-939 | php/wso/wso-4.1.3.php:1016-1023 | php/wso/wso-4.2.0.php:1012-1019 | php/wso/wso-4.2.1.php:1008-1015 | php/wso/wso-4.2.2.php:1007-1014 | php/wso/wso-4.2.3.php:1011-1018 | php/wso/wso-4.2.4.php:1017-1024 | php/wso/wso-4.2.5.php:1023-1030 | REDACTED:770-777 | REDACTED:770-777 | php/zxc/.v.php:1025-1032 | REDACTED:757-764 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:768` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (7 lines × 11) · ×2
  • Duplicated block (7 lines × 11) REDACTED:617 — REDACTED:617-623 | php/wso/wso-4.1.3.php:865-871 | php/wso/wso-4.2.1.php:857-863 | php/wso/wso-4.2.2.php:856-862 | php/wso/wso-4.2.3.php:860-866 | php/wso/wso-4.2.4.php:865-871 | php/wso/wso-4.2.5.php:871-877 | REDACTED:619-625 | REDACTED:619-625 | php/zxc/.v.php:873-879 | REDACTED:606-612 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:617` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 11) REDACTED:683 — REDACTED:683-689 | php/wso/wso-4.1.3.php:931-938 | php/wso/wso-4.2.1.php:923-930 | php/wso/wso-4.2.2.php:922-929 | php/wso/wso-4.2.3.php:926-933 | php/wso/wso-4.2.4.php:931-938 | php/wso/wso-4.2.5.php:937-944 | REDACTED:685-691 | REDACTED:685-691 | php/zxc/.v.php:939-946 | REDACTED:672-678 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:683` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7 lines × 8) · ×2
  • Duplicated block (7 lines × 8) REDACTED:1909 — REDACTED:1909-1915 | REDACTED:1940-1946 | php/angel大马.php:1909-1915 | php/angel大马.php:1940-1946 | REDACTED:1909-1915 | REDACTED:1940-1946 | REDACTED:1906-1912 | REDACTED:1937-1943 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1909` 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 × 8) REDACTED:478 — REDACTED:478-484 | REDACTED:737-743 | REDACTED:480-486 | REDACTED:739-745 | REDACTED:480-486 | REDACTED:739-745 | REDACTED:467-473 | REDACTED:726-732 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:478` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (7 lines × 6) · ×2
  • Duplicated block (7 lines × 6) REDACTED:459 — REDACTED:459-465 | REDACTED:510-516 | REDACTED:515-521 | REDACTED:568-574 | REDACTED:630-636 | php/b374k/source/b374k-2.8.source.php:669-675 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:459` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:518` calls `get_archiver_available`, `foreach` and `REDACTED:465` 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 (7 lines × 6) REDACTED:207 — REDACTED:207-213 | REDACTED:232-238 | REDACTED:207-213 | REDACTED:232-238 | REDACTED:188-194 | REDACTED:213-219 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:188` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 7) · ×2
  • Duplicated block (6 lines × 7) php/wso/wso-4.1.3.php:694 — php/wso/wso-4.1.3.php:694-699 | php/wso/wso-4.2.1.php:704-709 | php/wso/wso-4.2.2.php:703-708 | php/wso/wso-4.2.3.php:707-712 | php/wso/wso-4.2.4.php:712-717 | php/wso/wso-4.2.5.php:718-723 | php/zxc/.v.php:721-726 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.1.php` as WHOLE FILES: this scan already matched 102 separate duplicated blocks between them, totalling at least 1993 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:694` 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 × 7) REDACTED:689 — REDACTED:689-694 | REDACTED:709-714 | REDACTED:729-734 | REDACTED:749-754 | REDACTED:769-774 | REDACTED:789-794 | REDACTED:808-813 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:689` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:709` calls `FetchURL` and `REDACTED:808` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (2–6 lines × 4) · ×2
  • Duplicated block (2–6 lines × 4) REDACTED:666 — REDACTED:666-671 | php/wso/wso-4.1.3.php:913-914 | REDACTED:668-673 | REDACTED:668-673 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:666` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:666` calls `array_merge`, `array`, `readlink` and `php/wso/wso-4.1.3.php:913` does not — after which the two agree again for 5 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 (2–6 lines × 4) REDACTED:1359 — REDACTED:1359-1364 | REDACTED:1293-1298 | REDACTED:1296-1297 | REDACTED:1138-1143 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1359` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:1358` calls `empty`, `htmlspecialchars` and `REDACTED:1295` 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.
D4 · Code Duplication · Duplicated block (5 lines × 13) · ×2
  • Duplicated block (5 lines × 13) REDACTED:233 — REDACTED:233-237 | REDACTED:202-206 | REDACTED:197-201 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:309-313 | php/PHPshell/【r57】/r57.php:202-206 | REDACTED:1050-1054 | REDACTED:226-230 | REDACTED:574-578 | REDACTED:187-191 | REDACTED:1516-1520 | REDACTED:2233-2237 | www-7jyewu-cn/免杀php大马.php:2233-2237 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2233-2237 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (5 lines × 13) REDACTED:254 — REDACTED:254-258 | php/wso/wso-4.1.3.php:194-198 | php/wso/wso-4.2.0.php:209-213 | php/wso/wso-4.2.1.php:209-213 | php/wso/wso-4.2.2.php:208-212 | php/wso/wso-4.2.3.php:212-216 | php/wso/wso-4.2.4.php:217-221 | php/wso/wso-4.2.5.php:220-224 | REDACTED:256-260 | REDACTED:262-266 | REDACTED:256-260 | php/zxc/.v.php:224-228 | REDACTED:246-250 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:254` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×2
  • Duplicated block (5 lines × 4) REDACTED:385 — REDACTED:385-389 | REDACTED:288-292 | REDACTED:310-314 | REDACTED:381-385 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:288` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (5 lines × 4) REDACTED:632 — REDACTED:632-636 | REDACTED:665-669 | REDACTED:742-746 | REDACTED:756-760 — 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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:632` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 6) · ×2
  • Duplicated block (6 lines × 6) REDACTED:1250 — REDACTED:1250-1255 | REDACTED:1094-1099 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1362-1367 | php/PHPshell/【r57_iFX】/r57_iFX.php:871-876 | php/PHPshell/【r57_karta】/r57_kartal.php:842-847 | php/PHPshell/【r57】/r57.php:1099-1104 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 17 separate duplicated blocks between them, totalling at least 236 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (6 lines × 6) REDACTED:302 — REDACTED:302-307 | REDACTED:276-281 | REDACTED:306-311 | REDACTED:310-315 | REDACTED:348-353 | REDACTED:298-303 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (5 lines × 12) · ×2
  • Duplicated block (5 lines × 12) REDACTED:626 — REDACTED:626-630 | REDACTED:530-534 | REDACTED:1254-1258 | REDACTED:1230-1234 | REDACTED:1074-1078 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1342-1346 | php/PHPshell/【r57_iFX】/r57_iFX.php:851-855 | php/PHPshell/【r57_karta】/r57_kartal.php:822-826 | php/PHPshell/【r57】/r57.php:1079-1083 | REDACTED:1245-1249 | REDACTED:1077-1081 | REDACTED:530-534 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (5 lines × 12) REDACTED:1262 — REDACTED:1262-1266 | php/wso/wso-4.1.3.php:1371-1375 | php/wso/wso-4.2.0.php:1368-1372 | php/wso/wso-4.2.1.php:1364-1368 | php/wso/wso-4.2.2.php:1363-1367 | php/wso/wso-4.2.3.php:1367-1371 | php/wso/wso-4.2.4.php:1372-1376 | php/wso/wso-4.2.5.php:1378-1382 | REDACTED:1264-1268 | REDACTED:1264-1268 | php/zxc/.v.php:1378-1382 | REDACTED:1257-1261 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1262` 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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.5 · ×1
  • Low contrast colour pair in CSS (3.5:1) jsp/SJavaWebManageV1.4.jsp:863 — `.bottom` sets color: #fff on background-color: #888 — 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×1
  • Animation without a prefers-reduced-motion guard php/webshell免杀-提升兼容性.html:17 — `.btn:hover` moves (`transition: background-position .1s linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×1
  • Focus outline removed in CSS without a :focus replacement php/webshell免杀-提升兼容性.html:17 — `.btn.active` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
D1 · Cyclomatic Complexity · 0.actionFilesMan (cyclomatic 64) · ×1
  • 0.actionFilesMan (cyclomatic 64) php/wso/wso-4.2.0.php:752 — 0.actionFilesMan has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1.actionFilesMan (cyclomatic 64) · ×1
  • 1.actionFilesMan (cyclomatic 64) php/wso/wso-4.2.1.php:748 — 1.actionFilesMan has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2.actionFilesMan (cyclomatic 64) · ×1
  • 2.actionFilesMan (cyclomatic 64) php/wso/wso-4.2.2.php:747 — 2.actionFilesMan has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.actionFilesMan (cyclomatic 64) · ×1
  • 3.actionFilesMan (cyclomatic 64) php/wso/wso-4.2.3.php:751 — 3.actionFilesMan has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.actionFilesMan (cyclomatic 64) · ×1
  • 4.actionFilesMan (cyclomatic 64) php/wso/wso-4.2.4.php:756 — 4.actionFilesMan has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionFilesMan (cyclomatic 64) · ×1
  • 5.actionFilesMan (cyclomatic 64) php/wso/wso-4.2.5.php:762 — 5.actionFilesMan has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · v.actionFilesMan (cyclomatic 64) · ×1
  • v.actionFilesMan (cyclomatic 64) php/zxc/.v.php:765 — v.actionFilesMan has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.actionFilesMan (cyclomatic 63) · ×1
  • 3.actionFilesMan (cyclomatic 63) php/wso/wso-4.1.3.php:756 — 3.actionFilesMan has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionFilesMan (cyclomatic 62) · ×1
  • 5.actionFilesMan (cyclomatic 62) REDACTED:502 — 5.actionFilesMan has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · other-decode.actionFilesMan (cyclomatic 61) · ×1
  • other-decode.actionFilesMan (cyclomatic 61) REDACTED:513 — other-decode.actionFilesMan has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionFilesMan (cyclomatic 61) · ×1
  • wso2.actionFilesMan (cyclomatic 61) REDACTED:515 — wso2.actionFilesMan has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso_404.actionFilesMan (cyclomatic 61) · ×1
  • wso_404.actionFilesMan (cyclomatic 61) REDACTED:953 — wso_404.actionFilesMan has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1.actionFilesMan (cyclomatic 61) · ×1
  • 1.actionFilesMan (cyclomatic 61) REDACTED:515 — 1.actionFilesMan has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Private-i3lue.outputdirlisting (cyclomatic 57) · ×1
  • Private-i3lue.outputdirlisting (cyclomatic 57) REDACTED:1185 — Private-i3lue.outputdirlisting has cyclomatic complexity 57 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · g00nv13.files (cyclomatic 55) · ×1
  • g00nv13.files (cyclomatic 55) REDACTED:433 — g00nv13.files has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · other-decode.actionSql (cyclomatic 53) · ×1
  • other-decode.actionSql (cyclomatic 53) REDACTED:1120 — other-decode.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.actionSql (cyclomatic 53) · ×1
  • 0.actionSql (cyclomatic 53) php/wso/wso-4.2.0.php:1226 — 0.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2.actionSql (cyclomatic 53) · ×1
  • 2.actionSql (cyclomatic 53) php/wso/wso-4.2.2.php:1221 — 2.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.actionSql (cyclomatic 53) · ×1
  • 4.actionSql (cyclomatic 53) php/wso/wso-4.2.4.php:1230 — 4.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionSql (cyclomatic 53) · ×1
  • 5.actionSql (cyclomatic 53) php/wso/wso-4.2.5.php:1236 — 5.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionSql (cyclomatic 53) · ×1
  • wso2.actionSql (cyclomatic 53) REDACTED:1122 — wso2.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · v.actionSql (cyclomatic 53) · ×1
  • v.actionSql (cyclomatic 53) php/zxc/.v.php:1236 — v.actionSql has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.input (cyclomatic 52) · ×1
  • 0.input (cyclomatic 52) b4tm4n-toolz/database/adminer-4.5.0.php:115 — 0.input has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso_404.actionSql (cyclomatic 52) · ×1
  • wso_404.actionSql (cyclomatic 52) REDACTED:1608 — wso_404.actionSql has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionSql (cyclomatic 52) · ×1
  • 5.actionSql (cyclomatic 52) REDACTED:1115 — 5.actionSql has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.actionFilesTools (cyclomatic 51) · ×1
  • 0.actionFilesTools (cyclomatic 51) php/wso/wso-4.2.0.php:415 — 0.actionFilesTools has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1.actionFilesTools (cyclomatic 51) · ×1
  • 1.actionFilesTools (cyclomatic 51) php/wso/wso-4.2.1.php:415 — 1.actionFilesTools has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2.actionFilesTools (cyclomatic 51) · ×1
  • 2.actionFilesTools (cyclomatic 51) php/wso/wso-4.2.2.php:414 — 2.actionFilesTools has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.actionFilesTools (cyclomatic 51) · ×1
  • 3.actionFilesTools (cyclomatic 51) php/wso/wso-4.2.3.php:418 — 3.actionFilesTools has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.actionFilesTools (cyclomatic 51) · ×1
  • 4.actionFilesTools (cyclomatic 51) php/wso/wso-4.2.4.php:423 — 4.actionFilesTools has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionFilesTools (cyclomatic 51) · ×1
  • 5.actionFilesTools (cyclomatic 51) php/wso/wso-4.2.5.php:429 — 5.actionFilesTools has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · v.actionFilesTools (cyclomatic 51) · ×1
  • v.actionFilesTools (cyclomatic 51) php/zxc/.v.php:433 — v.actionFilesTools has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionFilesTools (cyclomatic 50) · ×1
  • wso2.actionFilesTools (cyclomatic 50) REDACTED:662 — wso2.actionFilesTools has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WSO_4_0_5.actionFilesTools (cyclomatic 49) · ×1
  • WSO_4_0_5.actionFilesTools (cyclomatic 49) REDACTED:386 — WSO_4_0_5.actionFilesTools has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso.actionFilesTools (cyclomatic 49) · ×1
  • wso.actionFilesTools (cyclomatic 49) REDACTED:686 — wso.actionFilesTools has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 404.actionFilesTools (cyclomatic 49) · ×1
  • 404.actionFilesTools (cyclomatic 49) REDACTED:733 — 404.actionFilesTools has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · other-decode.actionFilesTools (cyclomatic 48) · ×1
  • other-decode.actionFilesTools (cyclomatic 48) REDACTED:789 — other-decode.actionFilesTools has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.input (cyclomatic 48) · ×1
  • 4.input (cyclomatic 48) php/twitter/adminer-4.2.4.php:110 — 4.input has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.actionFilesTools (cyclomatic 48) · ×1
  • 3.actionFilesTools (cyclomatic 48) php/wso/wso-4.1.3.php:415 — 3.actionFilesTools has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionFilesTools (cyclomatic 48) · ×1
  • wso2.actionFilesTools (cyclomatic 48) REDACTED:791 — wso2.actionFilesTools has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso_404.actionFilesTools (cyclomatic 48) · ×1
  • wso_404.actionFilesTools (cyclomatic 48) REDACTED:1232 — wso_404.actionFilesTools has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1.actionFilesTools (cyclomatic 48) · ×1
  • 1.actionFilesTools (cyclomatic 48) REDACTED:791 — 1.actionFilesTools has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionFilesTools (cyclomatic 48) · ×1
  • 5.actionFilesTools (cyclomatic 48) REDACTED:778 — 5.actionFilesTools has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WSO_4_0_5.actionFilesMan (cyclomatic 43) · ×1
  • WSO_4_0_5.actionFilesMan (cyclomatic 43) REDACTED:712 — WSO_4_0_5.actionFilesMan has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso.actionFilesMan (cyclomatic 43) · ×1
  • wso.actionFilesMan (cyclomatic 43) REDACTED:468 — wso.actionFilesMan has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 404.actionFilesMan (cyclomatic 43) · ×1
  • 404.actionFilesMan (cyclomatic 43) REDACTED:505 — 404.actionFilesMan has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionFilesMan (cyclomatic 43) · ×1
  • wso2.actionFilesMan (cyclomatic 43) REDACTED:454 — wso2.actionFilesMan has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · G5.wdll_nora (cyclomatic 40) · ×1
  • G5.wdll_nora (cyclomatic 40) REDACTED:315 — G5.wdll_nora has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Customize.Request (cyclomatic 38) · ×1
  • Customize.Request (cyclomatic 38) aspx/httpHandlers_backdoor/Customize.cs:38 — Customize.Request has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
D1 · Cyclomatic Complexity · 2.rs (cyclomatic 37) · ×1
  • 2.rs (cyclomatic 37) REDACTED:86 — 2.rs has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.rs (cyclomatic 37) · ×1
  • source.rs (cyclomatic 37) php/b374k/source/b374k-2.8.source.php:239 — source.rs has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · project.show (cyclomatic 37) · ×1
  • project.show (cyclomatic 37) REDACTED:266 — project.show has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · metaslsoft.rs (cyclomatic 37) · ×1
  • metaslsoft.rs (cyclomatic 37) REDACTED:82 — metaslsoft.rs has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.lang (cyclomatic 36) · ×1
  • 0.lang (cyclomatic 36) b4tm4n-toolz/database/adminer-4.5.0.php:170 — 0.lang has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · fbi.input (cyclomatic 36) · ×1
  • fbi.input (cyclomatic 36) REDACTED:314 — fbi.input has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.lang (cyclomatic 36) · ×1
  • 4.lang (cyclomatic 36) php/twitter/adminer-4.2.4.php:161 — 4.lang has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · WSO_4_0_5.actionSql (cyclomatic 36) · ×1
  • WSO_4_0_5.actionSql (cyclomatic 36) REDACTED:1193 — WSO_4_0_5.actionSql has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso.actionSql (cyclomatic 36) · ×1
  • wso.actionSql (cyclomatic 36) REDACTED:1127 — wso.actionSql has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 404.actionSql (cyclomatic 36) · ×1
  • 404.actionSql (cyclomatic 36) REDACTED:1131 — 404.actionSql has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.edit_form (cyclomatic 35) · ×1
  • 0.edit_form (cyclomatic 35) b4tm4n-toolz/database/adminer-4.5.0.php:162 — 0.edit_form has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · g00nv13.sql (cyclomatic 35) · ×1
  • g00nv13.sql (cyclomatic 35) REDACTED:255 — g00nv13.sql has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · source.check_access (cyclomatic 34) · ×1
  • source.check_access (cyclomatic 34) php/b374k/source/b374k-2.8.source.php:553 — source.check_access has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.edit_form (cyclomatic 34) · ×1
  • 4.edit_form (cyclomatic 34) php/twitter/adminer-4.2.4.php:153 — 4.edit_form has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 0.select (cyclomatic 33) · ×1
  • 0.select (cyclomatic 33) b4tm4n-toolz/database/adminer-4.5.0.php:1599 — 0.select has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · itsec.sqlclienT (cyclomatic 33) · ×1
  • itsec.sqlclienT (cyclomatic 33) REDACTED:616 — itsec.sqlclienT has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.select (cyclomatic 33) · ×1
  • 4.select (cyclomatic 33) php/twitter/adminer-4.2.4.php:1490 — 4.select has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · itsecteam_shell.sqlclienT (cyclomatic 33) · ×1
  • itsecteam_shell.sqlclienT (cyclomatic 33) REDACTED:616 — itsecteam_shell.sqlclienT has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · jHn.sqlclienT (cyclomatic 33) · ×1
  • jHn.sqlclienT (cyclomatic 33) REDACTED:597 — jHn.sqlclienT has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.page_header (cyclomatic 32) · ×1
  • 0.page_header (cyclomatic 32) b4tm4n-toolz/database/adminer-4.5.0.php:1530 — 0.page_header has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · fbi.lang (cyclomatic 32) · ×1
  • fbi.lang (cyclomatic 32) REDACTED:335 — fbi.lang has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.showdir (cyclomatic 31) · ×1
  • source.showdir (cyclomatic 31) REDACTED:522 — source.showdir has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.check_access (cyclomatic 31) · ×1
  • source.check_access (cyclomatic 31) REDACTED:492 — source.check_access has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.showdir (cyclomatic 29) · ×1
  • source.showdir (cyclomatic 29) REDACTED:471 — source.showdir has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Adminer.navigation (cyclomatic 29) · ×1
  • Adminer.navigation (cyclomatic 29) REDACTED:1254 — Adminer.navigation has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · fbi.page_header (cyclomatic 29) · ×1
  • fbi.page_header (cyclomatic 29) REDACTED:1274 — fbi.page_header has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · fbi.select (cyclomatic 29) · ×1
  • fbi.select (cyclomatic 29) REDACTED:1313 — fbi.select has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · itsec.querY (cyclomatic 29) · ×1
  • itsec.querY (cyclomatic 29) REDACTED:733 — itsec.querY has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · wso_404.actionlfiscan (cyclomatic 29) · ×1
  • wso_404.actionlfiscan (cyclomatic 29) REDACTED:463 — wso_404.actionlfiscan has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · G5.sqlqu (cyclomatic 29) · ×1
  • G5.sqlqu (cyclomatic 29) REDACTED:1396 — G5.sqlqu has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · itsecteam_shell.querY (cyclomatic 29) · ×1
  • itsecteam_shell.querY (cyclomatic 29) REDACTED:733 — itsecteam_shell.querY has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · jHn.querY (cyclomatic 29) · ×1
  • jHn.querY (cyclomatic 29) REDACTED:714 — jHn.querY has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · wso2.actionSql (cyclomatic 29) · ×1
  • wso2.actionSql (cyclomatic 29) REDACTED:1029 — wso2.actionSql has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · fbi.edit_fields (cyclomatic 27) · ×1
  • fbi.edit_fields (cyclomatic 27) REDACTED:1329 — fbi.edit_fields has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.page_header (cyclomatic 27) · ×1
  • 4.page_header (cyclomatic 27) php/twitter/adminer-4.2.4.php:1432 — 4.page_header has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 0.edit_fields (cyclomatic 26) · ×1
  • 0.edit_fields (cyclomatic 26) b4tm4n-toolz/database/adminer-4.5.0.php:1615 — 0.edit_fields has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.edit_fields (cyclomatic 26) · ×1
  • 4.edit_fields (cyclomatic 26) php/twitter/adminer-4.2.4.php:1506 — 4.edit_fields 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. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Adminer.selectSearchProcess (cyclomatic 25) · ×1
  • Adminer.selectSearchProcess (cyclomatic 25) b4tm4n-toolz/database/adminer-4.5.0.php:1479 — Adminer.selectSearchProcess has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2.showdir (cyclomatic 25) · ×1
  • 2.showdir (cyclomatic 25) REDACTED:355 — 2.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.showdir (cyclomatic 25) · ×1
  • 3.showdir (cyclomatic 25) REDACTED:424 — 3.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.showdir (cyclomatic 25) · ×1
  • 4.showdir (cyclomatic 25) REDACTED:467 — 4.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Adminer.dumpData (cyclomatic 25) · ×1
  • Adminer.dumpData (cyclomatic 25) REDACTED:1244 — Adminer.dumpData has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1n73ction.showdir (cyclomatic 25) · ×1
  • 1n73ction.showdir (cyclomatic 25) REDACTED:242 — 1n73ction.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · shell.showdir (cyclomatic 25) · ×1
  • shell.showdir (cyclomatic 25) REDACTED:264 — shell.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · metaslsoft.showdir (cyclomatic 25) · ×1
  • metaslsoft.showdir (cyclomatic 25) REDACTED:351 — metaslsoft.showdir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PHPRemoteView.display_perms (cyclomatic 24) · ×1
  • PHPRemoteView.display_perms (cyclomatic 24) REDACTED:490 — PHPRemoteView.display_perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SnIpEr_SA Shell.perms (cyclomatic 24) · ×1
  • SnIpEr_SA Shell.perms (cyclomatic 24) REDACTED:1231 — SnIpEr_SA Shell.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · r57shell.perms (cyclomatic 24) · ×1
  • r57shell.perms (cyclomatic 24) REDACTED:1207 — r57shell.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · r57shell127.perms (cyclomatic 24) · ×1
  • r57shell127.perms (cyclomatic 24) REDACTED:1051 — r57shell127.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · r57_Mohajer22.perms (cyclomatic 24) · ×1
  • r57_Mohajer22.perms (cyclomatic 24) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1319 — r57_Mohajer22.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · r57_iFX.perms (cyclomatic 24) · ×1
  • r57_iFX.perms (cyclomatic 24) php/PHPshell/【r57_iFX】/r57_iFX.php:828 — r57_iFX.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · r57_kartal.perms (cyclomatic 24) · ×1
  • r57_kartal.perms (cyclomatic 24) php/PHPshell/【r57_karta】/r57_kartal.php:799 — r57_kartal.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Adminer.selectSearchProcess (cyclomatic 24) · ×1
  • Adminer.selectSearchProcess (cyclomatic 24) php/twitter/adminer-4.2.4.php:1383 — Adminer.selectSearchProcess has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Agent.perms (cyclomatic 24) · ×1
  • Agent.perms (cyclomatic 24) REDACTED:1222 — Agent.perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · remview_fix.display_perms (cyclomatic 24) · ×1
  • remview_fix.display_perms (cyclomatic 24) REDACTED:490 — remview_fix.display_perms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Crystal.perms (cyclomatic 23) · ×1
  • Crystal.perms (cyclomatic 23) REDACTED:603 — Crystal.perms has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · aioshell.get_human_file_perms (cyclomatic 23) · ×1
  • aioshell.get_human_file_perms (cyclomatic 23) REDACTED:122 — aioshell.get_human_file_perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · angel大马.getPerms (cyclomatic 23) · ×1
  • angel大马.getPerms (cyclomatic 23) php/angel大马.php:1771 — angel大马.getPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 3.rs (cyclomatic 23) · ×1
  • 3.rs (cyclomatic 23) REDACTED:118 — 3.rs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.rs (cyclomatic 23) · ×1
  • 4.rs (cyclomatic 23) REDACTED:137 — 4.rs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.rs (cyclomatic 23) · ×1
  • source.rs (cyclomatic 23) REDACTED:141 — source.rs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · project.getperms (cyclomatic 23) · ×1
  • project.getperms (cyclomatic 23) REDACTED:934 — project.getperms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Adminer.dumpTable (cyclomatic 23) · ×1
  • Adminer.dumpTable (cyclomatic 23) REDACTED:1202 — Adminer.dumpTable has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · other-decode.wsoPerms (cyclomatic 23) · ×1
  • other-decode.wsoPerms (cyclomatic 23) REDACTED:342 — other-decode.wsoPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · other-decode.actionSecInfo (cyclomatic 23) · ×1
  • other-decode.actionSecInfo (cyclomatic 23) REDACTED:390 — other-decode.actionSecInfo has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2013未加密.getPerms (cyclomatic 23) · ×1
  • 2013未加密.getPerms (cyclomatic 23) php/phpspy/2013未加密.php:1216 — 2013未加密.getPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · spy.getPerms (cyclomatic 23) · ×1
  • spy.getPerms (cyclomatic 23) REDACTED:1768 — spy.getPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · qyt0dHv1.perms (cyclomatic 23) · ×1
  • qyt0dHv1.perms (cyclomatic 23) REDACTED:247 — qyt0dHv1.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · upsi1on.perms (cyclomatic 23) · ×1
  • upsi1on.perms (cyclomatic 23) REDACTED:658 — upsi1on.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · WSO_4_0_5.perms (cyclomatic 23) · ×1
  • WSO_4_0_5.perms (cyclomatic 23) REDACTED:262 — WSO_4_0_5.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 0.perms (cyclomatic 23) · ×1
  • 0.perms (cyclomatic 23) php/wso/wso-4.2.0.php:284 — 0.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 1.perms (cyclomatic 23) · ×1
  • 1.perms (cyclomatic 23) php/wso/wso-4.2.1.php:284 — 1.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 2.perms (cyclomatic 23) · ×1
  • 2.perms (cyclomatic 23) php/wso/wso-4.2.2.php:283 — 2.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 4.perms (cyclomatic 23) · ×1
  • 4.perms (cyclomatic 23) php/wso/wso-4.2.4.php:292 — 4.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 5.perms (cyclomatic 23) · ×1
  • 5.perms (cyclomatic 23) php/wso/wso-4.2.5.php:298 — 5.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso.perms (cyclomatic 23) · ×1
  • wso.perms (cyclomatic 23) REDACTED:323 — wso.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso2.wsoPerms (cyclomatic 23) · ×1
  • wso2.wsoPerms (cyclomatic 23) REDACTED:344 — wso2.wsoPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso2.actionSecInfo (cyclomatic 23) · ×1
  • wso2.actionSecInfo (cyclomatic 23) REDACTED:392 — wso2.actionSecInfo has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso_404.wsoPerms (cyclomatic 23) · ×1
  • wso_404.wsoPerms (cyclomatic 23) REDACTED:346 — wso_404.wsoPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 1.wsoPerms (cyclomatic 23) · ×1
  • 1.wsoPerms (cyclomatic 23) REDACTED:344 — 1.wsoPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 1.actionSecInfo (cyclomatic 23) · ×1
  • 1.actionSecInfo (cyclomatic 23) REDACTED:392 — 1.actionSecInfo has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · v.perms (cyclomatic 23) · ×1
  • v.perms (cyclomatic 23) php/zxc/.v.php:302 — v.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · bypass403.perms (cyclomatic 23) · ×1
  • bypass403.perms (cyclomatic 23) REDACTED:32 — bypass403.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 404.perms (cyclomatic 23) · ×1
  • 404.perms (cyclomatic 23) REDACTED:353 — 404.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Private-i3lue.octtostr (cyclomatic 23) · ×1
  • Private-i3lue.octtostr (cyclomatic 23) REDACTED:1312 — Private-i3lue.octtostr has cyclomatic complexity 23 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · c37.GetPerms (cyclomatic 23) · ×1
  • c37.GetPerms (cyclomatic 23) REDACTED:2125 — c37.GetPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · cihshell_fix.fperms (cyclomatic 23) · ×1
  • cihshell_fix.fperms (cyclomatic 23) REDACTED:87 — cihshell_fix.fperms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 5.wsoPerms (cyclomatic 23) · ×1
  • 5.wsoPerms (cyclomatic 23) REDACTED:331 — 5.wsoPerms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 5.actionSecInfo (cyclomatic 23) · ×1
  • 5.actionSecInfo (cyclomatic 23) REDACTED:379 — 5.actionSecInfo has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.perms (cyclomatic 23) · ×1
  • wso2.perms (cyclomatic 23) REDACTED:331 — wso2.perms has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Chropper.doPost (cyclomatic 23) · ×1
  • Chropper.doPost (cyclomatic 23) REDACTED:268 — Chropper.doPost has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 4.exe (cyclomatic 22) · ×1
  • 4.exe (cyclomatic 22) REDACTED:247 — 4.exe has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.sql_connect (cyclomatic 22) · ×1
  • source.sql_connect (cyclomatic 22) php/b374k/source/b374k-2.8.source.php:746 — source.sql_connect has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WSO_4_0_5.actionSecInfo (cyclomatic 22) · ×1
  • WSO_4_0_5.actionSecInfo (cyclomatic 22) REDACTED:306 — WSO_4_0_5.actionSecInfo has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · G5.sqlexp (cyclomatic 22) · ×1
  • G5.sqlexp (cyclomatic 22) REDACTED:1365 — G5.sqlexp has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 3.exe (cyclomatic 21) · ×1
  • 3.exe (cyclomatic 21) REDACTED:215 — 3.exe has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.sql_connect (cyclomatic 21) · ×1
  • 4.sql_connect (cyclomatic 21) REDACTED:631 — 4.sql_connect has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Adminer.selectSearchProcess (cyclomatic 21) · ×1
  • Adminer.selectSearchProcess (cyclomatic 21) REDACTED:1184 — Adminer.selectSearchProcess has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WSO_4_0_5.printHeader (cyclomatic 21) · ×1
  • WSO_4_0_5.printHeader (cyclomatic 21) REDACTED:57 — WSO_4_0_5.printHeader has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso.printHeader (cyclomatic 21) · ×1
  • wso.printHeader (cyclomatic 21) REDACTED:118 — wso.printHeader has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 404.printHeader (cyclomatic 21) · ×1
  • 404.printHeader (cyclomatic 21) REDACTED:128 — 404.printHeader has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · DOC_ZIBSZXBIEG.do_passreturn (cyclomatic 21) · ×1
  • DOC_ZIBSZXBIEG.do_passreturn (cyclomatic 21) REDACTED:1408 — DOC_ZIBSZXBIEG.do_passreturn has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: DOC_ZIBSZXBIEG.css_showimg (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 4.sql_field_name (cyclomatic 20) · ×1
  • 4.sql_field_name (cyclomatic 20) REDACTED:692 — 4.sql_field_name has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.wsoHeader (cyclomatic 20) · ×1
  • 5.wsoHeader (cyclomatic 20) REDACTED:123 — 5.wsoHeader has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso2.printHeader (cyclomatic 20) · ×1
  • wso2.printHeader (cyclomatic 20) REDACTED:132 — wso2.printHeader has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · admine21_decode.backshell (cyclomatic 19) · ×1
  • admine21_decode.backshell (cyclomatic 19) REDACTED:182 — admine21_decode.backshell has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.sql_query (cyclomatic 19) · ×1
  • 4.sql_query (cyclomatic 19) REDACTED:660 — 4.sql_query has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.sql_num_rows (cyclomatic 19) · ×1
  • 4.sql_num_rows (cyclomatic 19) REDACTED:729 — 4.sql_num_rows has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · other-decode.wsoHeader (cyclomatic 19) · ×1
  • other-decode.wsoHeader (cyclomatic 19) REDACTED:133 — other-decode.wsoHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · DB_MySQL.sqldump (cyclomatic 19) · ×1
  • DB_MySQL.sqldump (cyclomatic 19) php/phpspy/2013未加密.php:1550 — DB_MySQL.sqldump has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · phpspy_2005_full.sqldumptable (cyclomatic 19) · ×1
  • phpspy_2005_full.sqldumptable (cyclomatic 19) REDACTED:1120 — phpspy_2005_full.sqldumptable has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · upsi1on.fix_data (cyclomatic 19) · ×1
  • upsi1on.fix_data (cyclomatic 19) REDACTED:501 — upsi1on.fix_data has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · 0.hardHeader (cyclomatic 19) · ×1
  • 0.hardHeader (cyclomatic 19) php/wso/wso-4.2.0.php:73 — 0.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 1.hardHeader (cyclomatic 19) · ×1
  • 1.hardHeader (cyclomatic 19) php/wso/wso-4.2.1.php:73 — 1.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 2.hardHeader (cyclomatic 19) · ×1
  • 2.hardHeader (cyclomatic 19) php/wso/wso-4.2.2.php:72 — 2.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 4.hardHeader (cyclomatic 19) · ×1
  • 4.hardHeader (cyclomatic 19) php/wso/wso-4.2.4.php:77 — 4.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 5.hardHeader (cyclomatic 19) · ×1
  • 5.hardHeader (cyclomatic 19) php/wso/wso-4.2.5.php:77 — 5.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso2.wsoHeader (cyclomatic 19) · ×1
  • wso2.wsoHeader (cyclomatic 19) REDACTED:135 — wso2.wsoHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 1.wsoHeader (cyclomatic 19) · ×1
  • 1.wsoHeader (cyclomatic 19) REDACTED:135 — 1.wsoHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · v.hardHeader (cyclomatic 19) · ×1
  • v.hardHeader (cyclomatic 19) php/zxc/.v.php:80 — v.hardHeader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · hkrkoz.sqldumptable (cyclomatic 19) · ×1
  • hkrkoz.sqldumptable (cyclomatic 19) REDACTED:643 — hkrkoz.sqldumptable has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.gp (cyclomatic 18) · ×1
  • 4.gp (cyclomatic 18) REDACTED:223 — 4.gp has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.sql_num_fields (cyclomatic 18) · ×1
  • 4.sql_num_fields (cyclomatic 18) REDACTED:679 — 4.sql_num_fields has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (4.sql_fetch_data, 4.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · 4.sql_fetch_data (cyclomatic 18) · ×1
  • 4.sql_fetch_data (cyclomatic 18) REDACTED:716 — 4.sql_fetch_data has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (4.sql_num_fields, 4.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · 4.sql_close (cyclomatic 18) · ×1
  • 4.sql_close (cyclomatic 18) REDACTED:747 — 4.sql_close has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (4.sql_num_fields, 4.sql_fetch_data) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · pHp一句话扫描脚本程序.antivirus (cyclomatic 18) · ×1
  • pHp一句话扫描脚本程序.antivirus (cyclomatic 18) php/pHp一句话扫描脚本程序.php:36 — pHp一句话扫描脚本程序.antivirus has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.actionSecInfo (cyclomatic 18) · ×1
  • 0.actionSecInfo (cyclomatic 18) php/wso/wso-4.2.0.php:345 — 0.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 1.actionSecInfo (cyclomatic 18) · ×1
  • 1.actionSecInfo (cyclomatic 18) php/wso/wso-4.2.1.php:345 — 1.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2.actionSecInfo (cyclomatic 18) · ×1
  • 2.actionSecInfo (cyclomatic 18) php/wso/wso-4.2.2.php:344 — 2.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.actionSecInfo (cyclomatic 18) · ×1
  • 4.actionSecInfo (cyclomatic 18) php/wso/wso-4.2.4.php:353 — 4.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 5.actionSecInfo (cyclomatic 18) · ×1
  • 5.actionSecInfo (cyclomatic 18) php/wso/wso-4.2.5.php:359 — 5.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso_404.wsoHeader (cyclomatic 18) · ×1
  • wso_404.wsoHeader (cyclomatic 18) REDACTED:143 — wso_404.wsoHeader has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso_404.actionSecInfo (cyclomatic 18) · ×1
  • wso_404.actionSecInfo (cyclomatic 18) REDACTED:392 — wso_404.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · v.actionSecInfo (cyclomatic 18) · ×1
  • v.actionSecInfo (cyclomatic 18) php/zxc/.v.php:363 — v.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionSecInfo (cyclomatic 18) · ×1
  • wso2.actionSecInfo (cyclomatic 18) REDACTED:365 — wso2.actionSecInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · MailmanProxy.process_message (cyclomatic 18) · ×1
  • MailmanProxy.process_message (cyclomatic 18) py/smtpd.py:377 — MailmanProxy.process_message has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · yaps.sysinfo (cyclomatic 17) · ×1
  • yaps.sysinfo (cyclomatic 17) REDACTED:256 — yaps.sysinfo has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · admine21_decode.command (cyclomatic 17) · ×1
  • admine21_decode.command (cyclomatic 17) REDACTED:152 — admine21_decode.command has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · angel大马.multi (cyclomatic 17) · ×1
  • angel大马.multi (cyclomatic 17) php/angel大马.php:1614 — angel大马.multi has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · angel大马.GetSFileList (cyclomatic 17) · ×1
  • angel大马.GetSFileList (cyclomatic 17) php/angel大马.php:1939 — angel大马.GetSFileList has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · other-decode.actionStringTools (cyclomatic 17) · ×1
  • other-decode.actionStringTools (cyclomatic 17) REDACTED:703 — other-decode.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · spy.multi (cyclomatic 17) · ×1
  • spy.multi (cyclomatic 17) REDACTED:1611 — spy.multi has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · spy.GetSFileList (cyclomatic 17) · ×1
  • spy.GetSFileList (cyclomatic 17) REDACTED:1936 — spy.GetSFileList has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WSO_4_0_5.actionStringTools (cyclomatic 17) · ×1
  • WSO_4_0_5.actionStringTools (cyclomatic 17) REDACTED:867 — WSO_4_0_5.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 0.actionStringTools (cyclomatic 17) · ×1
  • 0.actionStringTools (cyclomatic 17) php/wso/wso-4.2.0.php:947 — 0.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 2.actionStringTools (cyclomatic 17) · ×1
  • 2.actionStringTools (cyclomatic 17) php/wso/wso-4.2.2.php:942 — 2.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 4.actionStringTools (cyclomatic 17) · ×1
  • 4.actionStringTools (cyclomatic 17) php/wso/wso-4.2.4.php:952 — 4.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso.actionSecInfo (cyclomatic 17) · ×1
  • wso.actionSecInfo (cyclomatic 17) REDACTED:366 — wso.actionSecInfo has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso2.actionStringTools (cyclomatic 17) · ×1
  • wso2.actionStringTools (cyclomatic 17) REDACTED:705 — wso2.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · wso_404.actionStringTools (cyclomatic 17) · ×1
  • wso_404.actionStringTools (cyclomatic 17) REDACTED:1143 — wso_404.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · v.actionStringTools (cyclomatic 17) · ×1
  • v.actionStringTools (cyclomatic 17) php/zxc/.v.php:960 — v.actionStringTools has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 404.actionSecInfo (cyclomatic 17) · ×1
  • 404.actionSecInfo (cyclomatic 17) REDACTED:396 — 404.actionSecInfo has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.select_value (cyclomatic 16) · ×1
  • 0.select_value (cyclomatic 16) b4tm4n-toolz/database/adminer-4.5.0.php:140 — 0.select_value has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.process_field (cyclomatic 16) · ×1
  • 0.process_field (cyclomatic 16) b4tm4n-toolz/database/adminer-4.5.0.php:1612 — 0.process_field has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · 0.connect_error (cyclomatic 16) · ×1
  • 0.connect_error (cyclomatic 16) b4tm4n-toolz/database/adminer-4.5.0.php:1649 — 0.connect_error has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · admine21_decode.scanfile (cyclomatic 16) · ×1
  • admine21_decode.scanfile (cyclomatic 16) REDACTED:99 — admine21_decode.scanfile has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · admine21_decode.antivirus (cyclomatic 16) · ×1
  • admine21_decode.antivirus (cyclomatic 16) REDACTED:121 — admine21_decode.antivirus has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · source.check_access (cyclomatic 16) · ×1
  • source.check_access (cyclomatic 16) REDACTED:455 — source.check_access has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · other-decode.actionBruteforce (cyclomatic 16) · ×1
  • other-decode.actionBruteforce (cyclomatic 16) REDACTED:1036 — other-decode.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.select_value (cyclomatic 16) · ×1
  • 4.select_value (cyclomatic 16) php/twitter/adminer-4.2.4.php:132 — 4.select_value has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 4.process_field (cyclomatic 16) · ×1
  • 4.process_field (cyclomatic 16) php/twitter/adminer-4.2.4.php:1503 — 4.process_field 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. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 4.connect_error (cyclomatic 16) · ×1
  • 4.connect_error (cyclomatic 16) php/twitter/adminer-4.2.4.php:1545 — 4.connect_error has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 4.get_translations (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · WSO_4_0_5.actionBruteforce (cyclomatic 16) · ×1
  • WSO_4_0_5.actionBruteforce (cyclomatic 16) REDACTED:1108 — WSO_4_0_5.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 0.actionBruteforce (cyclomatic 16) · ×1
  • 0.actionBruteforce (cyclomatic 16) php/wso/wso-4.2.0.php:1142 — 0.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 2.actionBruteforce (cyclomatic 16) · ×1
  • 2.actionBruteforce (cyclomatic 16) php/wso/wso-4.2.2.php:1137 — 2.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 4.actionBruteforce (cyclomatic 16) · ×1
  • 4.actionBruteforce (cyclomatic 16) php/wso/wso-4.2.4.php:1146 — 4.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso.actionBruteforce (cyclomatic 16) · ×1
  • wso.actionBruteforce (cyclomatic 16) REDACTED:1044 — wso.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso_404.actionphptools (cyclomatic 16) · ×1
  • wso_404.actionphptools (cyclomatic 16) REDACTED:829 — wso_404.actionphptools has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wso_404.actionBruteforce (cyclomatic 16) · ×1
  • wso_404.actionBruteforce (cyclomatic 16) REDACTED:1524 — wso_404.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · v.actionBruteforce (cyclomatic 16) · ×1
  • v.actionBruteforce (cyclomatic 16) php/zxc/.v.php:1152 — v.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 404.actionBruteforce (cyclomatic 16) · ×1
  • 404.actionBruteforce (cyclomatic 16) REDACTED:1042 — 404.actionBruteforce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Private-i3lue.tree_showtree (cyclomatic 16) · ×1
  • Private-i3lue.tree_showtree (cyclomatic 16) REDACTED:915 — Private-i3lue.tree_showtree has cyclomatic complexity 16 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages. This is NOT this file's highest cyclomatic complexity: Private-i3lue.getimage (cyclomatic 18) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · DOC_ZIBSZXBIEG.GetHtml (cyclomatic 16) · ×1
  • DOC_ZIBSZXBIEG.GetHtml (cyclomatic 16) REDACTED:1804 — DOC_ZIBSZXBIEG.GetHtml has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: DOC_ZIBSZXBIEG.css_showimg (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 免杀php大马.GetHtml (cyclomatic 16) · ×1
  • 免杀php大马.GetHtml (cyclomatic 16) www-7jyewu-cn/免杀php大马.php:1804 — 免杀php大马.GetHtml has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 免杀php大马.css_showimg (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 最新过安全狗- 免杀PHP大马 -.GetHtml (cyclomatic 16) · ×1
  • 最新过安全狗- 免杀PHP大马 -.GetHtml (cyclomatic 16) www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1804 — 最新过安全狗- 免杀PHP大马 -.GetHtml has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: 最新过安全狗- 免杀PHP大马 -.css_showimg (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D2 · Cognitive Complexity · 0.actionFilesMan (cognitive 143) · ×1
  • 0.actionFilesMan (cognitive 143) php/wso/wso-4.2.0.php:752 — 0.actionFilesMan has cognitive complexity 143 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 1.actionFilesMan (cognitive 143) · ×1
  • 1.actionFilesMan (cognitive 143) php/wso/wso-4.2.1.php:748 — 1.actionFilesMan has cognitive complexity 143 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 2.actionFilesMan (cognitive 143) · ×1
  • 2.actionFilesMan (cognitive 143) php/wso/wso-4.2.2.php:747 — 2.actionFilesMan has cognitive complexity 143 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 3.actionFilesMan (cognitive 143) · ×1
  • 3.actionFilesMan (cognitive 143) php/wso/wso-4.2.3.php:751 — 3.actionFilesMan has cognitive complexity 143 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.actionFilesMan (cognitive 143) · ×1
  • 4.actionFilesMan (cognitive 143) php/wso/wso-4.2.4.php:756 — 4.actionFilesMan has cognitive complexity 143 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 5.actionFilesMan (cognitive 143) · ×1
  • 5.actionFilesMan (cognitive 143) php/wso/wso-4.2.5.php:762 — 5.actionFilesMan has cognitive complexity 143 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · v.actionFilesMan (cognitive 143) · ×1
  • v.actionFilesMan (cognitive 143) php/zxc/.v.php:765 — v.actionFilesMan has cognitive complexity 143 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 3.actionFilesMan (cognitive 142) · ×1
  • 3.actionFilesMan (cognitive 142) php/wso/wso-4.1.3.php:756 — 3.actionFilesMan has cognitive complexity 142 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 9 (37 pts), ternaries 15 (24 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso_404.actionFilesMan (cognitive 135) · ×1
  • wso_404.actionFilesMan (cognitive 135) REDACTED:953 — wso_404.actionFilesMan has cognitive complexity 135 (threshold 15). Drivers by points: if/else 22 (69 pts), loops 9 (37 pts), ternaries 14 (22 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 84). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 5.actionFilesMan (cognitive 134) · ×1
  • 5.actionFilesMan (cognitive 134) REDACTED:502 — 5.actionFilesMan has cognitive complexity 134 (threshold 15). Drivers by points: if/else 23 (70 pts), loops 8 (33 pts), ternaries 15 (24 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · other-decode.actionFilesMan (cognitive 133) · ×1
  • other-decode.actionFilesMan (cognitive 133) REDACTED:513 — other-decode.actionFilesMan has cognitive complexity 133 (threshold 15). Drivers by points: if/else 23 (70 pts), loops 8 (33 pts), ternaries 15 (24 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso2.actionFilesMan (cognitive 133) · ×1
  • wso2.actionFilesMan (cognitive 133) REDACTED:515 — wso2.actionFilesMan has cognitive complexity 133 (threshold 15). Drivers by points: if/else 23 (70 pts), loops 8 (33 pts), ternaries 15 (24 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 1.actionFilesMan (cognitive 133) · ×1
  • 1.actionFilesMan (cognitive 133) REDACTED:515 — 1.actionFilesMan has cognitive complexity 133 (threshold 15). Drivers by points: if/else 23 (70 pts), loops 8 (33 pts), ternaries 15 (24 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Private-i3lue.outputdirlisting (cognitive 131) · ×1
  • Private-i3lue.outputdirlisting (cognitive 131) REDACTED:1185 — Private-i3lue.outputdirlisting has cognitive complexity 131 (threshold 15). Drivers by points: if/else 38 (106 pts), boolean chains 14, ternaries 7 (10 pts), loops 1 (nesting depth added 71). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · other-decode.actionSql (cognitive 129) · ×1
  • other-decode.actionSql (cognitive 129) REDACTED:1120 — other-decode.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 0.actionSql (cognitive 129) · ×1
  • 0.actionSql (cognitive 129) php/wso/wso-4.2.0.php:1226 — 0.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 2.actionSql (cognitive 129) · ×1
  • 2.actionSql (cognitive 129) php/wso/wso-4.2.2.php:1221 — 2.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.actionSql (cognitive 129) · ×1
  • 4.actionSql (cognitive 129) php/wso/wso-4.2.4.php:1230 — 4.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 5.actionSql (cognitive 129) · ×1
  • 5.actionSql (cognitive 129) php/wso/wso-4.2.5.php:1236 — 5.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso2.actionSql (cognitive 129) · ×1
  • wso2.actionSql (cognitive 129) REDACTED:1122 — wso2.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · v.actionSql (cognitive 129) · ×1
  • v.actionSql (cognitive 129) php/zxc/.v.php:1236 — v.actionSql has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso_404.actionSql (cognitive 128) · ×1
  • wso_404.actionSql (cognitive 128) REDACTED:1608 — wso_404.actionSql has cognitive complexity 128 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 5.actionSql (cognitive 128) · ×1
  • 5.actionSql (cognitive 128) REDACTED:1115 — 5.actionSql has cognitive complexity 128 (threshold 15). Drivers by points: if/else 28 (67 pts), loops 7 (30 pts), ternaries 9 (23 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 2.rs (cognitive 109) · ×1
  • 2.rs (cognitive 109) REDACTED:86 — 2.rs has cognitive complexity 109 (threshold 15). Drivers by points: if/else 51 (109 pts) (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · metaslsoft.rs (cognitive 109) · ×1
  • metaslsoft.rs (cognitive 109) REDACTED:82 — metaslsoft.rs has cognitive complexity 109 (threshold 15). Drivers by points: if/else 51 (109 pts) (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso_404.actionlfiscan (cognitive 101) · ×1
  • wso_404.actionlfiscan (cognitive 101) REDACTED:463 — wso_404.actionlfiscan has cognitive complexity 101 (threshold 15). Drivers by points: if/else 29 (77 pts), loops 6 (24 pts) (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · WSO_4_0_5.actionSql (cognitive 98) · ×1
  • WSO_4_0_5.actionSql (cognitive 98) REDACTED:1193 — WSO_4_0_5.actionSql has cognitive complexity 98 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 7 (30 pts), ternaries 6 (14 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 61). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso.actionSql (cognitive 98) · ×1
  • wso.actionSql (cognitive 98) REDACTED:1127 — wso.actionSql has cognitive complexity 98 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 7 (30 pts), ternaries 6 (14 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 61). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 404.actionSql (cognitive 98) · ×1
  • 404.actionSql (cognitive 98) REDACTED:1131 — 404.actionSql has cognitive complexity 98 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 7 (30 pts), ternaries 6 (14 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 61). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 0.select (cognitive 95) · ×1
  • 0.select (cognitive 95) b4tm4n-toolz/database/adminer-4.5.0.php:1599 — 0.select has cognitive complexity 95 (threshold 15). Drivers by points: if/else 12 (43 pts), ternaries 7 (28 pts), loops 5 (17 pts), boolean chains 7 (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.select (cognitive 95) · ×1
  • 4.select (cognitive 95) php/twitter/adminer-4.2.4.php:1490 — 4.select has cognitive complexity 95 (threshold 15). Drivers by points: if/else 12 (43 pts), ternaries 7 (28 pts), loops 5 (17 pts), boolean chains 7 (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 0.actionFilesTools (cognitive 93) · ×1
  • 0.actionFilesTools (cognitive 93) php/wso/wso-4.2.0.php:415 — 0.actionFilesTools has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (69 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1.actionFilesTools (cognitive 93) · ×1
  • 1.actionFilesTools (cognitive 93) php/wso/wso-4.2.1.php:415 — 1.actionFilesTools has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (69 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 2.actionFilesTools (cognitive 93) · ×1
  • 2.actionFilesTools (cognitive 93) php/wso/wso-4.2.2.php:414 — 2.actionFilesTools has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (69 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.actionFilesTools (cognitive 93) · ×1
  • 3.actionFilesTools (cognitive 93) php/wso/wso-4.2.3.php:418 — 3.actionFilesTools has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (69 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.actionFilesTools (cognitive 93) · ×1
  • 4.actionFilesTools (cognitive 93) php/wso/wso-4.2.4.php:423 — 4.actionFilesTools has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (69 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.actionFilesTools (cognitive 93) · ×1
  • 5.actionFilesTools (cognitive 93) php/wso/wso-4.2.5.php:429 — 5.actionFilesTools has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (69 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · v.actionFilesTools (cognitive 93) · ×1
  • v.actionFilesTools (cognitive 93) php/zxc/.v.php:433 — v.actionFilesTools has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (69 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.input (cognitive 92) · ×1
  • 0.input (cognitive 92) b4tm4n-toolz/database/adminer-4.5.0.php:115 — 0.input has cognitive complexity 92 (threshold 15). Drivers by points: ternaries 16 (47 pts), if/else 12 (21 pts), boolean chains 19, loops 2 (5 pts) (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · fbi.select (cognitive 91) · ×1
  • fbi.select (cognitive 91) REDACTED:1313 — fbi.select has cognitive complexity 91 (threshold 15). Drivers by points: if/else 12 (43 pts), ternaries 7 (28 pts), loops 5 (17 pts), boolean chains 3 (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso2.actionFilesTools (cognitive 91) · ×1
  • wso2.actionFilesTools (cognitive 91) REDACTED:662 — wso2.actionFilesTools has cognitive complexity 91 (threshold 15). Drivers by points: if/else 29 (62 pts), loops 6 (17 pts), ternaries 2 (5 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · other-decode.actionFilesTools (cognitive 89) · ×1
  • other-decode.actionFilesTools (cognitive 89) REDACTED:789 — other-decode.actionFilesTools has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (65 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.actionFilesTools (cognitive 89) · ×1
  • 3.actionFilesTools (cognitive 89) php/wso/wso-4.1.3.php:415 — 3.actionFilesTools has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (65 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso2.actionFilesTools (cognitive 89) · ×1
  • wso2.actionFilesTools (cognitive 89) REDACTED:791 — wso2.actionFilesTools has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (65 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso_404.actionFilesTools (cognitive 89) · ×1
  • wso_404.actionFilesTools (cognitive 89) REDACTED:1232 — wso_404.actionFilesTools has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (65 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1.actionFilesTools (cognitive 89) · ×1
  • 1.actionFilesTools (cognitive 89) REDACTED:791 — 1.actionFilesTools has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (65 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.actionFilesTools (cognitive 89) · ×1
  • 5.actionFilesTools (cognitive 89) REDACTED:778 — 5.actionFilesTools has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (65 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.input (cognitive 87) · ×1
  • 4.input (cognitive 87) php/twitter/adminer-4.2.4.php:110 — 4.input has cognitive complexity 87 (threshold 15). Drivers by points: ternaries 16 (46 pts), if/else 11 (19 pts), boolean chains 17, loops 2 (5 pts) (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · g00nv13.sql (cognitive 87) · ×1
  • g00nv13.sql (cognitive 87) REDACTED:255 — g00nv13.sql has cognitive complexity 87 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 8 (36 pts), boolean chains 11, match/switch 1 (4 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WSO_4_0_5.actionFilesTools (cognitive 85) · ×1
  • WSO_4_0_5.actionFilesTools (cognitive 85) REDACTED:386 — WSO_4_0_5.actionFilesTools has cognitive complexity 85 (threshold 15). Drivers by points: if/else 30 (60 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso.actionFilesTools (cognitive 85) · ×1
  • wso.actionFilesTools (cognitive 85) REDACTED:686 — wso.actionFilesTools has cognitive complexity 85 (threshold 15). Drivers by points: if/else 30 (60 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 404.actionFilesTools (cognitive 85) · ×1
  • 404.actionFilesTools (cognitive 85) REDACTED:733 — 404.actionFilesTools has cognitive complexity 85 (threshold 15). Drivers by points: if/else 30 (60 pts), loops 6 (16 pts), match/switch 2 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Adminer.dumpData (cognitive 83) · ×1
  • Adminer.dumpData (cognitive 83) REDACTED:1244 — Adminer.dumpData has cognitive complexity 83 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 4 (19 pts), ternaries 4 (19 pts), boolean chains 3 (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · G5.wdll_nora (cognitive 83) · ×1
  • G5.wdll_nora (cognitive 83) REDACTED:315 — G5.wdll_nora has cognitive complexity 83 (threshold 15). Drivers by points: if/else 14 (60 pts), boolean chains 14, match/switch 2 (8 pts), loops 1 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso2.actionSql (cognitive 79) · ×1
  • wso2.actionSql (cognitive 79) REDACTED:1029 — wso2.actionSql has cognitive complexity 79 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 6 (26 pts), ternaries 6 (14 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Adminer.navigation (cognitive 76) · ×1
  • Adminer.navigation (cognitive 76) REDACTED:1254 — Adminer.navigation has cognitive complexity 76 (threshold 15). Drivers by points: if/else 12 (33 pts), ternaries 8 (21 pts), loops 5 (17 pts), boolean chains 5 (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · WSO_4_0_5.actionFilesMan (cognitive 73) · ×1
  • WSO_4_0_5.actionFilesMan (cognitive 73) REDACTED:712 — WSO_4_0_5.actionFilesMan has cognitive complexity 73 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 13 (20 pts), loops 6 (18 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso.actionFilesMan (cognitive 73) · ×1
  • wso.actionFilesMan (cognitive 73) REDACTED:468 — wso.actionFilesMan has cognitive complexity 73 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 13 (20 pts), loops 6 (18 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 404.actionFilesMan (cognitive 73) · ×1
  • 404.actionFilesMan (cognitive 73) REDACTED:505 — 404.actionFilesMan has cognitive complexity 73 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 13 (20 pts), loops 6 (18 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso2.actionFilesMan (cognitive 73) · ×1
  • wso2.actionFilesMan (cognitive 73) REDACTED:454 — wso2.actionFilesMan has cognitive complexity 73 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 13 (20 pts), loops 6 (18 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.rs (cognitive 71) · ×1
  • source.rs (cognitive 71) php/b374k/source/b374k-2.8.source.php:239 — source.rs has cognitive complexity 71 (threshold 15). Drivers by points: if/else 36 (68 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.edit_form (cognitive 69) · ×1
  • 0.edit_form (cognitive 69) b4tm4n-toolz/database/adminer-4.5.0.php:162 — 0.edit_form has cognitive complexity 69 (threshold 15). Drivers by points: ternaries 15 (37 pts), if/else 11 (22 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Customize.Request (cognitive 67) · ×1
  • Customize.Request (cognitive 67) aspx/httpHandlers_backdoor/Customize.cs:38 — Customize.Request has cognitive complexity 67 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · fbi.input (cognitive 67) · ×1
  • fbi.input (cognitive 67) REDACTED:314 — fbi.input has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 15 (42 pts), boolean chains 11, if/else 6 (9 pts), loops 2 (5 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Adminer.dumpTable (cognitive 66) · ×1
  • Adminer.dumpTable (cognitive 66) REDACTED:1202 — Adminer.dumpTable has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 12 (46 pts), if/else 6 (13 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.edit_form (cognitive 66) · ×1
  • 4.edit_form (cognitive 66) php/twitter/adminer-4.2.4.php:153 — 4.edit_form has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 14 (34 pts), if/else 11 (22 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.page_header (cognitive 65) · ×1
  • 0.page_header (cognitive 65) b4tm4n-toolz/database/adminer-4.5.0.php:1530 — 0.page_header has cognitive complexity 65 (threshold 15). Drivers by points: if/else 12 (25 pts), ternaries 9 (25 pts), boolean chains 9, loops 2 (6 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · itsec.querY (cognitive 62) · ×1
  • itsec.querY (cognitive 62) REDACTED:733 — itsec.querY has cognitive complexity 62 (threshold 15). Drivers by points: loops 10 (32 pts), if/else 13 (29 pts), match/switch 1 (nesting depth added 38). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · G5.sqlqu (cognitive 62) · ×1
  • G5.sqlqu (cognitive 62) REDACTED:1396 — G5.sqlqu has cognitive complexity 62 (threshold 15). Drivers by points: loops 10 (32 pts), if/else 13 (29 pts), match/switch 1 (nesting depth added 38). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · itsecteam_shell.querY (cognitive 62) · ×1
  • itsecteam_shell.querY (cognitive 62) REDACTED:733 — itsecteam_shell.querY has cognitive complexity 62 (threshold 15). Drivers by points: loops 10 (32 pts), if/else 13 (29 pts), match/switch 1 (nesting depth added 38). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · jHn.querY (cognitive 62) · ×1
  • jHn.querY (cognitive 62) REDACTED:714 — jHn.querY has cognitive complexity 62 (threshold 15). Drivers by points: loops 10 (32 pts), if/else 13 (29 pts), match/switch 1 (nesting depth added 38). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · fbi.page_header (cognitive 61) · ×1
  • fbi.page_header (cognitive 61) REDACTED:1274 — fbi.page_header has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 10 (26 pts), boolean chains 5, loops 1 (4 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.page_header (cognitive 59) · ×1
  • 4.page_header (cognitive 59) php/twitter/adminer-4.2.4.php:1432 — 4.page_header has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 9 (25 pts), if/else 11 (24 pts), boolean chains 6, loops 1 (4 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · project.show (cognitive 56) · ×1
  • project.show (cognitive 56) REDACTED:266 — project.show has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (33 pts), ternaries 10 (16 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DOC_ZIBSZXBIEG.do_passreturn (cognitive 55) · ×1
  • DOC_ZIBSZXBIEG.do_passreturn (cognitive 55) REDACTED:1408 — DOC_ZIBSZXBIEG.do_passreturn has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (35 pts), ternaries 3 (15 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PHPRemoteView.display_perms (cognitive 54) · ×1
  • PHPRemoteView.display_perms (cognitive 54) REDACTED:490 — PHPRemoteView.display_perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SnIpEr_SA Shell.perms (cognitive 54) · ×1
  • SnIpEr_SA Shell.perms (cognitive 54) REDACTED:1231 — SnIpEr_SA Shell.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · r57shell.perms (cognitive 54) · ×1
  • r57shell.perms (cognitive 54) REDACTED:1207 — r57shell.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · r57shell127.perms (cognitive 54) · ×1
  • r57shell127.perms (cognitive 54) REDACTED:1051 — r57shell127.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · r57_Mohajer22.perms (cognitive 54) · ×1
  • r57_Mohajer22.perms (cognitive 54) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1319 — r57_Mohajer22.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · r57_iFX.perms (cognitive 54) · ×1
  • r57_iFX.perms (cognitive 54) php/PHPshell/【r57_iFX】/r57_iFX.php:828 — r57_iFX.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · r57_kartal.perms (cognitive 54) · ×1
  • r57_kartal.perms (cognitive 54) php/PHPshell/【r57_karta】/r57_kartal.php:799 — r57_kartal.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Agent.perms (cognitive 54) · ×1
  • Agent.perms (cognitive 54) REDACTED:1222 — Agent.perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · remview_fix.display_perms (cognitive 54) · ×1
  • remview_fix.display_perms (cognitive 54) REDACTED:490 — remview_fix.display_perms has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (39 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.lang (cognitive 53) · ×1
  • 0.lang (cognitive 53) b4tm4n-toolz/database/adminer-4.5.0.php:170 — 0.lang has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 18 (35 pts), boolean chains 13, if/else 4 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Crystal.perms (cognitive 53) · ×1
  • Crystal.perms (cognitive 53) REDACTED:603 — Crystal.perms has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (38 pts), ternaries 12 (15 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.lang (cognitive 53) · ×1
  • 4.lang (cognitive 53) php/twitter/adminer-4.2.4.php:161 — 4.lang has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 18 (35 pts), boolean chains 13, if/else 4 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · itsec.sqlclienT (cognitive 50) · ×1
  • itsec.sqlclienT (cognitive 50) REDACTED:616 — itsec.sqlclienT has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (36 pts), loops 4 (9 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · other-decode.actionSecInfo (cognitive 50) · ×1
  • other-decode.actionSecInfo (cognitive 50) REDACTED:390 — other-decode.actionSecInfo has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (13 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso2.actionSecInfo (cognitive 50) · ×1
  • wso2.actionSecInfo (cognitive 50) REDACTED:392 — wso2.actionSecInfo has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (13 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 1.actionSecInfo (cognitive 50) · ×1
  • 1.actionSecInfo (cognitive 50) REDACTED:392 — 1.actionSecInfo has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (13 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · itsecteam_shell.sqlclienT (cognitive 50) · ×1
  • itsecteam_shell.sqlclienT (cognitive 50) REDACTED:616 — itsecteam_shell.sqlclienT has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (36 pts), loops 4 (9 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · jHn.sqlclienT (cognitive 50) · ×1
  • jHn.sqlclienT (cognitive 50) REDACTED:597 — jHn.sqlclienT has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (36 pts), loops 4 (9 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.actionSecInfo (cognitive 50) · ×1
  • 5.actionSecInfo (cognitive 50) REDACTED:379 — 5.actionSecInfo has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (13 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · WSO_4_0_5.actionSecInfo (cognitive 49) · ×1
  • WSO_4_0_5.actionSecInfo (cognitive 49) REDACTED:306 — WSO_4_0_5.actionSecInfo has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 4 (13 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · g00nv13.files (cognitive 49) · ×1
  • g00nv13.files (cognitive 49) REDACTED:433 — g00nv13.files has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 3 (12 pts), loops 4 (7 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Adminer.selectSearchProcess (cognitive 48) · ×1
  • Adminer.selectSearchProcess (cognitive 48) b4tm4n-toolz/database/adminer-4.5.0.php:1479 — Adminer.selectSearchProcess has cognitive complexity 48 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 4 (17 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · source.showdir (cognitive 48) · ×1
  • source.showdir (cognitive 48) REDACTED:522 — source.showdir has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 4 (8 pts), boolean chains 6, ternaries 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fbi.lang (cognitive 48) · ×1
  • fbi.lang (cognitive 48) REDACTED:335 — fbi.lang has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 18 (35 pts), boolean chains 11, if/else 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 2.showdir (cognitive 47) · ×1
  • 2.showdir (cognitive 47) REDACTED:355 — 2.showdir has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1n73ction.showdir (cognitive 47) · ×1
  • 1n73ction.showdir (cognitive 47) REDACTED:242 — 1n73ction.showdir has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · shell.showdir (cognitive 47) · ×1
  • shell.showdir (cognitive 47) REDACTED:264 — shell.showdir has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · metaslsoft.showdir (cognitive 47) · ×1
  • metaslsoft.showdir (cognitive 47) REDACTED:351 — metaslsoft.showdir has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.showdir (cognitive 46) · ×1
  • source.showdir (cognitive 46) REDACTED:471 — source.showdir has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 4 (8 pts), boolean chains 6, ternaries 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.check_access (cognitive 46) · ×1
  • source.check_access (cognitive 46) php/b374k/source/b374k-2.8.source.php:553 — source.check_access has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (45 pts), match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fbi.edit_fields (cognitive 46) · ×1
  • fbi.edit_fields (cognitive 46) REDACTED:1329 — fbi.edit_fields has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 14 (30 pts), if/else 5 (9 pts), boolean chains 6, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · other-decode.actionBruteforce (cognitive 46) · ×1
  • other-decode.actionBruteforce (cognitive 46) REDACTED:1036 — other-decode.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Adminer.selectSearchProcess (cognitive 46) · ×1
  • Adminer.selectSearchProcess (cognitive 46) php/twitter/adminer-4.2.4.php:1383 — Adminer.selectSearchProcess has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 4 (17 pts), if/else 6 (16 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · WSO_4_0_5.actionBruteforce (cognitive 46) · ×1
  • WSO_4_0_5.actionBruteforce (cognitive 46) REDACTED:1108 — WSO_4_0_5.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 0.actionBruteforce (cognitive 46) · ×1
  • 0.actionBruteforce (cognitive 46) php/wso/wso-4.2.0.php:1142 — 0.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 2.actionBruteforce (cognitive 46) · ×1
  • 2.actionBruteforce (cognitive 46) php/wso/wso-4.2.2.php:1137 — 2.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.actionBruteforce (cognitive 46) · ×1
  • 4.actionBruteforce (cognitive 46) php/wso/wso-4.2.4.php:1146 — 4.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso.actionBruteforce (cognitive 46) · ×1
  • wso.actionBruteforce (cognitive 46) REDACTED:1044 — wso.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso_404.actionBruteforce (cognitive 46) · ×1
  • wso_404.actionBruteforce (cognitive 46) REDACTED:1524 — wso_404.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · v.actionBruteforce (cognitive 46) · ×1
  • v.actionBruteforce (cognitive 46) php/zxc/.v.php:1152 — v.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 404.actionBruteforce (cognitive 46) · ×1
  • 404.actionBruteforce (cognitive 46) REDACTED:1042 — 404.actionBruteforce has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (14 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · source.check_access (cognitive 45) · ×1
  • source.check_access (cognitive 45) REDACTED:492 — source.check_access has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (44 pts), match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.edit_fields (cognitive 44) · ×1
  • 0.edit_fields (cognitive 44) b4tm4n-toolz/database/adminer-4.5.0.php:1615 — 0.edit_fields has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 13 (28 pts), if/else 5 (9 pts), boolean chains 6, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.connect_error (cognitive 44) · ×1
  • 0.connect_error (cognitive 44) b4tm4n-toolz/database/adminer-4.5.0.php:1649 — 0.connect_error has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 8 (29 pts), if/else 5 (9 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.exe (cognitive 44) · ×1
  • 4.exe (cognitive 44) REDACTED:247 — 4.exe has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (12 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Adminer.selectSearchProcess (cognitive 44) · ×1
  • Adminer.selectSearchProcess (cognitive 44) REDACTED:1184 — Adminer.selectSearchProcess has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 4 (17 pts), if/else 6 (16 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.edit_fields (cognitive 44) · ×1
  • 4.edit_fields (cognitive 44) php/twitter/adminer-4.2.4.php:1506 — 4.edit_fields has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 13 (28 pts), if/else 5 (9 pts), boolean chains 6, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.connect_error (cognitive 44) · ×1
  • 4.connect_error (cognitive 44) php/twitter/adminer-4.2.4.php:1545 — 4.connect_error has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 8 (29 pts), if/else 5 (9 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · G5.wdll_dbc (cognitive 43) · ×1
  • G5.wdll_dbc (cognitive 43) REDACTED:1470 — G5.wdll_dbc has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 3 (15 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · yaps.run_cmd (cognitive 42) · ×1
  • yaps.run_cmd (cognitive 42) REDACTED:211 — yaps.run_cmd has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 2 (11 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · aioshell.show_attr_file (cognitive 42) · ×1
  • aioshell.show_attr_file (cognitive 42) REDACTED:264 — aioshell.show_attr_file has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 3.rs (cognitive 41) · ×1
  • 3.rs (cognitive 41) REDACTED:118 — 3.rs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.exe (cognitive 41) · ×1
  • 3.exe (cognitive 41) REDACTED:215 — 3.exe has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 4 (11 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.rs (cognitive 41) · ×1
  • 4.rs (cognitive 41) REDACTED:137 — 4.rs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.rs (cognitive 41) · ×1
  • source.rs (cognitive 41) REDACTED:141 — source.rs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · admine21_decode.antivirus (cognitive 40) · ×1
  • admine21_decode.antivirus (cognitive 40) REDACTED:121 — admine21_decode.antivirus has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.showdir (cognitive 40) · ×1
  • 4.showdir (cognitive 40) REDACTED:467 — 4.showdir has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (8 pts), boolean chains 4, ternaries 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · phpspy_2005_full.sqldumptable (cognitive 39) · ×1
  • phpspy_2005_full.sqldumptable (cognitive 39) REDACTED:1120 — phpspy_2005_full.sqldumptable has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · hkrkoz.sqldumptable (cognitive 39) · ×1
  • hkrkoz.sqldumptable (cognitive 39) REDACTED:643 — hkrkoz.sqldumptable has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pHp一句话扫描脚本程序.antivirus (cognitive 38) · ×1
  • pHp一句话扫描脚本程序.antivirus (cognitive 38) php/pHp一句话扫描脚本程序.php:36 — pHp一句话扫描脚本程序.antivirus has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.showdir (cognitive 37) · ×1
  • 3.showdir (cognitive 37) REDACTED:424 — 3.showdir has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (9 pts), boolean chains 5, ternaries 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.actionSecInfo (cognitive 36) · ×1
  • 0.actionSecInfo (cognitive 36) php/wso/wso-4.2.0.php:345 — 0.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1.actionSecInfo (cognitive 36) · ×1
  • 1.actionSecInfo (cognitive 36) php/wso/wso-4.2.1.php:345 — 1.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 2.actionSecInfo (cognitive 36) · ×1
  • 2.actionSecInfo (cognitive 36) php/wso/wso-4.2.2.php:344 — 2.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.actionSecInfo (cognitive 36) · ×1
  • 4.actionSecInfo (cognitive 36) php/wso/wso-4.2.4.php:353 — 4.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.actionSecInfo (cognitive 36) · ×1
  • 5.actionSecInfo (cognitive 36) php/wso/wso-4.2.5.php:359 — 5.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso_404.actionSecInfo (cognitive 36) · ×1
  • wso_404.actionSecInfo (cognitive 36) REDACTED:392 — wso_404.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · v.actionSecInfo (cognitive 36) · ×1
  • v.actionSecInfo (cognitive 36) php/zxc/.v.php:363 — v.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso2.actionSecInfo (cognitive 36) · ×1
  • wso2.actionSecInfo (cognitive 36) REDACTED:365 — wso2.actionSecInfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 8 (10 pts), loops 3 (9 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · devilzShell.xrunexploit (cognitive 35) · ×1
  • devilzShell.xrunexploit (cognitive 35) REDACTED:600 — devilzShell.xrunexploit has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (35 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso.actionSecInfo (cognitive 35) · ×1
  • wso.actionSecInfo (cognitive 35) REDACTED:366 — wso.actionSecInfo has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 404.actionSecInfo (cognitive 35) · ×1
  • 404.actionSecInfo (cognitive 35) REDACTED:396 — 404.actionSecInfo has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · G5.sqlexp (cognitive 35) · ×1
  • G5.sqlexp (cognitive 35) REDACTED:1365 — G5.sqlexp has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (9 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Private-i3lue.tree_showtree (cognitive 35) · ×1
  • Private-i3lue.tree_showtree (cognitive 35) REDACTED:915 — Private-i3lue.tree_showtree has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24 (32 pts), loops 2 (3 pts) (nesting depth added 9). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · angel大马.GetSFileList (cognitive 34) · ×1
  • angel大马.GetSFileList (cognitive 34) php/angel大马.php:1939 — angel大马.GetSFileList has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · spy.GetSFileList (cognitive 34) · ×1
  • spy.GetSFileList (cognitive 34) REDACTED:1936 — spy.GetSFileList has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · devilzShell.xdir (cognitive 33) · ×1
  • devilzShell.xdir (cognitive 33) REDACTED:688 — devilzShell.xdir has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (11 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · admine21_decode.backshell (cognitive 33) · ×1
  • admine21_decode.backshell (cognitive 33) REDACTED:182 — admine21_decode.backshell has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 1 (4 pts), ternaries 1 (4 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · angel大马.multi (cognitive 33) · ×1
  • angel大马.multi (cognitive 33) php/angel大马.php:1614 — angel大马.multi has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 6 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · spy.multi (cognitive 33) · ×1
  • spy.multi (cognitive 33) REDACTED:1611 — spy.multi has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 6 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · DOC_ZIBSZXBIEG.TestUtf8 (cognitive 33) · ×1
  • DOC_ZIBSZXBIEG.TestUtf8 (cognitive 33) REDACTED:1297 — DOC_ZIBSZXBIEG.TestUtf8 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 免杀php大马.TestUtf8 (cognitive 33) · ×1
  • 免杀php大马.TestUtf8 (cognitive 33) www-7jyewu-cn/免杀php大马.php:1297 — 免杀php大马.TestUtf8 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 最新过安全狗- 免杀PHP大马 -.TestUtf8 (cognitive 33) · ×1
  • 最新过安全狗- 免杀PHP大马 -.TestUtf8 (cognitive 33) www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1297 — 最新过安全狗- 免杀PHP大马 -.TestUtf8 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · admine21_decode.scanfile (cognitive 32) · ×1
  • admine21_decode.scanfile (cognitive 32) REDACTED:99 — admine21_decode.scanfile has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (9 pts), boolean chains 4, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · aioshell.run_proxy_core (cognitive 31) · ×1
  • aioshell.run_proxy_core (cognitive 31) REDACTED:519 — aioshell.run_proxy_core has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · yaps.sysinfo (cognitive 29) · ×1
  • yaps.sysinfo (cognitive 29) REDACTED:256 — yaps.sysinfo has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 7 (9 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.sql_connect (cognitive 28) · ×1
  • 4.sql_connect (cognitive 28) REDACTED:631 — 4.sql_connect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (28 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · yaps.infect (cognitive 27) · ×1
  • yaps.infect (cognitive 27) REDACTED:761 — yaps.infect has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 5 (11 pts), loops 3, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WSO_4_0_5.printHeader (cognitive 27) · ×1
  • WSO_4_0_5.printHeader (cognitive 27) REDACTED:57 — WSO_4_0_5.printHeader has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 9 (10 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · wso.printHeader (cognitive 27) · ×1
  • wso.printHeader (cognitive 27) REDACTED:118 — wso.printHeader has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 9 (10 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 404.printHeader (cognitive 27) · ×1
  • 404.printHeader (cognitive 27) REDACTED:128 — 404.printHeader has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 9 (10 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · PHPZip.PHPZip (cognitive 27) · ×1
  • PHPZip.PHPZip (cognitive 27) REDACTED:505 — PHPZip.PHPZip has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · wso2.actionSafeMode (cognitive 27) · ×1
  • wso2.actionSafeMode (cognitive 27) REDACTED:819 — wso2.actionSafeMode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (7 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · back.action (cognitive 27) · ×1
  • back.action (cognitive 27) REDACTED:9 — back.action has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), error handling 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · yaps.select_files (cognitive 26) · ×1
  • yaps.select_files (cognitive 26) REDACTED:666 — yaps.select_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (10 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DB_MySQL.sqldump (cognitive 26) · ×1
  • DB_MySQL.sqldump (cognitive 26) php/phpspy/2013未加密.php:1550 — DB_MySQL.sqldump has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso_404.actionphptools (cognitive 26) · ×1
  • wso_404.actionphptools (cognitive 26) REDACTED:829 — wso_404.actionphptools has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Private-i3lue.octtostr (cognitive 26) · ×1
  • Private-i3lue.octtostr (cognitive 26) REDACTED:1312 — Private-i3lue.octtostr has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 12 (18 pts), if/else 8 (nesting depth added 6). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · 5.wsoHeader (cognitive 26) · ×1
  • 5.wsoHeader (cognitive 26) REDACTED:123 — 5.wsoHeader has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · wso2.printHeader (cognitive 26) · ×1
  • wso2.printHeader (cognitive 26) REDACTED:132 — wso2.printHeader has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 7 (9 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · r57shell127.DirPrintHTMLHeaders (cognitive 25) · ×1
  • r57shell127.DirPrintHTMLHeaders (cognitive 25) REDACTED:1198 — r57shell127.DirPrintHTMLHeaders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57_iFX.DirPrintHTMLHeaders (cognitive 25) · ×1
  • r57_iFX.DirPrintHTMLHeaders (cognitive 25) php/PHPshell/【r57_iFX】/r57_iFX.php:975 — r57_iFX.DirPrintHTMLHeaders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57_kartal.DirPrintHTMLHeaders (cognitive 25) · ×1
  • r57_kartal.DirPrintHTMLHeaders (cognitive 25) php/PHPshell/【r57_karta】/r57_kartal.php:946 — r57_kartal.DirPrintHTMLHeaders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57.DirPrintHTMLHeaders (cognitive 25) · ×1
  • r57.DirPrintHTMLHeaders (cognitive 25) php/PHPshell/【r57】/r57.php:1203 — r57.DirPrintHTMLHeaders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · project.disk (cognitive 25) · ×1
  • project.disk (cognitive 25) REDACTED:817 — project.disk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · other-decode.wsoHeader (cognitive 25) · ×1
  • other-decode.wsoHeader (cognitive 25) REDACTED:133 — other-decode.wsoHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 0.hardHeader (cognitive 25) · ×1
  • 0.hardHeader (cognitive 25) php/wso/wso-4.2.0.php:73 — 0.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 1.hardHeader (cognitive 25) · ×1
  • 1.hardHeader (cognitive 25) php/wso/wso-4.2.1.php:73 — 1.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 2.hardHeader (cognitive 25) · ×1
  • 2.hardHeader (cognitive 25) php/wso/wso-4.2.2.php:72 — 2.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 4.hardHeader (cognitive 25) · ×1
  • 4.hardHeader (cognitive 25) php/wso/wso-4.2.4.php:77 — 4.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 5.hardHeader (cognitive 25) · ×1
  • 5.hardHeader (cognitive 25) php/wso/wso-4.2.5.php:77 — 5.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · wso2.wsoHeader (cognitive 25) · ×1
  • wso2.wsoHeader (cognitive 25) REDACTED:135 — wso2.wsoHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 1.wsoHeader (cognitive 25) · ×1
  • 1.wsoHeader (cognitive 25) REDACTED:135 — 1.wsoHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · v.hardHeader (cognitive 25) · ×1
  • v.hardHeader (cognitive 25) php/zxc/.v.php:80 — v.hardHeader has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Private-i3lue.sortfield (cognitive 25) · ×1
  • Private-i3lue.sortfield (cognitive 25) REDACTED:1333 — Private-i3lue.sortfield has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 6 (8 pts), boolean chains 4 (nesting depth added 10). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · DOC_ZIBSZXBIEG.File_Act (cognitive 25) · ×1
  • DOC_ZIBSZXBIEG.File_Act (cognitive 25) REDACTED:1612 — DOC_ZIBSZXBIEG.File_Act has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DOC_ZIBSZXBIEG.GetHtml (cognitive 25) · ×1
  • DOC_ZIBSZXBIEG.GetHtml (cognitive 25) REDACTED:1804 — DOC_ZIBSZXBIEG.GetHtml has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 免杀php大马.GetHtml (cognitive 25) · ×1
  • 免杀php大马.GetHtml (cognitive 25) www-7jyewu-cn/免杀php大马.php:1804 — 免杀php大马.GetHtml has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 最新过安全狗- 免杀PHP大马 -.GetHtml (cognitive 25) · ×1
  • 最新过安全狗- 免杀PHP大马 -.GetHtml (cognitive 25) www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1804 — 最新过安全狗- 免杀PHP大马 -.GetHtml has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Chropper.doPost (cognitive 25) · ×1
  • Chropper.doPost (cognitive 25) REDACTED:268 — Chropper.doPost has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (19 pts), ternaries 2 (3 pts), loops 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · SnIpEr_SA Shell.DirFilesR (cognitive 24) · ×1
  • SnIpEr_SA Shell.DirFilesR (cognitive 24) REDACTED:1297 — SnIpEr_SA Shell.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57shell.DirFilesR (cognitive 24) · ×1
  • r57shell.DirFilesR (cognitive 24) REDACTED:1272 — r57shell.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57shell127.DirFilesR (cognitive 24) · ×1
  • r57shell127.DirFilesR (cognitive 24) REDACTED:1169 — r57shell127.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57_Mohajer22.DirFilesR (cognitive 24) · ×1
  • r57_Mohajer22.DirFilesR (cognitive 24) php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1384 — r57_Mohajer22.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57_iFX.DirFilesR (cognitive 24) · ×1
  • r57_iFX.DirFilesR (cognitive 24) php/PHPshell/【r57_iFX】/r57_iFX.php:946 — r57_iFX.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57_kartal.DirFilesR (cognitive 24) · ×1
  • r57_kartal.DirFilesR (cognitive 24) php/PHPshell/【r57_karta】/r57_kartal.php:917 — r57_kartal.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · angel大马.makeselect (cognitive 24) · ×1
  • angel大马.makeselect (cognitive 24) php/angel大马.php:2070 — angel大马.makeselect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (6 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.zip (cognitive 24) · ×1
  • 3.zip (cognitive 24) REDACTED:339 — 3.zip has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.zip (cognitive 24) · ×1
  • 4.zip (cognitive 24) REDACTED:381 — 4.zip has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · source.zip (cognitive 24) · ×1
  • source.zip (cognitive 24) REDACTED:385 — source.zip has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · spy.makeselect (cognitive 24) · ×1
  • spy.makeselect (cognitive 24) REDACTED:2064 — spy.makeselect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (6 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Agent.DirFilesR (cognitive 24) · ×1
  • Agent.DirFilesR (cognitive 24) REDACTED:1288 — Agent.DirFilesR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57shell127.DirFiles (cognitive 23) · ×1
  • r57shell127.DirFiles (cognitive 23) REDACTED:1116 — r57shell127.DirFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57_iFX.DirFiles (cognitive 23) · ×1
  • r57_iFX.DirFiles (cognitive 23) php/PHPshell/【r57_iFX】/r57_iFX.php:893 — r57_iFX.DirFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57_kartal.DirFiles (cognitive 23) · ×1
  • r57_kartal.DirFiles (cognitive 23) php/PHPshell/【r57_karta】/r57_kartal.php:864 — r57_kartal.DirFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · r57.DirFiles (cognitive 23) · ×1
  • r57.DirFiles (cognitive 23) php/PHPshell/【r57】/r57.php:1121 — r57.DirFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · admine21_decode.command (cognitive 23) · ×1
  • admine21_decode.command (cognitive 23) REDACTED:152 — admine21_decode.command has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (5 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.sql_field_name (cognitive 23) · ×1
  • 4.sql_field_name (cognitive 23) REDACTED:692 — 4.sql_field_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (23 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso_404.wsoHeader (cognitive 23) · ×1
  • wso_404.wsoHeader (cognitive 23) REDACTED:143 — wso_404.wsoHeader has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 7 (8 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 0.select_value (cognitive 22) · ×1
  • 0.select_value (cognitive 22) b4tm4n-toolz/database/adminer-4.5.0.php:140 — 0.select_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · yaps.passwd (cognitive 22) · ×1
  • yaps.passwd (cognitive 22) REDACTED:528 — yaps.passwd has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), match/switch 2 (6 pts), if/else 3 (4 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · 4.gp (cognitive 22) · ×1
  • 4.gp (cognitive 22) REDACTED:223 — 4.gp has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fbi.connect_error (cognitive 22) · ×1
  • fbi.connect_error (cognitive 22) REDACTED:1311 — fbi.connect_error has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (5 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.select_value (cognitive 22) · ×1
  • 4.select_value (cognitive 22) php/twitter/adminer-4.2.4.php:132 — 4.select_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MailmanProxy.process_message (cognitive 22) · ×1
  • MailmanProxy.process_message (cognitive 22) py/smtpd.py:377 — MailmanProxy.process_message has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PHPRemoteView.up (cognitive 21) · ×1
  • PHPRemoteView.up (cognitive 21) REDACTED:547 — PHPRemoteView.up has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · remview_fix.up (cognitive 21) · ×1
  • remview_fix.up (cognitive 21) REDACTED:547 — remview_fix.up has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · SMTPChannel.found_terminator (cognitive 21) · ×1
  • SMTPChannel.found_terminator (cognitive 21) py/smtpd.py:138 — SMTPChannel.found_terminator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · angel大马.getPerms (cognitive 20) · ×1
  • angel大马.getPerms (cognitive 20) php/angel大马.php:1771 — angel大马.getPerms has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (15 pts), if/else 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 2.gp (cognitive 20) · ×1
  • 2.gp (cognitive 20) REDACTED:254 — 2.gp has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.gp (cognitive 20) · ×1
  • 3.gp (cognitive 20) REDACTED:198 — 3.gp has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.sql_num_rows (cognitive 20) · ×1
  • 4.sql_num_rows (cognitive 20) REDACTED:729 — 4.sql_num_rows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fbi.process_fields (cognitive 20) · ×1
  • fbi.process_fields (cognitive 20) REDACTED:1342 — fbi.process_fields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · itsec.dirpmass (cognitive 20) · ×1
  • itsec.dirpmass (cognitive 20) REDACTED:231 — itsec.dirpmass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 2013未加密.getPerms (cognitive 20) · ×1
  • 2013未加密.getPerms (cognitive 20) php/phpspy/2013未加密.php:1216 — 2013未加密.getPerms has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (15 pts), if/else 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · spy.getPerms (cognitive 20) · ×1
  • spy.getPerms (cognitive 20) REDACTED:1768 — spy.getPerms has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (15 pts), if/else 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 1n73ction.get_perms (cognitive 20) · ×1
  • 1n73ction.get_perms (cognitive 20) REDACTED:480 — 1n73ction.get_perms has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · shell.get_perms (cognitive 20) · ×1
  • shell.get_perms (cognitive 20) REDACTED:502 — shell.get_perms has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Private-i3lue.remove (cognitive 20) · ×1
  • Private-i3lue.remove (cognitive 20) REDACTED:679 — Private-i3lue.remove has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 8). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · g00nv13.sqldownload (cognitive 20) · ×1
  • g00nv13.sqldownload (cognitive 20) REDACTED:355 — g00nv13.sqldownload has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FORMS.makeselect (cognitive 20) · ×1
  • FORMS.makeselect (cognitive 20) REDACTED:829 — FORMS.makeselect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · itsecteam_shell.dirpmass (cognitive 20) · ×1
  • itsecteam_shell.dirpmass (cognitive 20) REDACTED:231 — itsecteam_shell.dirpmass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · jHn.dirpmass (cognitive 20) · ×1
  • jHn.dirpmass (cognitive 20) REDACTED:212 — jHn.dirpmass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · metaslsoft.gp (cognitive 20) · ×1
  • metaslsoft.gp (cognitive 20) REDACTED:250 — metaslsoft.gp has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Chropper.QQ (cognitive 20) · ×1
  • Chropper.QQ (cognitive 20) REDACTED:217 — Chropper.QQ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), error handling 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.process_input (cognitive 19) · ×1
  • 0.process_input (cognitive 19) b4tm4n-toolz/database/adminer-4.5.0.php:119 — 0.process_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.search_tables (cognitive 19) · ×1
  • 0.search_tables (cognitive 19) b4tm4n-toolz/database/adminer-4.5.0.php:127 — 0.search_tables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · project.authentication (cognitive 19) · ×1
  • project.authentication (cognitive 19) REDACTED:861 — project.authentication has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Adminer.editFunctions (cognitive 19) · ×1
  • Adminer.editFunctions (cognitive 19) REDACTED:1193 — Adminer.editFunctions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fbi.auth_error (cognitive 19) · ×1
  • fbi.auth_error (cognitive 19) REDACTED:1310 — fbi.auth_error has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 4 (7 pts), boolean chains 4 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.process_input (cognitive 19) · ×1
  • 4.process_input (cognitive 19) php/twitter/adminer-4.2.4.php:113 — 4.process_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.search_tables (cognitive 19) · ×1
  • 4.search_tables (cognitive 19) php/twitter/adminer-4.2.4.php:121 — 4.search_tables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WSO_4_0_5.actionSafeMode (cognitive 19) · ×1
  • WSO_4_0_5.actionSafeMode (cognitive 19) REDACTED:957 — WSO_4_0_5.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.actionSafeMode (cognitive 19) · ×1
  • 0.actionSafeMode (cognitive 19) php/wso/wso-4.2.0.php:1036 — 0.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1.actionSafeMode (cognitive 19) · ×1
  • 1.actionSafeMode (cognitive 19) php/wso/wso-4.2.1.php:1032 — 1.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 2.actionSafeMode (cognitive 19) · ×1
  • 2.actionSafeMode (cognitive 19) php/wso/wso-4.2.2.php:1031 — 2.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.actionSafeMode (cognitive 19) · ×1
  • 4.actionSafeMode (cognitive 19) php/wso/wso-4.2.4.php:1040 — 4.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.actionSafeMode (cognitive 19) · ×1
  • 5.actionSafeMode (cognitive 19) php/wso/wso-4.2.5.php:1046 — 5.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso.actionSafeMode (cognitive 19) · ×1
  • wso.actionSafeMode (cognitive 19) REDACTED:837 — wso.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · v.actionSafeMode (cognitive 19) · ×1
  • v.actionSafeMode (cognitive 19) php/zxc/.v.php:1043 — v.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 404.actionSafeMode (cognitive 19) · ×1
  • 404.actionSafeMode (cognitive 19) REDACTED:897 — 404.actionSafeMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.optionlist (cognitive 18) · ×1
  • 0.optionlist (cognitive 18) b4tm4n-toolz/database/adminer-4.5.0.php:37 — 0.optionlist has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.process_fields (cognitive 18) · ×1
  • 0.process_fields (cognitive 18) b4tm4n-toolz/database/adminer-4.5.0.php:1623 — 0.process_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.sql_query (cognitive 18) · ×1
  • 4.sql_query (cognitive 18) REDACTED:660 — 4.sql_query has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · source.check_access (cognitive 18) · ×1
  • source.check_access (cognitive 18) REDACTED:455 — source.check_access has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · source.clean (cognitive 18) · ×1
  • source.clean (cognitive 18) php/b374k/source/b374k-2.8.source.php:133 — source.clean has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 1 (5 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · fbi.optionlist (cognitive 18) · ×1
  • fbi.optionlist (cognitive 18) REDACTED:249 — fbi.optionlist has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · other-decode.actionStringTools (cognitive 18) · ×1
  • other-decode.actionStringTools (cognitive 18) REDACTED:703 — other-decode.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · 4.optionlist (cognitive 18) · ×1
  • 4.optionlist (cognitive 18) php/twitter/adminer-4.2.4.php:33 — 4.optionlist has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.process_fields (cognitive 18) · ×1
  • 4.process_fields (cognitive 18) php/twitter/adminer-4.2.4.php:1519 — 4.process_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · upsi1on.fix_data (cognitive 18) · ×1
  • upsi1on.fix_data (cognitive 18) REDACTED:501 — upsi1on.fix_data has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · WSO_4_0_5.actionStringTools (cognitive 18) · ×1
  • WSO_4_0_5.actionStringTools (cognitive 18) REDACTED:867 — WSO_4_0_5.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · 0.actionStringTools (cognitive 18) · ×1
  • 0.actionStringTools (cognitive 18) php/wso/wso-4.2.0.php:947 — 0.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · 2.actionStringTools (cognitive 18) · ×1
  • 2.actionStringTools (cognitive 18) php/wso/wso-4.2.2.php:942 — 2.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · 4.actionStringTools (cognitive 18) · ×1
  • 4.actionStringTools (cognitive 18) php/wso/wso-4.2.4.php:952 — 4.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · wso2.actionStringTools (cognitive 18) · ×1
  • wso2.actionStringTools (cognitive 18) REDACTED:705 — wso2.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · wso_404.actionStringTools (cognitive 18) · ×1
  • wso_404.actionStringTools (cognitive 18) REDACTED:1143 — wso_404.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · v.actionStringTools (cognitive 18) · ×1
  • v.actionStringTools (cognitive 18) php/zxc/.v.php:960 — v.actionStringTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · G5.md (cognitive 18) · ×1
  • G5.md (cognitive 18) REDACTED:279 — G5.md has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cihshell_fix.do_header (cognitive 18) · ×1
  • cihshell_fix.do_header (cognitive 18) REDACTED:154 — cihshell_fix.do_header has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 1, loops 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 0.auth_error (cognitive 17) · ×1
  • 0.auth_error (cognitive 17) b4tm4n-toolz/database/adminer-4.5.0.php:1597 — 0.auth_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · yaps.connect (cognitive 17) · ×1
  • yaps.connect (cognitive 17) REDACTED:858 — yaps.connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · aioshell.get_human_file_perms (cognitive 17) · ×1
  • aioshell.get_human_file_perms (cognitive 17) REDACTED:122 — aioshell.get_human_file_perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · angel大马.GetWFileList (cognitive 17) · ×1
  • angel大马.GetWFileList (cognitive 17) php/angel大马.php:1908 — angel大马.GetWFileList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.get_writabledir (cognitive 17) · ×1
  • 3.get_writabledir (cognitive 17) REDACTED:328 — 3.get_writabledir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (17 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.get_writabledir (cognitive 17) · ×1
  • 4.get_writabledir (cognitive 17) REDACTED:370 — 4.get_writabledir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (17 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · 4.sql_num_fields (cognitive 17) · ×1
  • 4.sql_num_fields (cognitive 17) REDACTED:679 — 4.sql_num_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (4.sql_fetch_data, 4.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · 4.sql_fetch_data (cognitive 17) · ×1
  • 4.sql_fetch_data (cognitive 17) REDACTED:716 — 4.sql_fetch_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (4.sql_num_fields, 4.sql_close) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · 4.sql_close (cognitive 17) · ×1
  • 4.sql_close (cognitive 17) REDACTED:747 — 4.sql_close has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (4.sql_num_fields, 4.sql_fetch_data) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · project.getperms (cognitive 17) · ×1
  • project.getperms (cognitive 17) REDACTED:934 — project.getperms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · itsec.bywsym (cognitive 17) · ×1
  • itsec.bywsym (cognitive 17) REDACTED:808 — itsec.bywsym has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · other-decode.wsoPerms (cognitive 17) · ×1
  • other-decode.wsoPerms (cognitive 17) REDACTED:342 — other-decode.wsoPerms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · other-decode.actionConsole (cognitive 17) · ×1
  • other-decode.actionConsole (cognitive 17) REDACTED:946 — other-decode.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · spy.GetWFileList (cognitive 17) · ×1
  • spy.GetWFileList (cognitive 17) REDACTED:1905 — spy.GetWFileList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.auth_error (cognitive 17) · ×1
  • 4.auth_error (cognitive 17) php/twitter/adminer-4.2.4.php:1488 — 4.auth_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · qyt0dHv1.perms (cognitive 17) · ×1
  • qyt0dHv1.perms (cognitive 17) REDACTED:247 — qyt0dHv1.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · upsi1on.perms (cognitive 17) · ×1
  • upsi1on.perms (cognitive 17) REDACTED:658 — upsi1on.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · WSO_4_0_5.perms (cognitive 17) · ×1
  • WSO_4_0_5.perms (cognitive 17) REDACTED:262 — WSO_4_0_5.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · WSO_4_0_5.actionConsole (cognitive 17) · ×1
  • WSO_4_0_5.actionConsole (cognitive 17) REDACTED:602 — WSO_4_0_5.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.perms (cognitive 17) · ×1
  • 0.perms (cognitive 17) php/wso/wso-4.2.0.php:284 — 0.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 0.actionConsole (cognitive 17) · ×1
  • 0.actionConsole (cognitive 17) php/wso/wso-4.2.0.php:643 — 0.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1.perms (cognitive 17) · ×1
  • 1.perms (cognitive 17) php/wso/wso-4.2.1.php:284 — 1.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 2.perms (cognitive 17) · ×1
  • 2.perms (cognitive 17) php/wso/wso-4.2.2.php:283 — 2.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 2.actionConsole (cognitive 17) · ×1
  • 2.actionConsole (cognitive 17) php/wso/wso-4.2.2.php:642 — 2.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.perms (cognitive 17) · ×1
  • 4.perms (cognitive 17) php/wso/wso-4.2.4.php:292 — 4.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 4.actionConsole (cognitive 17) · ×1
  • 4.actionConsole (cognitive 17) php/wso/wso-4.2.4.php:651 — 4.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.perms (cognitive 17) · ×1
  • 5.perms (cognitive 17) php/wso/wso-4.2.5.php:298 — 5.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · wso.perms (cognitive 17) · ×1
  • wso.perms (cognitive 17) REDACTED:323 — wso.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · wso2.wsoPerms (cognitive 17) · ×1
  • wso2.wsoPerms (cognitive 17) REDACTED:344 — wso2.wsoPerms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · wso2.actionConsole (cognitive 17) · ×1
  • wso2.actionConsole (cognitive 17) REDACTED:948 — wso2.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wso_404.wsoPerms (cognitive 17) · ×1
  • wso_404.wsoPerms (cognitive 17) REDACTED:346 — wso_404.wsoPerms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · wso_404.actionConsole (cognitive 17) · ×1
  • wso_404.actionConsole (cognitive 17) REDACTED:1434 — wso_404.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 1.wsoPerms (cognitive 17) · ×1
  • 1.wsoPerms (cognitive 17) REDACTED:344 — 1.wsoPerms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · v.perms (cognitive 17) · ×1
  • v.perms (cognitive 17) php/zxc/.v.php:302 — v.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · v.actionConsole (cognitive 17) · ×1
  • v.actionConsole (cognitive 17) php/zxc/.v.php:661 — v.actionConsole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · bypass403.perms (cognitive 17) · ×1
  • bypass403.perms (cognitive 17) REDACTED:32 — bypass403.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 404.perms (cognitive 17) · ×1
  • 404.perms (cognitive 17) REDACTED:353 — 404.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · G5.vb_opt (cognitive 17) · ×1
  • G5.vb_opt (cognitive 17) REDACTED:1288 — G5.vb_opt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · c37.GetPerms (cognitive 17) · ×1
  • c37.GetPerms (cognitive 17) REDACTED:2125 — c37.GetPerms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · cihshell_fix.fperms (cognitive 17) · ×1
  • cihshell_fix.fperms (cognitive 17) REDACTED:87 — cihshell_fix.fperms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · itsecteam_shell.bywsym (cognitive 17) · ×1
  • itsecteam_shell.bywsym (cognitive 17) REDACTED:808 — itsecteam_shell.bywsym has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · jHn.bywsym (cognitive 17) · ×1
  • jHn.bywsym (cognitive 17) REDACTED:789 — jHn.bywsym has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 5.wsoPerms (cognitive 17) · ×1
  • 5.wsoPerms (cognitive 17) REDACTED:331 — 5.wsoPerms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · wso2.perms (cognitive 17) · ×1
  • wso2.perms (cognitive 17) REDACTED:331 — wso2.perms has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · 0.remove_slashes (cognitive 16) · ×1
  • 0.remove_slashes (cognitive 16) b4tm4n-toolz/database/adminer-4.5.0.php:22 — 0.remove_slashes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (5 pts), ternaries 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 0.referencable_primary (cognitive 16) · ×1
  • 0.referencable_primary (cognitive 16) b4tm4n-toolz/database/adminer-4.5.0.php:1601 — 0.referencable_primary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · yaps.duplicate (cognitive 16) · ×1
  • yaps.duplicate (cognitive 16) REDACTED:585 — yaps.duplicate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 3.check_access (cognitive 16) · ×1
  • 3.check_access (cognitive 16) REDACTED:362 — 3.check_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · 4.check_access (cognitive 16) · ×1
  • 4.check_access (cognitive 16) REDACTED:404 — 4.check_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · source.check_access (cognitive 16) · ×1
  • source.check_access (cognitive 16) REDACTED:408 — source.check_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · fbi.remove_slashes (cognitive 16) · ×1
  • fbi.remove_slashes (cognitive 16) REDACTED:239 — fbi.remove_slashes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (5 pts), ternaries 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fbi.process_input (cognitive 16) · ×1
  • fbi.process_input (cognitive 16) REDACTED:317 — fbi.process_input has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fbi.referencable_primary (cognitive 16) · ×1
  • fbi.referencable_primary (cognitive 16) REDACTED:1315 — fbi.referencable_primary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.remove_slashes (cognitive 16) · ×1
  • 4.remove_slashes (cognitive 16) php/twitter/adminer-4.2.4.php:22 — 4.remove_slashes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (5 pts), ternaries 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 4.referencable_primary (cognitive 16) · ×1
  • 4.referencable_primary (cognitive 16) php/twitter/adminer-4.2.4.php:1492 — 4.referencable_primary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · upsi1on.showFiles (cognitive 16) · ×1
  • upsi1on.showFiles (cognitive 16) REDACTED:729 — upsi1on.showFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D3 · God Classes · ClassTooLong · ×1
  • ClassTooLong: project REDACTED:3 — ClassTooLong — 845 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 445 over it, 2.11× 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.
D32 · Data Compliance (PII/GDPR) · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (19 members, 10 shared lines) · ×1
  • Near-duplicate member family (19 members, 10 shared lines) REDACTED:343 — REDACTED:343-360 | REDACTED:660-678 | REDACTED:263-280 | php/wso/wso-4.1.3.php:285-302 | php/wso/wso-4.2.0.php:285-302 | php/wso/wso-4.2.1.php:285-302 | php/wso/wso-4.2.2.php:284-301 | php/wso/wso-4.2.3.php:288-305 | php/wso/wso-4.2.4.php:293-310 | php/wso/wso-4.2.5.php:299-316 | REDACTED:324-341 | REDACTED:345-362 | REDACTED:347-364 | REDACTED:345-362 | php/zxc/.v.php:303-320 | REDACTED:33-51 | REDACTED:354-371 | REDACTED:332-349 | REDACTED:332-349 — These 19 members are variants of one another: a block of 10 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 19 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 19 times.
D4 · Code Duplication · Near-duplicate member family (16 members, 143 shared lines) · ×1
  • Near-duplicate member family (16 members, 143 shared lines) REDACTED:1121 — REDACTED:1121-1458 | REDACTED:1194-1473 | php/wso/wso-4.1.3.php:1230-1567 | php/wso/wso-4.2.0.php:1227-1564 | php/wso/wso-4.2.1.php:1223-1560 | php/wso/wso-4.2.2.php:1222-1559 | php/wso/wso-4.2.3.php:1226-1563 | php/wso/wso-4.2.4.php:1231-1568 | php/wso/wso-4.2.5.php:1237-1574 | REDACTED:1128-1407 | REDACTED:1123-1460 | REDACTED:1609-1941 | REDACTED:1123-1460 | php/zxc/.v.php:1237-1574 | REDACTED:1132-1418 | REDACTED:1116-1453 — These 16 members are variants of one another: a block of 143 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 16 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 16 times.
D4 · Code Duplication · Near-duplicate member family (16 members, 59 shared lines) · ×1
  • Near-duplicate member family (16 members, 59 shared lines) REDACTED:790 — REDACTED:790-943 | REDACTED:387-535 | php/wso/wso-4.1.3.php:416-569 | php/wso/wso-4.2.0.php:416-579 | php/wso/wso-4.2.1.php:416-579 | php/wso/wso-4.2.2.php:415-578 | php/wso/wso-4.2.3.php:419-582 | php/wso/wso-4.2.4.php:424-587 | php/wso/wso-4.2.5.php:430-593 | REDACTED:687-835 | REDACTED:792-945 | REDACTED:1233-1386 | REDACTED:792-945 | php/zxc/.v.php:434-597 | REDACTED:779-932 | REDACTED:663-816 — These 16 members are variants of one another: a block of 59 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 16 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 16 times.
D4 · Code Duplication · Near-duplicate member family (14 members, 19 shared lines) · ×1
  • Near-duplicate member family (14 members, 19 shared lines) REDACTED:704 — REDACTED:704-785 | REDACTED:868-953 | php/wso/wso-4.1.3.php:952-1037 | php/wso/wso-4.2.0.php:948-1034 | php/wso/wso-4.2.1.php:944-1030 | php/wso/wso-4.2.2.php:943-1029 | php/wso/wso-4.2.3.php:947-1033 | php/wso/wso-4.2.4.php:953-1038 | php/wso/wso-4.2.5.php:959-1044 | REDACTED:706-787 | REDACTED:1144-1229 | REDACTED:706-787 | php/zxc/.v.php:961-1041 | REDACTED:693-774 — These 14 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 14 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 14 times.
D4 · Code Duplication · Near-duplicate member family (12 members, 45 shared lines) · ×1
  • Near-duplicate member family (12 members, 45 shared lines) REDACTED:134 — REDACTED:134-270 | php/wso/wso-4.1.3.php:60-209 | php/wso/wso-4.2.0.php:74-225 | php/wso/wso-4.2.1.php:74-225 | php/wso/wso-4.2.2.php:73-224 | php/wso/wso-4.2.3.php:73-228 | php/wso/wso-4.2.4.php:78-233 | php/wso/wso-4.2.5.php:78-236 | REDACTED:136-272 | REDACTED:136-272 | php/zxc/.v.php:81-240 | REDACTED:124-262 — These 12 members are variants of one another: a block of 45 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 12 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times.
D4 · Code Duplication · Near-duplicate member family (12 members, 40 shared lines) · ×1
  • Near-duplicate member family (12 members, 40 shared lines) REDACTED:958 — REDACTED:958-1007 | php/wso/wso-4.1.3.php:1040-1089 | php/wso/wso-4.2.0.php:1037-1086 | php/wso/wso-4.2.1.php:1033-1082 | php/wso/wso-4.2.2.php:1032-1081 | php/wso/wso-4.2.3.php:1036-1085 | php/wso/wso-4.2.4.php:1041-1090 | php/wso/wso-4.2.5.php:1047-1096 | REDACTED:838-887 | php/zxc/.v.php:1044-1093 | REDACTED:898-953 | REDACTED:820-868 — These 12 members are variants of one another: a block of 40 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 12 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times.
D4 · Code Duplication · Near-duplicate member family (12 members, 31 shared lines) · ×1
  • Near-duplicate member family (12 members, 31 shared lines) REDACTED:958 — REDACTED:958-1007 | php/wso/wso-4.1.3.php:1040-1089 | php/wso/wso-4.2.0.php:1037-1086 | php/wso/wso-4.2.1.php:1033-1082 | php/wso/wso-4.2.2.php:1032-1081 | php/wso/wso-4.2.3.php:1036-1085 | php/wso/wso-4.2.4.php:1041-1090 | php/wso/wso-4.2.5.php:1047-1096 | REDACTED:838-887 | REDACTED:1390-1431 | php/zxc/.v.php:1044-1093 | REDACTED:898-953 — These 12 members are variants of one another: a block of 31 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 12 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times.
D4 · Code Duplication · Near-duplicate member family (12 members, 15 shared lines) · ×1
  • Near-duplicate member family (12 members, 15 shared lines) REDACTED:676 — REDACTED:676-708 | php/wso/wso-4.1.3.php:704-736 | php/wso/wso-4.2.0.php:714-746 | php/wso/wso-4.2.1.php:714-746 | php/wso/wso-4.2.2.php:713-745 | php/wso/wso-4.2.3.php:717-749 | php/wso/wso-4.2.4.php:722-754 | php/wso/wso-4.2.5.php:728-760 | REDACTED:434-466 | REDACTED:922-950 | php/zxc/.v.php:731-763 | REDACTED:469-502 — These 12 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 12 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times.
D4 · Code Duplication · Near-duplicate member family (12 members, 8 shared lines) · ×1
  • Near-duplicate member family (12 members, 8 shared lines) REDACTED:606 — REDACTED:606-630 | REDACTED:492-534 | REDACTED:1233-1258 | REDACTED:1209-1234 | REDACTED:1053-1078 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1321-1346 | php/PHPshell/【r57_iFX】/r57_iFX.php:830-855 | php/PHPshell/【r57_karta】/r57_kartal.php:801-826 | php/PHPshell/【r57】/r57.php:1058-1083 | REDACTED:1224-1249 | REDACTED:1056-1081 | REDACTED:492-534 — These 12 members are variants of one another: a block of 8 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 12 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times.
D4 · Code Duplication · Near-duplicate member family (11 members, 46 shared lines) · ×1
  • Near-duplicate member family (11 members, 46 shared lines) REDACTED:947 — REDACTED:947-1013 | php/wso/wso-4.1.3.php:634-699 | php/wso/wso-4.2.1.php:644-709 | php/wso/wso-4.2.2.php:643-708 | php/wso/wso-4.2.3.php:647-712 | php/wso/wso-4.2.4.php:652-717 | php/wso/wso-4.2.5.php:658-723 | REDACTED:949-1015 | REDACTED:949-1015 | php/zxc/.v.php:662-726 | REDACTED:936-1002 — These 11 members are variants of one another: a block of 46 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 11 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times.
D4 · Code Duplication · Near-duplicate member family (11 members, 23 shared lines) · ×1
  • Near-duplicate member family (11 members, 23 shared lines) REDACTED:1478 — REDACTED:1478-1526 | php/wso/wso-4.1.3.php:1570-1618 | php/wso/wso-4.2.0.php:1567-1615 | php/wso/wso-4.2.1.php:1563-1611 | php/wso/wso-4.2.2.php:1562-1610 | php/wso/wso-4.2.3.php:1566-1614 | php/wso/wso-4.2.4.php:1571-1619 | php/wso/wso-4.2.5.php:1577-1625 | REDACTED:1410-1460 | php/zxc/.v.php:1577-1625 | REDACTED:1423-1476 — These 11 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 11 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times.
D4 · Code Duplication · Near-duplicate member family (8 members, 25 shared lines) · ×1
  • Near-duplicate member family (8 members, 25 shared lines) REDACTED:1909 — REDACTED:1909-1936 | REDACTED:1940-1977 | php/angel大马.php:1909-1936 | php/angel大马.php:1940-1977 | REDACTED:1909-1936 | REDACTED:1940-1977 | REDACTED:1906-1933 | REDACTED:1937-1974 — These 8 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 8 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times.
D4 · Code Duplication · Near-duplicate member family (6 members, 26 shared lines) · ×1
  • Near-duplicate member family (6 members, 26 shared lines) REDACTED:87 — REDACTED:87-224 | REDACTED:121-182 | REDACTED:140-202 | REDACTED:144-206 | REDACTED:159-244 | REDACTED:83-220 — These 6 members are variants of one another: a block of 26 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Near-duplicate member family (6 members, 20 shared lines) · ×1
  • Near-duplicate member family (6 members, 20 shared lines) REDACTED:324 — REDACTED:324-346 | REDACTED:298-320 | REDACTED:340-362 | REDACTED:344-366 | REDACTED:387-409 | REDACTED:320-342 — These 6 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Near-duplicate member family (6 members, 10 shared lines) · ×1
  • Near-duplicate member family (6 members, 10 shared lines) REDACTED:255 — REDACTED:255-268 | REDACTED:199-212 | REDACTED:482-495 | REDACTED:504-517 | REDACTED:422-433 | REDACTED:251-264 — These 6 members are variants of one another: a block of 10 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Near-duplicate member family (6 members, 8 shared lines) · ×1
  • Near-duplicate member family (6 members, 8 shared lines) REDACTED:2320 — REDACTED:2320-2342 | REDACTED:2346-2377 | www-7jyewu-cn/免杀php大马.php:2320-2342 | www-7jyewu-cn/免杀php大马.php:2346-2377 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2320-2342 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2346-2377 — These 6 members are variants of one another: a block of 8 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Near-duplicate member family (5 members, 67 shared lines) · ×1
  • Near-duplicate member family (5 members, 67 shared lines) REDACTED:134 — REDACTED:134-270 | REDACTED:136-272 | REDACTED:144-279 | REDACTED:136-272 | REDACTED:124-262 — These 5 members are variants of one another: a block of 67 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Near-duplicate member family (5 members, 32 shared lines) · ×1
  • Near-duplicate member family (5 members, 32 shared lines) REDACTED:387 — REDACTED:387-535 | REDACTED:687-835 | REDACTED:1233-1386 | REDACTED:734-890 | REDACTED:663-816 — These 5 members are variants of one another: a block of 32 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Near-duplicate member family (5 members, 19 shared lines) · ×1
  • Near-duplicate member family (5 members, 19 shared lines) REDACTED:224 — REDACTED:224-244 | REDACTED:228-248 | REDACTED:266-286 | REDACTED:302-322 | php/b374k/source/b374k-2.8.source.php:363-383 — These 5 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Near-duplicate member family (5 members, 16 shared lines) · ×1
  • Near-duplicate member family (5 members, 16 shared lines) REDACTED:1772 — REDACTED:1772-1794 | php/angel大马.php:1772-1794 | REDACTED:1772-1794 | php/phpspy/2013未加密.php:1217-1239 | REDACTED:1769-1791 — These 5 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Near-duplicate member family (4 members, 89 shared lines) · ×1
  • Near-duplicate member family (4 members, 89 shared lines) REDACTED:1194 — REDACTED:1194-1473 | REDACTED:1128-1407 | REDACTED:1132-1418 | REDACTED:1030-1228 — These 4 members are variants of one another: a block of 89 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Near-duplicate member family (4 members, 26 shared lines) · ×1
  • Near-duplicate member family (4 members, 26 shared lines) REDACTED:1615 — REDACTED:1615-1647 | php/angel大马.php:1615-1647 | REDACTED:1615-1647 | REDACTED:1612-1644 — These 4 members are variants of one another: a block of 26 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Near-duplicate member family (4 members, 6 shared lines) · ×1
  • Near-duplicate member family (4 members, 6 shared lines) REDACTED:617 — REDACTED:617-729 | REDACTED:1366-1394 | REDACTED:617-729 | REDACTED:598-710 — These 4 members are variants of one another: a block of 6 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Near-duplicate member family (3 members, 27 shared lines) · ×1
  • Near-duplicate member family (3 members, 27 shared lines) REDACTED:405 — REDACTED:405-435 | REDACTED:409-439 | REDACTED:456-490 — These 3 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Near-duplicate member family (3 members, 18 shared lines) · ×1
  • Near-duplicate member family (3 members, 18 shared lines) REDACTED:356 — REDACTED:356-464 | REDACTED:425-521 | REDACTED:352-460 — These 3 members are variants of one another: a block of 18 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Near-duplicate member family (3 members, 15 shared lines) · ×1
  • Near-duplicate member family (3 members, 15 shared lines) REDACTED:661 — REDACTED:661-677 | REDACTED:694-710 | REDACTED:771-787 — These 3 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Near-duplicate member family (3 members, 6 shared lines) · ×1
  • Near-duplicate member family (3 members, 6 shared lines) REDACTED:1397 — REDACTED:1397-1405 | www-7jyewu-cn/免杀php大马.php:1397-1405 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1397-1405 — These 3 members are variants of one another: a block of 6 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Near-duplicate member pair (71 shared lines) · ×1
  • Near-duplicate member pair (71 shared lines) REDACTED:493 — REDACTED:493-571 | php/b374k/source/b374k-2.8.source.php:554-637 — These two members are variants of one another: 71 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (25 shared lines) · ×1
  • Near-duplicate member pair (25 shared lines) REDACTED:603 — REDACTED:603-671 | php/wso/wso-4.2.0.php:644-711 — These two members are variants of one another: 25 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (22 shared lines) · ×1
  • Near-duplicate member pair (22 shared lines) REDACTED:622 — REDACTED:622-684 | REDACTED:660-730 — These two members are variants of one another: 22 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) REDACTED:2013 — REDACTED:2013-2037 | php/angel大马.php:2013-2037 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) REDACTED:2013 — REDACTED:2013-2035 | REDACTED:2010-2032 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (18 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (18 members, 50+ identical tokens) REDACTED:357 — REDACTED:357-367 | REDACTED:514-699 | REDACTED:713-863 | php/wso/wso-4.1.3.php:757-948 | php/wso/wso-4.2.0.php:753-945 | php/wso/wso-4.2.1.php:749-940 | php/wso/wso-4.2.2.php:748-939 | php/wso/wso-4.2.3.php:752-943 | php/wso/wso-4.2.4.php:757-949 | php/wso/wso-4.2.5.php:763-955 | REDACTED:469-619 | REDACTED:516-701 | REDACTED:954-1140 | REDACTED:516-701 | php/zxc/.v.php:766-957 | REDACTED:506-655 | REDACTED:503-688 | REDACTED:455-604 — These 18 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 18 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times.
D4 · Code Duplication · Members sharing a duplicated core (14 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (14 members, 50+ identical tokens) REDACTED:1462 — REDACTED:1462-1498 | REDACTED:1478-1526 | php/wso/wso-4.1.3.php:1570-1618 | php/wso/wso-4.2.0.php:1567-1615 | php/wso/wso-4.2.1.php:1563-1611 | php/wso/wso-4.2.2.php:1562-1610 | php/wso/wso-4.2.3.php:1566-1614 | php/wso/wso-4.2.4.php:1571-1619 | php/wso/wso-4.2.5.php:1577-1625 | REDACTED:1464-1500 | REDACTED:1944-1979 | REDACTED:1464-1500 | php/zxc/.v.php:1577-1625 | REDACTED:1457-1493 — These 14 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 14 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 14 times.
D4 · Code Duplication · Members sharing a duplicated core (10 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (10 members, 50+ identical tokens) REDACTED:1068 — REDACTED:1068-1104 | php/wso/wso-4.1.3.php:1107-1143 | php/wso/wso-4.2.0.php:1104-1140 | php/wso/wso-4.2.1.php:1100-1136 | php/wso/wso-4.2.2.php:1099-1135 | php/wso/wso-4.2.3.php:1103-1139 | php/wso/wso-4.2.4.php:1108-1144 | php/wso/wso-4.2.5.php:1114-1150 | REDACTED:1006-1042 | php/zxc/.v.php:1114-1150 — These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times.
D4 · Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (8 members, 50+ identical tokens) php/wso/wso-4.1.3.php:212 — php/wso/wso-4.1.3.php:212-231 | php/wso/wso-4.2.0.php:228-247 | php/wso/wso-4.2.1.php:228-247 | php/wso/wso-4.2.2.php:227-246 | php/wso/wso-4.2.3.php:231-250 | php/wso/wso-4.2.4.php:236-255 | php/wso/wso-4.2.5.php:239-261 | php/zxc/.v.php:243-265 — These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times.
D4 · Code Duplication · Edited copy of a member (85 corresponding lines) · ×1
  • Edited copy of a member (85 corresponding lines) REDACTED:185 — REDACTED:185-269 | php/b374k/source/b374k-2.8.source.php:241-330 — These two members are one piece of code written twice and then edited apart: 85 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 19+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 19+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1530 — b4tm4n-toolz/database/adminer-4.5.0.php:1530-1561 | REDACTED:1274-1292 | php/twitter/adminer-4.2.4.php:1432-1456 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 1+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 1+ corresponding lines) REDACTED:124 — REDACTED:124-157 | REDACTED:935-973 | REDACTED:248-281 | REDACTED:2125-2125 | REDACTED:88-89 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) REDACTED:474 — REDACTED:474-509 | REDACTED:922-950 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (42 corresponding lines) · ×1
  • Edited copy of a member (42 corresponding lines) REDACTED:121 — REDACTED:121-167 | REDACTED:104-145 — These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (33 corresponding lines) · ×1
  • Edited copy of a member (33 corresponding lines) REDACTED:421 — REDACTED:421-453 | php/b374k/source/b374k-2.8.source.php:482-514 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 6+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 6+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:119 — b4tm4n-toolz/database/adminer-4.5.0.php:119-125 | REDACTED:317-322 | php/twitter/adminer-4.2.4.php:113-119 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (40 corresponding lines) · ×1
  • Edited copy of a member (40 corresponding lines) php/phpkit-1.0/phpkitcli.py:40 — php/phpkit-0.2a/phpkit.py:39-78 | php/phpkit-1.0/phpkitcli.py:40-79 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) REDACTED:847 — REDACTED:847-860 | php/b374k/source/b374k-2.8.source.php:796-812 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 7+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 7+ corresponding lines) b4tm4n-toolz/database/adminer-4.5.0.php:1432 — b4tm4n-toolz/database/adminer-4.5.0.php:1432-1438 | REDACTED:1137-1150 | php/twitter/adminer-4.2.4.php:1336-1349 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (8 members, 1+ corresponding lines) · ×1
  • Edited copies of one member (8 members, 1+ corresponding lines) php/wso/wso-4.1.3.php:21 — php/wso/wso-4.1.3.php:21-21 | php/wso/wso-4.2.0.php:20-20 | php/wso/wso-4.2.1.php:20-20 | php/wso/wso-4.2.2.php:20-20 | php/wso/wso-4.2.3.php:20-20 | php/wso/wso-4.2.4.php:24-24 | php/wso/wso-4.2.5.php:24-24 | php/zxc/.v.php:24-24 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 7+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 7+ corresponding lines) REDACTED:1800 — REDACTED:1800-1806 | php/angel大马.php:1800-1806 | REDACTED:1800-1806 | php/phpspy/2013未加密.php:1245-1251 | REDACTED:1797-1803 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×1
  • Edited copy of a member (20 corresponding lines) REDACTED:200 — REDACTED:200-219 | REDACTED:261-280 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×1
  • Edited copy of a member (9 corresponding lines) REDACTED:152 — REDACTED:152-160 | php/b374k/source/b374k-2.8.source.php:199-207 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×1
  • Edited copy of a member (18 corresponding lines) REDACTED:396 — REDACTED:396-420 | REDACTED:575-592 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 3+ corresponding lines) REDACTED:1967 — REDACTED:1967-1969 | REDACTED:2066-2068 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:2098-2100 | php/PHPshell/【r57】/r57.php:2071-2073 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 4+ corresponding lines) REDACTED:2112 — REDACTED:2112-2115 | php/angel大马.php:2112-2115 | REDACTED:2109-2112 | REDACTED:2106-2109 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (8 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (8 members, 4+ corresponding lines) REDACTED:1717 — REDACTED:1717-1720 | php/angel大马.php:1717-1720 | REDACTED:1717-1720 | php/phpspy/2013未加密.php:1187-1190 | REDACTED:869-872 | REDACTED:561-564 | REDACTED:1714-1717 | REDACTED:398-401 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 2+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 2+ corresponding lines) REDACTED:319 — REDACTED:319-320 | REDACTED:293-294 | REDACTED:335-336 | REDACTED:339-340 | REDACTED:382-383 | REDACTED:315-316 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 4+ corresponding lines) REDACTED:1698 — REDACTED:1698-1701 | php/angel大马.php:1698-1701 | REDACTED:1698-1701 | php/phpspy/2013未加密.php:1168-1171 | REDACTED:1695-1698 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (7 members, 2+ corresponding lines) · ×1
  • Edited copies of one member (7 members, 2+ corresponding lines) REDACTED:1985 — REDACTED:1985-1986 | REDACTED:1973-1974 | REDACTED:2072-2073 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:2104-2105 | php/PHPshell/【r57】/r57.php:2077-2078 | REDACTED:2004-2005 | REDACTED:1846-1847 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (141 lines × 2) · ×1
  • Duplicated block (141 lines × 2) REDACTED:243 — REDACTED:243-383 | REDACTED:265-405 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:243` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (88–89 lines × 2) · ×1
  • Duplicated block (88–89 lines × 2) REDACTED:1121 — REDACTED:1121-1208 | REDACTED:644-732 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (81 lines × 13) · ×1
  • Duplicated block (81 lines × 13) REDACTED:1162 — REDACTED:1162-1242 | php/wso/wso-4.1.3.php:1271-1351 | php/wso/wso-4.2.0.php:1268-1348 | php/wso/wso-4.2.1.php:1264-1344 | php/wso/wso-4.2.2.php:1263-1343 | php/wso/wso-4.2.3.php:1267-1347 | php/wso/wso-4.2.4.php:1272-1352 | php/wso/wso-4.2.5.php:1278-1358 | REDACTED:1164-1244 | REDACTED:1650-1730 | REDACTED:1164-1244 | php/zxc/.v.php:1278-1358 | REDACTED:1157-1237 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1162` 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.
D4 · Code Duplication · Duplicated block (73 lines × 3) · ×1
  • Duplicated block (73 lines × 3) REDACTED:734 — REDACTED:734-806 | REDACTED:734-806 | REDACTED:715-787 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (125 lines × 3) · ×1
  • Duplicated block (125 lines × 3) REDACTED:1235 — REDACTED:1235-1359 | REDACTED:1169-1293 | REDACTED:1173-1297 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1235` 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.
D4 · Code Duplication · Duplicated block (60–62 lines × 2) · ×1
  • Duplicated block (60–62 lines × 2) REDACTED:205 — REDACTED:205-266 | php/b374k/source/b374k-2.8.source.php:268-327 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:205` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (64–65 lines × 13) · ×1
  • Duplicated block (64–65 lines × 13) REDACTED:1341 — REDACTED:1341-1404 | php/wso/wso-4.1.3.php:1450-1513 | php/wso/wso-4.2.0.php:1447-1510 | php/wso/wso-4.2.1.php:1443-1506 | php/wso/wso-4.2.2.php:1442-1505 | php/wso/wso-4.2.3.php:1446-1509 | php/wso/wso-4.2.4.php:1451-1514 | php/wso/wso-4.2.5.php:1457-1520 | REDACTED:1343-1406 | REDACTED:1823-1887 | REDACTED:1343-1406 | php/zxc/.v.php:1457-1520 | REDACTED:1336-1399 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1341` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (4–56 lines × 4) · ×1
  • Duplicated block (4–56 lines × 4) REDACTED:511 — REDACTED:511-566 | REDACTED:516-571 | REDACTED:569-624 | REDACTED:648-651 — 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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:511` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (55 lines × 2) · ×1
  • Duplicated block (55 lines × 2) REDACTED:1047 — REDACTED:1047-1101 | REDACTED:571-625 — 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.
D4 · Code Duplication · Duplicated block (53–54 lines × 5) · ×1
  • Duplicated block (53–54 lines × 5) REDACTED:248 — REDACTED:248-301 | REDACTED:252-305 | REDACTED:290-343 | REDACTED:326-378 | php/b374k/source/b374k-2.8.source.php:387-439 — 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 5 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (53 lines × 2) · ×1
  • Duplicated block (53 lines × 2) REDACTED:1376 — REDACTED:1376-1428 | REDACTED:1310-1362 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1376` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (51 lines × 2) · ×1
  • Duplicated block (51 lines × 2) REDACTED:548 — REDACTED:548-598 | REDACTED:548-598 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (49 lines × 16) · ×1
  • Duplicated block (49 lines × 16) REDACTED:1126 — REDACTED:1126-1174 | REDACTED:1199-1247 | php/wso/wso-4.1.3.php:1235-1283 | php/wso/wso-4.2.0.php:1232-1280 | php/wso/wso-4.2.1.php:1228-1276 | php/wso/wso-4.2.2.php:1227-1275 | php/wso/wso-4.2.3.php:1231-1279 | php/wso/wso-4.2.4.php:1236-1284 | php/wso/wso-4.2.5.php:1242-1290 | REDACTED:1133-1181 | REDACTED:1128-1176 | REDACTED:1614-1662 | REDACTED:1128-1176 | php/zxc/.v.php:1242-1290 | REDACTED:1137-1185 | REDACTED:1121-1169 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1126` 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.
D4 · Code Duplication · Duplicated block (48 lines × 5) · ×1
  • Duplicated block (48 lines × 5) REDACTED:403 — REDACTED:403-450 | REDACTED:372-419 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:479-526 | REDACTED:396-443 | REDACTED:357-404 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (48 lines × 4) · ×1
  • Duplicated block (48 lines × 4) REDACTED:130 — REDACTED:130-177 | REDACTED:150-197 | REDACTED:154-201 | REDACTED:171-218 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:130` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (57 lines × 7) · ×1
  • Duplicated block (57 lines × 7) php/wso/wso-4.1.3.php:635 — php/wso/wso-4.1.3.php:635-691 | php/wso/wso-4.2.1.php:645-701 | php/wso/wso-4.2.2.php:644-700 | php/wso/wso-4.2.3.php:648-704 | php/wso/wso-4.2.4.php:653-709 | php/wso/wso-4.2.5.php:659-715 | php/zxc/.v.php:663-719 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.1.php` as WHOLE FILES: this scan already matched 102 separate duplicated blocks between them, totalling at least 1993 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:635` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (67 lines × 4) · ×1
  • Duplicated block (67 lines × 4) REDACTED:947 — REDACTED:947-1013 | REDACTED:949-1015 | REDACTED:949-1015 | REDACTED:936-1002 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:947` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (45 lines × 3) · ×1
  • Duplicated block (45 lines × 3) REDACTED:1806 — REDACTED:1806-1850 | www-7jyewu-cn/免杀php大马.php:1806-1850 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1806-1850 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1806` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (3–43 lines × 7) · ×1
  • Duplicated block (3–43 lines × 7) php/wso/wso-4.1.3.php:92 — php/wso/wso-4.1.3.php:92-94 | php/wso/wso-4.2.0.php:74-109 | php/wso/wso-4.2.1.php:74-109 | php/wso/wso-4.2.2.php:73-108 | php/wso/wso-4.2.3.php:73-112 | php/wso/wso-4.2.4.php:78-117 | php/wso/wso-4.2.5.php:78-120 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.2.0.php:74` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (1–42 lines × 6) · ×1
  • Duplicated block (1–42 lines × 6) REDACTED:688 — REDACTED:688-729 | REDACTED:1391-1392 | REDACTED:1393-1393 | REDACTED:1394-1394 | REDACTED:688-729 | REDACTED:669-710 — there are 6 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1393` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1393` calls `foreach` and `REDACTED:1394` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (41 lines × 2) · ×1
  • Duplicated block (41 lines × 2) REDACTED:356 — REDACTED:356-396 | REDACTED:352-392 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:356` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (4–39 lines × 4) · ×1
  • Duplicated block (4–39 lines × 4) REDACTED:387 — REDACTED:387-424 | REDACTED:687-724 | REDACTED:734-772 | REDACTED:669-672 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:669` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (37 lines × 2) · ×1
  • Duplicated block (37 lines × 2) REDACTED:908 — REDACTED:908-944 | REDACTED:888-924 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 57 separate duplicated blocks between them, totalling at least 848 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:907` calls `printHeader` and `REDACTED:887` 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.
D4 · Code Duplication · Duplicated block (35–36 lines × 5) · ×1
  • Duplicated block (35–36 lines × 5) REDACTED:391 — REDACTED:391-425 | REDACTED:393-427 | REDACTED:393-428 | REDACTED:393-427 | REDACTED:380-414 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:391` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:425` calls `wsoSecParam`, `is_readable` and `REDACTED:428` 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.
D4 · Code Duplication · Duplicated block (35 lines × 10) · ×1
  • Duplicated block (35 lines × 10) REDACTED:1069 — REDACTED:1069-1103 | php/wso/wso-4.1.3.php:1108-1142 | php/wso/wso-4.2.0.php:1105-1139 | php/wso/wso-4.2.1.php:1101-1135 | php/wso/wso-4.2.2.php:1100-1134 | php/wso/wso-4.2.3.php:1104-1138 | php/wso/wso-4.2.4.php:1109-1143 | php/wso/wso-4.2.5.php:1115-1149 | REDACTED:1007-1041 | php/zxc/.v.php:1115-1149 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (35 lines × 2) · ×1
  • Duplicated block (35 lines × 2) REDACTED:36 — REDACTED:36-70 | REDACTED:36-70 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: 99% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (34 lines × 11) · ×1
  • Duplicated block (34 lines × 11) REDACTED:972 — REDACTED:972-1005 | php/wso/wso-4.1.3.php:658-691 | php/wso/wso-4.2.1.php:668-701 | php/wso/wso-4.2.2.php:667-700 | php/wso/wso-4.2.3.php:671-704 | php/wso/wso-4.2.4.php:676-709 | php/wso/wso-4.2.5.php:682-715 | REDACTED:974-1007 | REDACTED:974-1007 | php/zxc/.v.php:686-719 | REDACTED:961-994 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:972` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (34 lines × 5) · ×1
  • Duplicated block (34 lines × 5) REDACTED:454 — REDACTED:454-487 | REDACTED:423-456 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:530-563 | REDACTED:447-480 | REDACTED:408-441 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (34 lines × 4) · ×1
  • Duplicated block (34 lines × 4) REDACTED:1202 — REDACTED:1202-1235 | php/PHPshell/【r57_iFX】/r57_iFX.php:979-1012 | php/PHPshell/【r57_karta】/r57_kartal.php:950-983 | php/PHPshell/【r57】/r57.php:1207-1240 — before extracting anything, compare `REDACTED` and `php/PHPshell/【r57_iFX】/r57_iFX.php` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (32 lines × 13) · ×1
  • Duplicated block (32 lines × 13) REDACTED:1426 — REDACTED:1426-1457 | php/wso/wso-4.1.3.php:1535-1566 | php/wso/wso-4.2.0.php:1532-1563 | php/wso/wso-4.2.1.php:1528-1559 | php/wso/wso-4.2.2.php:1527-1558 | php/wso/wso-4.2.3.php:1531-1562 | php/wso/wso-4.2.4.php:1536-1567 | php/wso/wso-4.2.5.php:1542-1573 | REDACTED:1428-1459 | REDACTED:1909-1940 | REDACTED:1428-1459 | php/zxc/.v.php:1542-1573 | REDACTED:1421-1452 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1426` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (48 lines × 8) · ×1
  • Duplicated block (48 lines × 8) php/wso/wso-4.1.3.php:109 — php/wso/wso-4.1.3.php:109-156 | php/wso/wso-4.2.0.php:124-171 | php/wso/wso-4.2.1.php:124-171 | php/wso/wso-4.2.2.php:123-170 | php/wso/wso-4.2.3.php:127-174 | php/wso/wso-4.2.4.php:132-179 | php/wso/wso-4.2.5.php:135-182 | php/zxc/.v.php:139-186 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:109` 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.
D4 · Code Duplication · Duplicated block (37–38 lines × 5) · ×1
  • Duplicated block (37–38 lines × 5) REDACTED:185 — REDACTED:185-221 | REDACTED:187-223 | REDACTED:194-231 | REDACTED:187-223 | REDACTED:176-213 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:185` 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.
D4 · Code Duplication · Duplicated block (75 lines × 4) · ×1
  • Duplicated block (75 lines × 4) REDACTED:731 — REDACTED:731-805 | REDACTED:487-561 | REDACTED:524-598 | REDACTED:472-546 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:731` 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.
D4 · Code Duplication · Duplicated block (30 lines × 9) · ×1
  • Duplicated block (30 lines × 9) REDACTED:1358 — REDACTED:1358-1387 | REDACTED:1333-1362 | REDACTED:1270-1299 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1445-1474 | php/PHPshell/【r57_iFX】/r57_iFX.php:1047-1076 | php/PHPshell/【r57_karta】/r57_kartal.php:1018-1047 | php/PHPshell/【r57】/r57.php:1275-1304 | REDACTED:1349-1378 | REDACTED:1181-1210 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (30 lines × 3) · ×1
  • Duplicated block (30 lines × 3) REDACTED:809 — REDACTED:809-838 | REDACTED:809-838 | REDACTED:790-819 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (68 lines × 8) · ×1
  • Duplicated block (68 lines × 8) php/wso/wso-4.1.3.php:346 — php/wso/wso-4.1.3.php:346-413 | php/wso/wso-4.2.0.php:346-413 | php/wso/wso-4.2.1.php:346-413 | php/wso/wso-4.2.2.php:345-412 | php/wso/wso-4.2.3.php:349-416 | php/wso/wso-4.2.4.php:354-421 | php/wso/wso-4.2.5.php:360-427 | php/zxc/.v.php:364-431 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:346` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (36–42 lines × 8) · ×1
  • Duplicated block (36–42 lines × 8) php/wso/wso-4.1.3.php:997 — php/wso/wso-4.1.3.php:997-1037 | php/wso/wso-4.2.0.php:993-1034 | php/wso/wso-4.2.1.php:989-1030 | php/wso/wso-4.2.2.php:988-1029 | php/wso/wso-4.2.3.php:992-1033 | php/wso/wso-4.2.4.php:998-1038 | php/wso/wso-4.2.5.php:1004-1044 | php/zxc/.v.php:1006-1041 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (28 lines × 7) · ×1
  • Duplicated block (28 lines × 7) REDACTED:237 — REDACTED:237-264 | REDACTED:206-233 | REDACTED:201-228 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:313-340 | php/PHPshell/【r57】/r57.php:206-233 | REDACTED:230-257 | REDACTED:191-218 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (8–35 lines × 15) · ×1
  • Duplicated block (8–35 lines × 15) REDACTED:474 — REDACTED:474-508 | REDACTED:700-707 | php/wso/wso-4.1.3.php:728-735 | php/wso/wso-4.2.0.php:738-745 | php/wso/wso-4.2.1.php:738-745 | php/wso/wso-4.2.2.php:737-744 | php/wso/wso-4.2.3.php:741-748 | php/wso/wso-4.2.4.php:746-753 | php/wso/wso-4.2.5.php:752-759 | REDACTED:458-465 | REDACTED:476-510 | REDACTED:942-949 | REDACTED:476-510 | php/zxc/.v.php:755-762 | REDACTED:463-497 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:474` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) REDACTED:426 — REDACTED:426-453 | php/b374k/source/b374k-2.8.source.php:487-514 — before extracting anything, compare `REDACTED` and `php/b374k/source/b374k-2.8.source.php` as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 402 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:426` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (26–27 lines × 17) · ×1
  • Duplicated block (26–27 lines × 17) REDACTED:1408 — REDACTED:1408-1433 | REDACTED:1432-1457 | php/wso/wso-4.1.3.php:1517-1542 | php/wso/wso-4.2.0.php:1514-1539 | php/wso/wso-4.2.1.php:1510-1535 | php/wso/wso-4.2.2.php:1509-1534 | php/wso/wso-4.2.3.php:1513-1538 | php/wso/wso-4.2.4.php:1518-1543 | php/wso/wso-4.2.5.php:1524-1549 | REDACTED:1366-1391 | REDACTED:1410-1435 | REDACTED:1891-1916 | REDACTED:1410-1435 | php/zxc/.v.php:1524-1549 | REDACTED:1374-1399 | REDACTED:1403-1428 | REDACTED:1191-1217 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1408` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1459` calls `htmlspecialchars`, `error` and `REDACTED:1217` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (27 lines × 7) · ×1
  • Duplicated block (27 lines × 7) REDACTED:293 — REDACTED:293-319 | REDACTED:262-288 | REDACTED:257-283 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:369-395 | php/PHPshell/【r57】/r57.php:262-288 | REDACTED:286-312 | REDACTED:247-273 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (17–27 lines × 3) · ×1
  • Duplicated block (17–27 lines × 3) REDACTED:438 — REDACTED:438-454 | REDACTED:738-754 | REDACTED:687-713 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (26 lines × 9) · ×1
  • Duplicated block (26 lines × 9) REDACTED:1299 — REDACTED:1299-1324 | REDACTED:1274-1299 | REDACTED:1171-1196 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1386-1411 | php/PHPshell/【r57_iFX】/r57_iFX.php:948-973 | php/PHPshell/【r57_karta】/r57_kartal.php:919-944 | php/PHPshell/【r57】/r57.php:1176-1201 | REDACTED:1290-1315 | REDACTED:1122-1147 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (26 lines × 5) · ×1
  • Duplicated block (26 lines × 5) REDACTED:1665 — REDACTED:1665-1690 | php/angel大马.php:1665-1690 | REDACTED:1665-1690 | php/phpspy/2013未加密.php:1136-1161 | REDACTED:1662-1687 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (22–26 lines × 4) · ×1
  • Duplicated block (22–26 lines × 4) REDACTED:661 — REDACTED:661-686 | REDACTED:411-436 | REDACTED:224-245 | REDACTED:433-458 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (27 lines × 13) · ×1
  • Duplicated block (27 lines × 13) REDACTED:790 — REDACTED:790-816 | php/wso/wso-4.1.3.php:416-442 | php/wso/wso-4.2.0.php:416-442 | php/wso/wso-4.2.1.php:416-442 | php/wso/wso-4.2.2.php:415-441 | php/wso/wso-4.2.3.php:419-445 | php/wso/wso-4.2.4.php:424-450 | php/wso/wso-4.2.5.php:430-456 | REDACTED:792-818 | REDACTED:1233-1259 | REDACTED:792-818 | php/zxc/.v.php:434-460 | REDACTED:779-805 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:790` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (25 lines × 4) · ×1
  • Duplicated block (25 lines × 4) REDACTED:124 — REDACTED:124-148 | REDACTED:192-216 | REDACTED:120-144 | REDACTED:188-212 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:124` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (57 lines × 4) · ×1
  • Duplicated block (57 lines × 4) REDACTED:615 — REDACTED:615-671 | REDACTED:617-673 | REDACTED:617-673 | REDACTED:604-660 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:615` 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.
D4 · Code Duplication · Duplicated block (24–25 lines × 4) · ×1
  • Duplicated block (24–25 lines × 4) REDACTED:461 — REDACTED:461-484 | REDACTED:761-784 | REDACTED:812-836 | REDACTED:738-761 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:461` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (37 lines × 16) · ×1
  • Duplicated block (37 lines × 16) REDACTED:889 — REDACTED:889-925 | REDACTED:478-514 | php/wso/wso-4.1.3.php:515-551 | php/wso/wso-4.2.0.php:515-551 | php/wso/wso-4.2.1.php:515-551 | php/wso/wso-4.2.2.php:514-550 | php/wso/wso-4.2.3.php:518-554 | php/wso/wso-4.2.4.php:523-559 | php/wso/wso-4.2.5.php:529-565 | REDACTED:778-814 | REDACTED:891-927 | REDACTED:1332-1368 | REDACTED:891-927 | php/zxc/.v.php:533-569 | REDACTED:878-914 | REDACTED:755-791 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:889` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (24 lines × 11) · ×1
  • Duplicated block (24 lines × 11) REDACTED:977 — REDACTED:977-1000 | php/wso/wso-4.1.3.php:1059-1082 | php/wso/wso-4.2.0.php:1056-1079 | php/wso/wso-4.2.1.php:1052-1075 | php/wso/wso-4.2.2.php:1051-1074 | php/wso/wso-4.2.3.php:1055-1078 | php/wso/wso-4.2.4.php:1060-1083 | php/wso/wso-4.2.5.php:1066-1089 | REDACTED:857-880 | php/zxc/.v.php:1063-1086 | REDACTED:917-940 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:977` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (162–163 lines × 7) · ×1
  • Duplicated block (162–163 lines × 7) php/wso/wso-4.1.3.php:757 — php/wso/wso-4.1.3.php:757-919 | php/wso/wso-4.2.1.php:749-911 | php/wso/wso-4.2.2.php:748-910 | php/wso/wso-4.2.3.php:752-914 | php/wso/wso-4.2.4.php:757-919 | php/wso/wso-4.2.5.php:763-925 | php/zxc/.v.php:766-927 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.1.php` as WHOLE FILES: this scan already matched 102 separate duplicated blocks between them, totalling at least 1993 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:757` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (23–24 lines × 5) · ×1
  • Duplicated block (23–24 lines × 5) REDACTED:1462 — REDACTED:1462-1484 | REDACTED:1464-1486 | REDACTED:1944-1967 | REDACTED:1464-1486 | REDACTED:1457-1479 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1462` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1485` calls `sleep` and `REDACTED:1968` 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.
D4 · Code Duplication · Duplicated block (61 lines × 13) · ×1
  • Duplicated block (61 lines × 13) REDACTED:532 — REDACTED:532-592 | php/wso/wso-4.1.3.php:780-840 | php/wso/wso-4.2.0.php:776-836 | php/wso/wso-4.2.1.php:772-832 | php/wso/wso-4.2.2.php:771-831 | php/wso/wso-4.2.3.php:775-835 | php/wso/wso-4.2.4.php:780-840 | php/wso/wso-4.2.5.php:786-846 | REDACTED:534-594 | REDACTED:971-1031 | REDACTED:534-594 | php/zxc/.v.php:788-848 | REDACTED:521-581 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:532` 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.
D4 · Code Duplication · Duplicated block (24 lines × 13) · ×1
  • Duplicated block (24 lines × 13) REDACTED:1290 — REDACTED:1290-1313 | php/wso/wso-4.1.3.php:1399-1422 | php/wso/wso-4.2.0.php:1396-1419 | php/wso/wso-4.2.1.php:1392-1415 | php/wso/wso-4.2.2.php:1391-1414 | php/wso/wso-4.2.3.php:1395-1418 | php/wso/wso-4.2.4.php:1400-1423 | php/wso/wso-4.2.5.php:1406-1429 | REDACTED:1292-1315 | REDACTED:1771-1794 | REDACTED:1292-1315 | php/zxc/.v.php:1406-1429 | REDACTED:1285-1308 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1290` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `php/wso/wso-4.1.3.php:1399` calls `connect` and `REDACTED:1290` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (23 lines × 4) · ×1
  • Duplicated block (23 lines × 4) REDACTED:1145 — REDACTED:1145-1167 | php/PHPshell/【r57_iFX】/r57_iFX.php:922-944 | php/PHPshell/【r57_karta】/r57_kartal.php:893-915 | php/PHPshell/【r57】/r57.php:1150-1172 — before extracting anything, compare `REDACTED` and `php/PHPshell/【r57_iFX】/r57_iFX.php` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (49 lines × 4) · ×1
  • Duplicated block (49 lines × 4) REDACTED:737 — REDACTED:737-785 | REDACTED:739-787 | REDACTED:739-787 | REDACTED:726-774 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:737` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (23 lines × 3) · ×1
  • Duplicated block (23 lines × 3) REDACTED:439 — REDACTED:439-461 | REDACTED:443-465 | REDACTED:494-516 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (25 lines × 3) · ×1
  • Duplicated block (25 lines × 3) REDACTED:235 — REDACTED:235-259 | REDACTED:235-259 | REDACTED:216-240 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:216` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (21–22 lines × 16) · ×1
  • Duplicated block (21–22 lines × 16) REDACTED:1093 — REDACTED:1093-1113 | REDACTED:1165-1185 | php/wso/wso-4.1.3.php:1202-1223 | php/wso/wso-4.2.0.php:1199-1220 | php/wso/wso-4.2.1.php:1195-1216 | php/wso/wso-4.2.2.php:1194-1215 | php/wso/wso-4.2.3.php:1198-1219 | php/wso/wso-4.2.4.php:1203-1224 | php/wso/wso-4.2.5.php:1209-1230 | REDACTED:1101-1121 | REDACTED:1095-1115 | REDACTED:1581-1601 | REDACTED:1095-1115 | php/zxc/.v.php:1209-1230 | REDACTED:1082-1102 | REDACTED:1003-1023 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1093` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (20–22 lines × 2) · ×1
  • Duplicated block (20–22 lines × 2) REDACTED:536 — REDACTED:536-555 | REDACTED:558-579 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:536` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (21 lines × 16) · ×1
  • Duplicated block (21 lines × 16) REDACTED:1176 — REDACTED:1176-1196 | REDACTED:1249-1269 | php/wso/wso-4.1.3.php:1285-1305 | php/wso/wso-4.2.0.php:1282-1302 | php/wso/wso-4.2.1.php:1278-1298 | php/wso/wso-4.2.2.php:1277-1297 | php/wso/wso-4.2.3.php:1281-1301 | php/wso/wso-4.2.4.php:1286-1306 | php/wso/wso-4.2.5.php:1292-1312 | REDACTED:1183-1203 | REDACTED:1178-1198 | REDACTED:1664-1684 | REDACTED:1178-1198 | php/zxc/.v.php:1292-1312 | REDACTED:1187-1207 | REDACTED:1171-1191 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1176` 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.
D4 · Code Duplication · Duplicated block (23 lines × 11) · ×1
  • Duplicated block (23 lines × 11) REDACTED:1500 — REDACTED:1500-1522 | php/wso/wso-4.1.3.php:1592-1614 | php/wso/wso-4.2.0.php:1589-1611 | php/wso/wso-4.2.1.php:1585-1607 | php/wso/wso-4.2.2.php:1584-1606 | php/wso/wso-4.2.3.php:1588-1610 | php/wso/wso-4.2.4.php:1593-1615 | php/wso/wso-4.2.5.php:1599-1621 | REDACTED:1434-1456 | php/zxc/.v.php:1599-1621 | REDACTED:1450-1472 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1500` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (21 lines × 7) · ×1
  • Duplicated block (21 lines × 7) php/wso/wso-4.2.0.php:559 — php/wso/wso-4.2.0.php:559-579 | php/wso/wso-4.2.1.php:559-579 | php/wso/wso-4.2.2.php:558-578 | php/wso/wso-4.2.3.php:562-582 | php/wso/wso-4.2.4.php:567-587 | php/wso/wso-4.2.5.php:573-593 | php/zxc/.v.php:577-597 — before extracting anything, compare `php/wso/wso-4.2.0.php` and `php/wso/wso-4.2.1.php` as WHOLE FILES: this scan already matched 93 separate duplicated blocks between them, totalling at least 1670 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.2.0.php:559` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (29 lines × 3) · ×1
  • Duplicated block (29 lines × 3) REDACTED:619 — REDACTED:619-647 | REDACTED:619-647 | REDACTED:600-628 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:600` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (19–20 lines × 17) · ×1
  • Duplicated block (19–20 lines × 17) REDACTED:305 — REDACTED:305-324 | REDACTED:230-248 | php/wso/wso-4.1.3.php:236-254 | php/wso/wso-4.2.0.php:252-270 | php/wso/wso-4.2.1.php:252-270 | php/wso/wso-4.2.2.php:251-269 | php/wso/wso-4.2.3.php:255-273 | php/wso/wso-4.2.4.php:260-278 | php/wso/wso-4.2.5.php:266-284 | REDACTED:291-310 | REDACTED:307-326 | REDACTED:313-332 | REDACTED:307-326 | php/zxc/.v.php:270-288 | REDACTED:320-339 | REDACTED:297-316 | REDACTED:298-317 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:230` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (20 lines × 13) · ×1
  • Duplicated block (20 lines × 13) REDACTED:1269 — REDACTED:1269-1288 | php/wso/wso-4.1.3.php:1378-1397 | php/wso/wso-4.2.0.php:1375-1394 | php/wso/wso-4.2.1.php:1371-1390 | php/wso/wso-4.2.2.php:1370-1389 | php/wso/wso-4.2.3.php:1374-1393 | php/wso/wso-4.2.4.php:1379-1398 | php/wso/wso-4.2.5.php:1385-1404 | REDACTED:1271-1290 | REDACTED:1750-1769 | REDACTED:1271-1290 | php/zxc/.v.php:1385-1404 | REDACTED:1264-1283 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1269` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (20 lines × 12) · ×1
  • Duplicated block (20 lines × 12) REDACTED:966 — REDACTED:966-985 | php/wso/wso-4.1.3.php:1048-1067 | php/wso/wso-4.2.0.php:1045-1064 | php/wso/wso-4.2.1.php:1041-1060 | php/wso/wso-4.2.2.php:1040-1059 | php/wso/wso-4.2.3.php:1044-1063 | php/wso/wso-4.2.4.php:1049-1068 | php/wso/wso-4.2.5.php:1055-1074 | REDACTED:846-865 | php/zxc/.v.php:1052-1071 | REDACTED:906-925 | REDACTED:828-847 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:966` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (20 lines × 6) · ×1
  • Duplicated block (20 lines × 6) REDACTED:327 — REDACTED:327-346 | REDACTED:301-320 | REDACTED:343-362 | REDACTED:347-366 | REDACTED:390-409 | REDACTED:323-342 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:346` calls `is_file` and `REDACTED:322` 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.
D4 · Code Duplication · Duplicated block (20 lines × 5) · ×1
  • Duplicated block (20 lines × 5) REDACTED:430 — REDACTED:430-449 | REDACTED:432-451 | REDACTED:433-452 | REDACTED:432-451 | REDACTED:419-438 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:432` calls `array` and `REDACTED:430` 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.
D4 · Code Duplication · Duplicated block (20 lines × 4) · ×1
  • Duplicated block (20 lines × 4) REDACTED:1288 — REDACTED:1288-1307 | REDACTED:1222-1241 | REDACTED:1226-1245 | REDACTED:1085-1104 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1288` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:1287` calls `pg_set_client_encoding` and `REDACTED:1084` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (1–20 lines × 9) · ×1
  • Duplicated block (1–20 lines × 9) REDACTED:2333 — REDACTED:2333-2334 | REDACTED:2335-2335 | REDACTED:2346-2365 | www-7jyewu-cn/免杀php大马.php:2333-2334 | www-7jyewu-cn/免杀php大马.php:2335-2335 | www-7jyewu-cn/免杀php大马.php:2346-2365 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2333-2334 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2335-2335 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2346-2365 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2333` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (17–19 lines × 13) · ×1
  • Duplicated block (17–19 lines × 13) REDACTED:235 — REDACTED:235-251 | php/wso/wso-4.1.3.php:175-191 | php/wso/wso-4.2.0.php:190-206 | php/wso/wso-4.2.1.php:190-206 | php/wso/wso-4.2.2.php:189-205 | php/wso/wso-4.2.3.php:193-209 | php/wso/wso-4.2.4.php:198-214 | php/wso/wso-4.2.5.php:201-217 | REDACTED:237-253 | REDACTED:240-258 | REDACTED:237-253 | php/zxc/.v.php:205-221 | REDACTED:227-243 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:235` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:251` calls `array` and `REDACTED:258` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (1–19 lines × 11) · ×1
  • Duplicated block (1–19 lines × 11) REDACTED:1176 — REDACTED:1176-1194 | REDACTED:147-165 | REDACTED:1125-1143 | REDACTED:969-987 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1237-1255 | php/PHPshell/【r57_iFX】/r57_iFX.php:772-790 | php/PHPshell/【r57_karta】/r57_kartal.php:743-761 | php/PHPshell/【r57】/r57.php:974-992 | REDACTED:1167-1185 | REDACTED:450-450 | REDACTED:999-1017 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1176` 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 `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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (19 lines × 4) · ×1
  • Duplicated block (19 lines × 4) REDACTED:2017 — REDACTED:2017-2035 | php/angel大马.php:2017-2035 | REDACTED:2016-2034 | REDACTED:2013-2031 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2017` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) php/PHPshell/PHP Shell/PHP Shell.php:143 — php/PHPshell/PHP Shell/PHP Shell.php:143-161 | web-malware-collection-13-06-2012/PHP/Macker's Private PHPShell.php:285-303 — before extracting anything, compare `php/PHPshell/PHP Shell/PHP Shell.php` and `web-malware-collection-13-06-2012/PHP/Macker's Private PHPShell.php` as WHOLE FILES: 98% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (18 lines × 16) · ×1
  • Duplicated block (18 lines × 16) REDACTED:1201 — REDACTED:1201-1218 | REDACTED:1274-1291 | php/wso/wso-4.1.3.php:1310-1327 | php/wso/wso-4.2.0.php:1307-1324 | php/wso/wso-4.2.1.php:1303-1320 | php/wso/wso-4.2.2.php:1302-1319 | php/wso/wso-4.2.3.php:1306-1323 | php/wso/wso-4.2.4.php:1311-1328 | php/wso/wso-4.2.5.php:1317-1334 | REDACTED:1208-1225 | REDACTED:1203-1220 | REDACTED:1689-1706 | REDACTED:1203-1220 | php/zxc/.v.php:1317-1334 | REDACTED:1212-1229 | REDACTED:1196-1213 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1201` 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.
D4 · Code Duplication · Duplicated block (20 lines × 16) · ×1
  • Duplicated block (20 lines × 16) REDACTED:1329 — REDACTED:1329-1348 | REDACTED:1364-1383 | php/wso/wso-4.1.3.php:1438-1457 | php/wso/wso-4.2.0.php:1435-1454 | php/wso/wso-4.2.1.php:1431-1450 | php/wso/wso-4.2.2.php:1430-1449 | php/wso/wso-4.2.3.php:1434-1453 | php/wso/wso-4.2.4.php:1439-1458 | php/wso/wso-4.2.5.php:1445-1464 | REDACTED:1298-1317 | REDACTED:1331-1350 | REDACTED:1811-1830 | REDACTED:1331-1350 | php/zxc/.v.php:1445-1464 | REDACTED:1302-1321 | REDACTED:1324-1343 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1329` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (18 lines × 12) · ×1
  • Duplicated block (18 lines × 12) REDACTED:878 — REDACTED:878-895 | php/wso/wso-4.1.3.php:504-521 | php/wso/wso-4.2.0.php:504-521 | php/wso/wso-4.2.1.php:504-521 | php/wso/wso-4.2.2.php:503-520 | php/wso/wso-4.2.3.php:507-524 | php/wso/wso-4.2.4.php:512-529 | php/wso/wso-4.2.5.php:518-535 | REDACTED:880-897 | REDACTED:880-897 | php/zxc/.v.php:522-539 | REDACTED:867-884 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:878` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (18 lines × 5) · ×1
  • Duplicated block (18 lines × 5) REDACTED:565 — REDACTED:565-582 | REDACTED:534-551 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:641-658 | REDACTED:558-575 | REDACTED:519-536 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (18 lines × 4) · ×1
  • Duplicated block (18 lines × 4) REDACTED:1725 — REDACTED:1725-1742 | php/angel大马.php:1725-1742 | REDACTED:1725-1742 | REDACTED:1722-1739 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (17 lines × 17) · ×1
  • Duplicated block (17 lines × 17) REDACTED:1137 — REDACTED:1137-1153 | REDACTED:1210-1226 | php/wso/wso-4.1.3.php:1246-1262 | php/wso/wso-4.2.0.php:1243-1259 | php/wso/wso-4.2.1.php:1239-1255 | php/wso/wso-4.2.2.php:1238-1254 | php/wso/wso-4.2.3.php:1242-1258 | php/wso/wso-4.2.4.php:1247-1263 | php/wso/wso-4.2.5.php:1253-1269 | REDACTED:1144-1160 | REDACTED:1139-1155 | REDACTED:1625-1641 | REDACTED:1139-1155 | php/zxc/.v.php:1253-1269 | REDACTED:1148-1164 | REDACTED:1132-1148 | REDACTED:1041-1057 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1137` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1155` calls `pg_query` and `REDACTED:1058` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (2–17 lines × 13) · ×1
  • Duplicated block (2–17 lines × 13) REDACTED:322 — REDACTED:322-338 | php/wso/wso-4.1.3.php:362-377 | php/wso/wso-4.2.0.php:362-377 | php/wso/wso-4.2.1.php:362-377 | php/wso/wso-4.2.2.php:361-376 | php/wso/wso-4.2.3.php:365-380 | php/wso/wso-4.2.4.php:370-385 | php/wso/wso-4.2.5.php:376-391 | REDACTED:382-398 | php/zxc/.v.php:380-395 | REDACTED:428-429 | REDACTED:379-382 | REDACTED:391-394 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:322` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:339` calls `array` and `php/wso/wso-4.1.3.php:378` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (17 lines × 9) · ×1
  • Duplicated block (17 lines × 9) REDACTED:1479 — REDACTED:1479-1495 | php/wso/wso-4.1.3.php:1571-1587 | php/wso/wso-4.2.0.php:1568-1584 | php/wso/wso-4.2.1.php:1564-1580 | php/wso/wso-4.2.2.php:1563-1579 | php/wso/wso-4.2.3.php:1567-1583 | php/wso/wso-4.2.4.php:1572-1588 | php/wso/wso-4.2.5.php:1578-1594 | php/zxc/.v.php:1578-1594 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1479` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17 lines × 4) · ×1
  • Duplicated block (17 lines × 4) REDACTED:514 — REDACTED:514-530 | REDACTED:516-532 | REDACTED:516-532 | REDACTED:503-519 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:514` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (16 lines × 13) · ×1
  • Duplicated block (16 lines × 13) REDACTED:599 — REDACTED:599-614 | php/wso/wso-4.1.3.php:847-862 | php/wso/wso-4.2.0.php:843-858 | php/wso/wso-4.2.1.php:839-854 | php/wso/wso-4.2.2.php:838-853 | php/wso/wso-4.2.3.php:842-857 | php/wso/wso-4.2.4.php:847-862 | php/wso/wso-4.2.5.php:853-868 | REDACTED:601-616 | REDACTED:1038-1053 | REDACTED:601-616 | php/zxc/.v.php:855-870 | REDACTED:588-603 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:599` 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.
D4 · Code Duplication · Duplicated block (16 lines × 12) · ×1
  • Duplicated block (16 lines × 12) REDACTED:217 — REDACTED:217-232 | php/wso/wso-4.1.3.php:157-172 | php/wso/wso-4.2.0.php:172-187 | php/wso/wso-4.2.1.php:172-187 | php/wso/wso-4.2.2.php:171-186 | php/wso/wso-4.2.3.php:175-190 | php/wso/wso-4.2.4.php:180-195 | php/wso/wso-4.2.5.php:183-198 | REDACTED:219-234 | REDACTED:219-234 | php/zxc/.v.php:187-202 | REDACTED:209-224 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:217` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (31 lines × 11) · ×1
  • Duplicated block (31 lines × 11) REDACTED:634 — REDACTED:634-664 | php/wso/wso-4.1.3.php:882-912 | php/wso/wso-4.2.1.php:874-904 | php/wso/wso-4.2.2.php:873-903 | php/wso/wso-4.2.3.php:877-907 | php/wso/wso-4.2.4.php:882-912 | php/wso/wso-4.2.5.php:888-918 | REDACTED:636-666 | REDACTED:636-666 | php/zxc/.v.php:890-920 | REDACTED:623-653 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:634` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (16 lines × 4) · ×1
  • Duplicated block (16 lines × 4) REDACTED:515 — REDACTED:515-530 | REDACTED:815-830 | REDACTED:870-885 | REDACTED:792-807 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:870` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (1–16 lines × 13) · ×1
  • Duplicated block (1–16 lines × 13) REDACTED:696 — REDACTED:696-696 | php/wso/wso-4.1.3.php:945-945 | php/wso/wso-4.2.0.php:942-942 | php/wso/wso-4.2.1.php:937-937 | php/wso/wso-4.2.2.php:936-936 | php/wso/wso-4.2.3.php:940-940 | php/wso/wso-4.2.4.php:931-946 | php/wso/wso-4.2.5.php:937-952 | REDACTED:698-698 | REDACTED:1137-1137 | REDACTED:698-698 | php/zxc/.v.php:939-954 | REDACTED:685-685 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.2.4.php:931` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10–16 lines × 2) · ×1
  • Duplicated block (10–16 lines × 2) REDACTED:422 — REDACTED:422-431 | REDACTED:412-427 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:422` 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.
D4 · Code Duplication · Duplicated block (15 lines × 14) · ×1
  • Duplicated block (15 lines × 14) REDACTED:1463 — REDACTED:1463-1477 | REDACTED:1481-1495 | php/wso/wso-4.1.3.php:1573-1587 | php/wso/wso-4.2.0.php:1570-1584 | php/wso/wso-4.2.1.php:1566-1580 | php/wso/wso-4.2.2.php:1565-1579 | php/wso/wso-4.2.3.php:1569-1583 | php/wso/wso-4.2.4.php:1574-1588 | php/wso/wso-4.2.5.php:1580-1594 | REDACTED:1465-1479 | REDACTED:1945-1960 | REDACTED:1465-1479 | php/zxc/.v.php:1580-1594 | REDACTED:1458-1472 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1463` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15 lines × 11) · ×1
  • Duplicated block (15 lines × 11) REDACTED:256 — REDACTED:256-270 | REDACTED:225-239 | REDACTED:220-234 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:332-346 | php/PHPshell/【r57】/r57.php:225-239 | REDACTED:249-263 | REDACTED:210-224 | REDACTED:1549-1563 | REDACTED:2260-2274 | www-7jyewu-cn/免杀php大马.php:2260-2274 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2260-2274 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (18–29 lines × 8) · ×1
  • Duplicated block (18–29 lines × 8) REDACTED:1919 — REDACTED:1919-1936 | REDACTED:1949-1977 | php/angel大马.php:1919-1936 | php/angel大马.php:1949-1977 | REDACTED:1919-1936 | REDACTED:1949-1977 | REDACTED:1916-1933 | REDACTED:1946-1974 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1919` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (15 lines × 8) · ×1
  • Duplicated block (15 lines × 8) REDACTED:94 — REDACTED:94-108 | REDACTED:109-123 | REDACTED:160-174 | REDACTED:176-190 | REDACTED:90-104 | REDACTED:105-119 | REDACTED:156-170 | REDACTED:172-186 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:109` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:109` calls `elseif` and `REDACTED:160` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (15 lines × 5) · ×1
  • Duplicated block (15 lines × 5) REDACTED:547 — REDACTED:547-561 | REDACTED:516-530 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:623-637 | REDACTED:540-554 | REDACTED:501-515 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (13–15 lines × 5) · ×1
  • Duplicated block (13–15 lines × 5) REDACTED:749 — REDACTED:749-761 | REDACTED:751-763 | REDACTED:1189-1203 | REDACTED:751-763 | REDACTED:738-750 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:749` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:761` calls `substr` and `REDACTED:1203` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (14–15 lines × 5) · ×1
  • Duplicated block (14–15 lines × 5) REDACTED:507 — REDACTED:507-520 | REDACTED:807-820 | REDACTED:1361-1374 | REDACTED:861-875 | REDACTED:784-797 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:507` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (15 lines × 4) · ×1
  • Duplicated block (15 lines × 4) REDACTED:429 — REDACTED:429-443 | REDACTED:473-487 | REDACTED:477-491 | REDACTED:530-544 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:429` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:529` calls `array` and `REDACTED:473` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9–15 lines × 4) · ×1
  • Duplicated block (9–15 lines × 4) REDACTED:709 — REDACTED:709-717 | REDACTED:1105-1119 | REDACTED:709-717 | REDACTED:690-698 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1105` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14–15 lines × 4) · ×1
  • Duplicated block (14–15 lines × 4) REDACTED:392 — REDACTED:392-405 | REDACTED:692-705 | REDACTED:739-753 | REDACTED:715-729 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 85 separate duplicated blocks between them, totalling at least 1416 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:392` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9–15 lines × 2) · ×1
  • Duplicated block (9–15 lines × 2) REDACTED:405 — REDACTED:405-413 | REDACTED:395-409 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:405` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14 lines × 17) · ×1
  • Duplicated block (14 lines × 17) REDACTED:528 — REDACTED:528-541 | REDACTED:727-740 | php/wso/wso-4.1.3.php:776-789 | php/wso/wso-4.2.0.php:772-785 | php/wso/wso-4.2.1.php:768-781 | php/wso/wso-4.2.2.php:767-780 | php/wso/wso-4.2.3.php:771-784 | php/wso/wso-4.2.4.php:776-789 | php/wso/wso-4.2.5.php:782-795 | REDACTED:483-496 | REDACTED:530-543 | REDACTED:967-980 | REDACTED:530-543 | php/zxc/.v.php:784-797 | REDACTED:520-533 | REDACTED:517-530 | REDACTED:468-481 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:528` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14 lines × 12) · ×1
  • Duplicated block (14 lines × 12) REDACTED:977 — REDACTED:977-990 | php/wso/wso-4.1.3.php:1059-1072 | php/wso/wso-4.2.0.php:1056-1069 | php/wso/wso-4.2.1.php:1052-1065 | php/wso/wso-4.2.2.php:1051-1064 | php/wso/wso-4.2.3.php:1055-1068 | php/wso/wso-4.2.4.php:1060-1073 | php/wso/wso-4.2.5.php:1066-1079 | REDACTED:857-870 | REDACTED:1409-1422 | php/zxc/.v.php:1063-1076 | REDACTED:917-930 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (20–23 lines × 8) · ×1
  • Duplicated block (20–23 lines × 8) php/wso/wso-4.1.3.php:212 — php/wso/wso-4.1.3.php:212-231 | php/wso/wso-4.2.0.php:228-247 | php/wso/wso-4.2.1.php:228-247 | php/wso/wso-4.2.2.php:227-246 | php/wso/wso-4.2.3.php:231-250 | php/wso/wso-4.2.4.php:236-255 | php/wso/wso-4.2.5.php:239-261 | php/zxc/.v.php:243-265 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:212` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (32 lines × 8) · ×1
  • Duplicated block (32 lines × 8) php/wso/wso-4.1.3.php:705 — php/wso/wso-4.1.3.php:705-736 | php/wso/wso-4.2.0.php:715-746 | php/wso/wso-4.2.1.php:715-746 | php/wso/wso-4.2.2.php:714-745 | php/wso/wso-4.2.3.php:718-749 | php/wso/wso-4.2.4.php:723-754 | php/wso/wso-4.2.5.php:729-760 | php/zxc/.v.php:732-763 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:705` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (53 lines × 5) · ×1
  • Duplicated block (53 lines × 5) REDACTED:491 — REDACTED:491-543 | REDACTED:460-512 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:567-619 | REDACTED:484-536 | REDACTED:445-497 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:491` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (12–13 lines × 17) · ×1
  • Duplicated block (12–13 lines × 17) REDACTED:1331 — REDACTED:1331-1343 | REDACTED:1366-1378 | php/wso/wso-4.1.3.php:1440-1452 | php/wso/wso-4.2.0.php:1437-1449 | php/wso/wso-4.2.1.php:1433-1445 | php/wso/wso-4.2.2.php:1432-1444 | php/wso/wso-4.2.3.php:1436-1448 | php/wso/wso-4.2.4.php:1441-1453 | php/wso/wso-4.2.5.php:1447-1459 | REDACTED:1300-1312 | REDACTED:1333-1345 | REDACTED:1813-1825 | REDACTED:1333-1345 | php/zxc/.v.php:1447-1459 | REDACTED:1304-1316 | REDACTED:1326-1338 | REDACTED:1145-1156 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1331` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (13 lines × 16) · ×1
  • Duplicated block (13 lines × 16) REDACTED:1058 — REDACTED:1058-1070 | REDACTED:1130-1142 | php/wso/wso-4.1.3.php:1167-1179 | php/wso/wso-4.2.0.php:1164-1176 | php/wso/wso-4.2.1.php:1160-1172 | php/wso/wso-4.2.2.php:1159-1171 | php/wso/wso-4.2.3.php:1163-1175 | php/wso/wso-4.2.4.php:1168-1180 | php/wso/wso-4.2.5.php:1174-1186 | REDACTED:1066-1078 | REDACTED:1060-1072 | REDACTED:1546-1558 | REDACTED:1060-1072 | php/zxc/.v.php:1174-1186 | REDACTED:1047-1059 | REDACTED:968-980 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1058` 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.
D4 · Code Duplication · Duplicated block (13 lines × 12) · ×1
  • Duplicated block (13 lines × 12) REDACTED:987 — REDACTED:987-999 | php/wso/wso-4.1.3.php:1069-1081 | php/wso/wso-4.2.0.php:1066-1078 | php/wso/wso-4.2.1.php:1062-1074 | php/wso/wso-4.2.2.php:1061-1073 | php/wso/wso-4.2.3.php:1065-1077 | php/wso/wso-4.2.4.php:1070-1082 | php/wso/wso-4.2.5.php:1076-1088 | REDACTED:867-879 | php/zxc/.v.php:1073-1085 | REDACTED:927-939 | REDACTED:849-861 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:987` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (12–13 lines × 11) · ×1
  • Duplicated block (12–13 lines × 11) REDACTED:308 — REDACTED:308-320 | php/wso/wso-4.1.3.php:347-358 | php/wso/wso-4.2.0.php:347-358 | php/wso/wso-4.2.1.php:347-358 | php/wso/wso-4.2.2.php:346-357 | php/wso/wso-4.2.3.php:350-361 | php/wso/wso-4.2.4.php:355-366 | php/wso/wso-4.2.5.php:361-372 | REDACTED:368-380 | php/zxc/.v.php:365-376 | REDACTED:366-378 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:307` calls `printHeader` and `REDACTED:365` 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.
D4 · Code Duplication · Duplicated block (12–13 lines × 5) · ×1
  • Duplicated block (12–13 lines × 5) REDACTED:254 — REDACTED:254-265 | REDACTED:256-267 | REDACTED:262-274 | REDACTED:256-267 | REDACTED:246-257 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:254` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:261` calls `array`, `empty` and `REDACTED:254` 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.
D4 · Code Duplication · Duplicated block (14 lines × 4) · ×1
  • Duplicated block (14 lines × 4) REDACTED:1811 — REDACTED:1811-1824 | php/angel大马.php:1811-1824 | REDACTED:1811-1824 | REDACTED:1808-1821 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (3–13 lines × 7) · ×1
  • Duplicated block (3–13 lines × 7) REDACTED:820 — REDACTED:820-832 | php/wso/wso-4.2.0.php:896-908 | REDACTED:576-588 | REDACTED:1091-1103 | REDACTED:610-613 | REDACTED:623-625 | REDACTED:559-561 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 835 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:820` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:818` calls `array`, `count` and `REDACTED:610` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (1–13 lines × 13) · ×1
  • Duplicated block (1–13 lines × 13) REDACTED:1327 — REDACTED:1327-1327 | php/wso/wso-4.1.3.php:1436-1436 | php/wso/wso-4.2.0.php:1421-1432 | php/wso/wso-4.2.1.php:1429-1429 | php/wso/wso-4.2.2.php:1428-1428 | php/wso/wso-4.2.3.php:1432-1432 | php/wso/wso-4.2.4.php:1437-1437 | php/wso/wso-4.2.5.php:1443-1443 | REDACTED:1329-1329 | REDACTED:1796-1808 | REDACTED:1329-1329 | php/zxc/.v.php:1443-1443 | REDACTED:1322-1322 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1327` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `php/wso/wso-4.2.0.php:1432` calls `empty`, `htmlspecialchars` and `php/wso/wso-4.1.3.php:1436` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (11–12 lines × 17) · ×1
  • Duplicated block (11–12 lines × 17) REDACTED:887 — REDACTED:887-897 | REDACTED:476-486 | php/wso/wso-4.1.3.php:513-523 | php/wso/wso-4.2.0.php:513-523 | php/wso/wso-4.2.1.php:513-523 | php/wso/wso-4.2.2.php:512-522 | php/wso/wso-4.2.3.php:516-526 | php/wso/wso-4.2.4.php:521-531 | php/wso/wso-4.2.5.php:527-537 | REDACTED:776-786 | REDACTED:889-899 | REDACTED:1330-1340 | REDACTED:889-899 | php/zxc/.v.php:531-541 | REDACTED:828-839 | REDACTED:876-886 | REDACTED:753-763 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:828` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (12 lines × 16) · ×1
  • Duplicated block (12 lines × 16) REDACTED:841 — REDACTED:841-852 | REDACTED:436-447 | php/wso/wso-4.1.3.php:467-478 | php/wso/wso-4.2.0.php:467-478 | php/wso/wso-4.2.1.php:467-478 | php/wso/wso-4.2.2.php:466-477 | php/wso/wso-4.2.3.php:470-481 | php/wso/wso-4.2.4.php:475-486 | php/wso/wso-4.2.5.php:481-492 | REDACTED:736-747 | REDACTED:843-854 | REDACTED:1284-1295 | REDACTED:843-854 | php/zxc/.v.php:485-496 | REDACTED:830-841 | REDACTED:685-696 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:841` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (10–12 lines × 13) · ×1
  • Duplicated block (10–12 lines × 13) REDACTED:217 — REDACTED:217-226 | REDACTED:186-195 | REDACTED:181-190 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:293-302 | php/PHPshell/【r57】/r57.php:186-195 | REDACTED:210-219 | REDACTED:171-180 | REDACTED:1477-1488 | REDACTED:2218-2227 | www-7jyewu-cn/免杀php大马.php:1477-1488 | www-7jyewu-cn/免杀php大马.php:2218-2227 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1477-1488 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2218-2227 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (12 lines × 13) · ×1
  • Duplicated block (12 lines × 13) REDACTED:927 — REDACTED:927-938 | php/wso/wso-4.1.3.php:553-564 | php/wso/wso-4.2.0.php:553-564 | php/wso/wso-4.2.1.php:553-564 | php/wso/wso-4.2.2.php:552-563 | php/wso/wso-4.2.3.php:556-567 | php/wso/wso-4.2.4.php:561-572 | php/wso/wso-4.2.5.php:567-578 | REDACTED:929-940 | REDACTED:1370-1381 | REDACTED:929-940 | php/zxc/.v.php:571-582 | REDACTED:916-927 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (11–12 lines × 12) · ×1
  • Duplicated block (11–12 lines × 12) REDACTED:685 — REDACTED:685-695 | php/wso/wso-4.1.3.php:713-723 | php/wso/wso-4.2.0.php:723-733 | php/wso/wso-4.2.1.php:723-733 | php/wso/wso-4.2.2.php:722-732 | php/wso/wso-4.2.3.php:726-736 | php/wso/wso-4.2.4.php:731-741 | php/wso/wso-4.2.5.php:737-747 | REDACTED:443-453 | php/zxc/.v.php:740-750 | REDACTED:478-489 | REDACTED:438-448 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:685` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:684` calls `printHeader` and `REDACTED:437` 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.
D4 · Code Duplication · Duplicated block (12 lines × 10) · ×1
  • Duplicated block (12 lines × 10) REDACTED:234 — REDACTED:234-245 | REDACTED:203-214 | REDACTED:198-209 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:310-321 | php/PHPshell/【r57】/r57.php:203-214 | REDACTED:227-238 | REDACTED:188-199 | REDACTED:2234-2245 | www-7jyewu-cn/免杀php大马.php:2234-2245 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2234-2245 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:234` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) REDACTED:608 — REDACTED:608-617 | REDACTED:665-676 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 547 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:608` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (1–12 lines × 3) · ×1
  • Duplicated block (1–12 lines × 3) REDACTED:627 — REDACTED:627-638 | REDACTED:665-676 | REDACTED:612-612 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 65 separate duplicated blocks between them, totalling at least 1035 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED: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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (11 lines × 16) · ×1
  • Duplicated block (11 lines × 16) REDACTED:807 — REDACTED:807-817 | REDACTED:405-415 | php/wso/wso-4.1.3.php:433-443 | php/wso/wso-4.2.0.php:433-443 | php/wso/wso-4.2.1.php:433-443 | php/wso/wso-4.2.2.php:432-442 | php/wso/wso-4.2.3.php:436-446 | php/wso/wso-4.2.4.php:441-451 | php/wso/wso-4.2.5.php:447-457 | REDACTED:705-715 | REDACTED:809-819 | REDACTED:1250-1260 | REDACTED:809-819 | php/zxc/.v.php:451-461 | REDACTED:753-763 | REDACTED:796-806 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:807` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (10 lines × 14) · ×1
  • Duplicated block (10 lines × 14) REDACTED:749 — REDACTED:749-758 | REDACTED:913-922 | php/wso/wso-4.1.3.php:997-1006 | php/wso/wso-4.2.0.php:993-1002 | php/wso/wso-4.2.1.php:989-998 | php/wso/wso-4.2.2.php:988-997 | php/wso/wso-4.2.3.php:992-1001 | php/wso/wso-4.2.4.php:998-1007 | php/wso/wso-4.2.5.php:1004-1013 | REDACTED:751-760 | REDACTED:1189-1199 | REDACTED:751-760 | php/zxc/.v.php:1006-1015 | REDACTED:738-747 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (12 lines × 12) · ×1
  • Duplicated block (12 lines × 12) REDACTED:1110 — REDACTED:1110-1121 | php/wso/wso-4.1.3.php:1147-1158 | php/wso/wso-4.2.0.php:1144-1155 | php/wso/wso-4.2.1.php:1140-1151 | php/wso/wso-4.2.2.php:1139-1150 | php/wso/wso-4.2.3.php:1143-1154 | php/wso/wso-4.2.4.php:1148-1159 | php/wso/wso-4.2.5.php:1154-1165 | REDACTED:1046-1057 | REDACTED:1526-1537 | php/zxc/.v.php:1154-1165 | REDACTED:948-959 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1110` 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, `REDACTED:1109` calls `printHeader` and `REDACTED:947` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10 lines × 8) · ×1
  • Duplicated block (10 lines × 8) REDACTED:683 — REDACTED:683-692 | php/wso/wso-4.1.3.php:931-941 | php/wso/wso-4.2.1.php:923-933 | php/wso/wso-4.2.2.php:922-932 | php/wso/wso-4.2.3.php:926-936 | REDACTED:685-694 | REDACTED:685-694 | REDACTED:672-681 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:683` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8–10 lines × 6) · ×1
  • Duplicated block (8–10 lines × 6) REDACTED:820 — REDACTED:820-827 | REDACTED:848-857 | REDACTED:820-827 | REDACTED:848-857 | REDACTED:801-808 | REDACTED:829-838 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 5) · ×1
  • Duplicated block (10 lines × 5) REDACTED:1591 — REDACTED:1591-1600 | php/angel大马.php:1591-1600 | REDACTED:1591-1600 | php/phpspy/2013未加密.php:1101-1110 | REDACTED:1588-1597 — before extracting anything, compare `REDACTED` and `php/angel大马.php` as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 315 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (1–10 lines × 5) · ×1
  • Duplicated block (1–10 lines × 5) REDACTED:656 — REDACTED:656-665 | REDACTED:1386-1386 | REDACTED:1387-1387 | REDACTED:656-665 | REDACTED:637-646 — there are 5 copies across 4 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1386` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (3–10 lines × 6) · ×1
  • Duplicated block (3–10 lines × 6) REDACTED:2320 — REDACTED:2320-2329 | REDACTED:2399-2401 | www-7jyewu-cn/免杀php大马.php:2320-2329 | www-7jyewu-cn/免杀php大马.php:2399-2401 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2320-2329 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2399-2401 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2399` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9 lines × 16) · ×1
  • Duplicated block (9 lines × 16) REDACTED:1271 — REDACTED:1271-1279 | REDACTED:1307-1315 | php/wso/wso-4.1.3.php:1380-1388 | php/wso/wso-4.2.0.php:1377-1385 | php/wso/wso-4.2.1.php:1373-1381 | php/wso/wso-4.2.2.php:1372-1380 | php/wso/wso-4.2.3.php:1376-1384 | php/wso/wso-4.2.4.php:1381-1389 | php/wso/wso-4.2.5.php:1387-1395 | REDACTED:1241-1249 | REDACTED:1273-1281 | REDACTED:1752-1760 | REDACTED:1273-1281 | php/zxc/.v.php:1387-1395 | REDACTED:1245-1253 | REDACTED:1266-1274 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1271` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9 lines × 15) · ×1
  • Duplicated block (9 lines × 15) REDACTED:411 — REDACTED:411-419 | REDACTED:326-334 | php/wso/wso-4.1.3.php:366-374 | php/wso/wso-4.2.0.php:366-374 | php/wso/wso-4.2.1.php:366-374 | php/wso/wso-4.2.2.php:365-373 | php/wso/wso-4.2.3.php:369-377 | php/wso/wso-4.2.4.php:374-382 | php/wso/wso-4.2.5.php:380-388 | REDACTED:386-394 | REDACTED:413-421 | REDACTED:413-421 | REDACTED:413-421 | php/zxc/.v.php:384-392 | REDACTED:400-408 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:411` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9 lines × 13) · ×1
  • Duplicated block (9 lines × 13) REDACTED:640 — REDACTED:640-648 | php/wso/wso-4.1.3.php:888-896 | php/wso/wso-4.2.0.php:885-893 | php/wso/wso-4.2.1.php:880-888 | php/wso/wso-4.2.2.php:879-887 | php/wso/wso-4.2.3.php:883-891 | php/wso/wso-4.2.4.php:888-896 | php/wso/wso-4.2.5.php:894-902 | REDACTED:642-650 | REDACTED:1079-1088 | REDACTED:642-650 | php/zxc/.v.php:896-904 | REDACTED:629-637 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:640` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9 lines × 12) · ×1
  • Duplicated block (9 lines × 12) REDACTED:258 — REDACTED:258-266 | REDACTED:227-235 | REDACTED:222-230 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:334-342 | php/PHPshell/【r57】/r57.php:227-235 | REDACTED:251-259 | REDACTED:212-220 | REDACTED:1529-1537 | REDACTED:1551-1559 | REDACTED:2262-2270 | www-7jyewu-cn/免杀php大马.php:2262-2270 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2262-2270 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (3–9 lines × 15) · ×1
  • Duplicated block (3–9 lines × 15) REDACTED:508 — REDACTED:508-510 | REDACTED:512-520 | REDACTED:522-530 | REDACTED:477-479 | REDACTED:481-489 | REDACTED:491-499 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:584-586 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:588-596 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:598-606 | REDACTED:501-503 | REDACTED:505-513 | REDACTED:515-523 | REDACTED:462-464 | REDACTED:466-474 | REDACTED:476-484 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:508` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (9 lines × 7) · ×1
  • Duplicated block (9 lines × 7) REDACTED:1213 — REDACTED:1213-1221 | REDACTED:1162-1170 | REDACTED:1006-1014 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1274-1282 | php/PHPshell/【r57】/r57.php:1011-1019 | REDACTED:1204-1212 | REDACTED:1036-1044 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (8–9 lines × 5) · ×1
  • Duplicated block (8–9 lines × 5) REDACTED:457 — REDACTED:457-465 | REDACTED:509-516 | REDACTED:514-521 | REDACTED:567-574 | REDACTED:629-636 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:457` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:518` calls `get_archiver_available`, `foreach` and `REDACTED:465` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8–9 lines × 4) · ×1
  • Duplicated block (8–9 lines × 4) REDACTED:334 — REDACTED:334-341 | REDACTED:362-370 | REDACTED:356-363 | REDACTED:384-392 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:334` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (16 lines × 3) · ×1
  • Duplicated block (16 lines × 3) REDACTED:730 — REDACTED:730-745 | REDACTED:763-778 | REDACTED:840-855 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (2–9 lines × 14) · ×1
  • Duplicated block (2–9 lines × 14) REDACTED:731 — REDACTED:731-732 | REDACTED:895-903 | php/wso/wso-4.1.3.php:979-980 | php/wso/wso-4.2.0.php:975-976 | php/wso/wso-4.2.1.php:971-972 | php/wso/wso-4.2.2.php:970-971 | php/wso/wso-4.2.3.php:974-975 | php/wso/wso-4.2.4.php:980-981 | php/wso/wso-4.2.5.php:986-987 | REDACTED:733-734 | REDACTED:1171-1179 | REDACTED:733-734 | php/zxc/.v.php:988-989 | REDACTED:720-721 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:731` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1181` calls `wsoHeader` and `REDACTED:905` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8 lines × 16) · ×1
  • Duplicated block (8 lines × 16) REDACTED:1072 — REDACTED:1072-1079 | REDACTED:1144-1151 | php/wso/wso-4.1.3.php:1181-1188 | php/wso/wso-4.2.0.php:1178-1185 | php/wso/wso-4.2.1.php:1174-1181 | php/wso/wso-4.2.2.php:1173-1180 | php/wso/wso-4.2.3.php:1177-1184 | php/wso/wso-4.2.4.php:1182-1189 | php/wso/wso-4.2.5.php:1188-1195 | REDACTED:1080-1087 | REDACTED:1074-1081 | REDACTED:1560-1567 | REDACTED:1074-1081 | php/zxc/.v.php:1188-1195 | REDACTED:1061-1068 | REDACTED:982-989 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1072` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7–8 lines × 15) · ×1
  • Duplicated block (7–8 lines × 15) REDACTED:1374 — REDACTED:1374-1381 | REDACTED:1402-1408 | php/wso/wso-4.1.3.php:1483-1490 | php/wso/wso-4.2.0.php:1480-1487 | php/wso/wso-4.2.1.php:1476-1483 | php/wso/wso-4.2.2.php:1475-1482 | php/wso/wso-4.2.3.php:1479-1486 | php/wso/wso-4.2.4.php:1484-1491 | php/wso/wso-4.2.5.php:1490-1497 | REDACTED:1336-1342 | REDACTED:1376-1383 | REDACTED:1857-1864 | REDACTED:1376-1383 | php/zxc/.v.php:1490-1497 | REDACTED:1369-1376 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1374` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:1401` calls `isset` and `REDACTED:1374` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (7–8 lines × 13) · ×1
  • Duplicated block (7–8 lines × 13) REDACTED:260 — REDACTED:260-266 | php/wso/wso-4.1.3.php:200-206 | php/wso/wso-4.2.0.php:215-222 | php/wso/wso-4.2.1.php:215-222 | php/wso/wso-4.2.2.php:214-221 | php/wso/wso-4.2.3.php:218-225 | php/wso/wso-4.2.4.php:223-230 | php/wso/wso-4.2.5.php:226-233 | REDACTED:262-268 | REDACTED:269-275 | REDACTED:262-268 | php/zxc/.v.php:230-237 | REDACTED:252-258 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:260` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `php/wso/wso-4.1.3.php:198` calls `foreach` and `REDACTED:259` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10 lines × 11) · ×1
  • Duplicated block (10 lines × 11) REDACTED:671 — REDACTED:671-680 | php/wso/wso-4.1.3.php:919-928 | php/wso/wso-4.2.1.php:911-920 | php/wso/wso-4.2.2.php:910-919 | php/wso/wso-4.2.3.php:914-923 | php/wso/wso-4.2.4.php:919-928 | php/wso/wso-4.2.5.php:925-934 | REDACTED:673-682 | REDACTED:673-682 | php/zxc/.v.php:927-936 | REDACTED:660-669 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (11 lines × 9) · ×1
  • Duplicated block (11 lines × 9) REDACTED:1339 — REDACTED:1339-1349 | REDACTED:1314-1324 | REDACTED:1251-1261 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1426-1436 | php/PHPshell/【r57_iFX】/r57_iFX.php:1028-1038 | php/PHPshell/【r57_karta】/r57_kartal.php:999-1009 | php/PHPshell/【r57】/r57.php:1256-1266 | REDACTED:1330-1340 | REDACTED:1162-1172 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (8 lines × 9) · ×1
  • Duplicated block (8 lines × 9) php/wso/wso-4.1.3.php:986 — php/wso/wso-4.1.3.php:986-993 | php/wso/wso-4.2.0.php:663-696 | php/wso/wso-4.2.0.php:982-989 | php/wso/wso-4.2.1.php:978-985 | php/wso/wso-4.2.2.php:977-984 | php/wso/wso-4.2.3.php:981-988 | php/wso/wso-4.2.4.php:987-994 | php/wso/wso-4.2.5.php:993-1000 | php/zxc/.v.php:995-1002 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:986` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (8 lines × 8) · ×1
  • Duplicated block (8 lines × 8) php/wso/wso-4.1.3.php:763 — php/wso/wso-4.1.3.php:763-770 | php/wso/wso-4.2.0.php:759-766 | php/wso/wso-4.2.1.php:755-762 | php/wso/wso-4.2.2.php:754-761 | php/wso/wso-4.2.3.php:758-765 | php/wso/wso-4.2.4.php:763-770 | php/wso/wso-4.2.5.php:769-776 | php/zxc/.v.php:771-778 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8 lines × 7) · ×1
  • Duplicated block (8 lines × 7) REDACTED:323 — REDACTED:323-330 | REDACTED:292-299 | REDACTED:287-294 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:399-406 | php/PHPshell/【r57】/r57.php:292-299 | REDACTED:316-323 | REDACTED:277-284 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (4–8 lines × 8) · ×1
  • Duplicated block (4–8 lines × 8) php/wso/wso-4.1.3.php:635 — php/wso/wso-4.1.3.php:635-642 | php/wso/wso-4.2.0.php:644-647 | php/wso/wso-4.2.1.php:645-652 | php/wso/wso-4.2.2.php:644-651 | php/wso/wso-4.2.3.php:648-655 | php/wso/wso-4.2.4.php:653-660 | php/wso/wso-4.2.5.php:659-666 | php/zxc/.v.php:663-670 — before extracting anything, compare `php/wso/wso-4.1.3.php` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 91 separate duplicated blocks between them, totalling at least 1642 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.1.3.php:635` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `php/wso/wso-4.1.3.php:635` calls `prototype`, `md5` and `php/wso/wso-4.2.0.php:644` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8 lines × 6) · ×1
  • Duplicated block (8 lines × 6) REDACTED:250 — REDACTED:250-257 | REDACTED:280-287 | REDACTED:284-291 | REDACTED:322-329 | REDACTED:357-364 | php/b374k/source/b374k-2.8.source.php:418-425 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:250` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7–8 lines × 3) · ×1
  • Duplicated block (7–8 lines × 3) REDACTED:429 — REDACTED:429-436 | REDACTED:468-474 | php/b374k/source/b374k-2.8.source.php:529-535 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:429` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:436` calls `is_array`, `array` and `REDACTED:474` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (1–8 lines × 6) · ×1
  • Duplicated block (1–8 lines × 6) REDACTED:647 — REDACTED:647-647 | REDACTED:648-655 | REDACTED:647-647 | REDACTED:648-655 | REDACTED:628-628 | REDACTED:629-636 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 371 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:629` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:629` calls `querY` and `REDACTED:628` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (21 lines × 3) · ×1
  • Duplicated block (21 lines × 3) REDACTED:2295 — REDACTED:2295-2315 | www-7jyewu-cn/免杀php大马.php:2295-2315 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:2295-2315 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (7 lines × 29) · ×1
  • Duplicated block (7 lines × 29) REDACTED:1292 — REDACTED:1292-1298 | REDACTED:1331-1337 | REDACTED:1366-1372 | php/wso/wso-4.1.3.php:1401-1407 | php/wso/wso-4.1.3.php:1440-1446 | php/wso/wso-4.2.0.php:1398-1404 | php/wso/wso-4.2.0.php:1437-1443 | php/wso/wso-4.2.1.php:1394-1400 | php/wso/wso-4.2.1.php:1433-1439 | php/wso/wso-4.2.2.php:1393-1399 | php/wso/wso-4.2.2.php:1432-1438 | php/wso/wso-4.2.3.php:1397-1403 | php/wso/wso-4.2.3.php:1436-1442 | php/wso/wso-4.2.4.php:1402-1408 | php/wso/wso-4.2.4.php:1441-1447 | php/wso/wso-4.2.5.php:1408-1414 | php/wso/wso-4.2.5.php:1447-1453 | REDACTED:1300-1306 | REDACTED:1294-1300 | REDACTED:1333-1339 | REDACTED:1773-1779 | REDACTED:1813-1819 | REDACTED:1294-1300 | REDACTED:1333-1339 | php/zxc/.v.php:1408-1414 | php/zxc/.v.php:1447-1453 | REDACTED:1304-1310 | REDACTED:1287-1293 | REDACTED:1326-1332 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1292` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1298` calls `setCharset` and `php/wso/wso-4.1.3.php:1407` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (7 lines × 16) · ×1
  • Duplicated block (7 lines × 16) REDACTED:1042 — REDACTED:1042-1048 | REDACTED:1114-1120 | php/wso/wso-4.1.3.php:1151-1157 | php/wso/wso-4.2.0.php:1148-1154 | php/wso/wso-4.2.1.php:1144-1150 | php/wso/wso-4.2.2.php:1143-1149 | php/wso/wso-4.2.3.php:1147-1153 | php/wso/wso-4.2.4.php:1152-1158 | php/wso/wso-4.2.5.php:1158-1164 | REDACTED:1050-1056 | REDACTED:1044-1050 | REDACTED:1530-1536 | REDACTED:1044-1050 | php/zxc/.v.php:1158-1164 | REDACTED:1031-1037 | REDACTED:952-958 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1042` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7 lines × 15) · ×1
  • Duplicated block (7 lines × 15) REDACTED:856 — REDACTED:856-862 | REDACTED:451-457 | php/wso/wso-4.1.3.php:482-488 | php/wso/wso-4.2.0.php:482-488 | php/wso/wso-4.2.1.php:482-488 | php/wso/wso-4.2.2.php:481-487 | php/wso/wso-4.2.3.php:485-491 | php/wso/wso-4.2.4.php:490-496 | php/wso/wso-4.2.5.php:496-502 | REDACTED:751-757 | REDACTED:858-864 | REDACTED:1299-1305 | REDACTED:858-864 | php/zxc/.v.php:500-506 | REDACTED:845-851 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:856` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (7 lines × 14) · ×1
  • Duplicated block (7 lines × 14) REDACTED:734 — REDACTED:734-740 | REDACTED:898-904 | php/wso/wso-4.1.3.php:982-988 | php/wso/wso-4.2.0.php:978-984 | php/wso/wso-4.2.1.php:974-980 | php/wso/wso-4.2.2.php:973-979 | php/wso/wso-4.2.3.php:977-983 | php/wso/wso-4.2.4.php:983-989 | php/wso/wso-4.2.5.php:989-995 | REDACTED:736-742 | REDACTED:1174-1180 | REDACTED:736-742 | php/zxc/.v.php:991-997 | REDACTED:723-729 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:734` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:741` calls `empty`, `WSOsetcookie`, `md5` and `REDACTED:1181` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (7 lines × 12) · ×1
  • Duplicated block (7 lines × 12) REDACTED:685 — REDACTED:685-691 | php/wso/wso-4.1.3.php:713-719 | php/wso/wso-4.2.0.php:723-729 | php/wso/wso-4.2.1.php:723-729 | php/wso/wso-4.2.2.php:722-728 | php/wso/wso-4.2.3.php:726-732 | php/wso/wso-4.2.4.php:731-737 | php/wso/wso-4.2.5.php:737-743 | REDACTED:443-449 | REDACTED:931-937 | php/zxc/.v.php:740-746 | REDACTED:478-484 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:685` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (7 lines × 9) · ×1
  • Duplicated block (7 lines × 9) REDACTED:26 — REDACTED:26-32 | php/wso/wso-4.1.3.php:265-271 | php/wso/wso-4.2.0.php:45-51 | php/wso/wso-4.2.1.php:45-51 | php/wso/wso-4.2.2.php:44-50 | php/wso/wso-4.2.3.php:44-50 | php/wso/wso-4.2.4.php:49-55 | php/wso/wso-4.2.5.php:49-55 | php/zxc/.v.php:50-56 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 7) · ×1
  • Duplicated block (7 lines × 7) php/wso/wso-4.2.0.php:458 — php/wso/wso-4.2.0.php:458-464 | php/wso/wso-4.2.1.php:458-464 | php/wso/wso-4.2.2.php:457-463 | php/wso/wso-4.2.3.php:461-467 | php/wso/wso-4.2.4.php:466-472 | php/wso/wso-4.2.5.php:472-478 | php/zxc/.v.php:476-482 — before extracting anything, compare `php/wso/wso-4.2.0.php` and `php/wso/wso-4.2.1.php` as WHOLE FILES: this scan already matched 93 separate duplicated blocks between them, totalling at least 1670 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 5) · ×1
  • Duplicated block (7 lines × 5) REDACTED:503 — REDACTED:503-509 | REDACTED:505-511 | REDACTED:944-950 | REDACTED:505-511 | REDACTED:492-498 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 90 separate duplicated blocks between them, totalling at least 1631 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:503` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (6 lines × 17) · ×1
  • Duplicated block (6 lines × 17) REDACTED:567 — REDACTED:567-572 | REDACTED:766-771 | php/wso/wso-4.1.3.php:815-820 | php/wso/wso-4.2.0.php:811-816 | php/wso/wso-4.2.1.php:807-812 | php/wso/wso-4.2.2.php:806-811 | php/wso/wso-4.2.3.php:810-815 | php/wso/wso-4.2.4.php:815-820 | php/wso/wso-4.2.5.php:821-826 | REDACTED:522-527 | REDACTED:569-574 | REDACTED:1006-1011 | REDACTED:569-574 | php/zxc/.v.php:823-828 | REDACTED:559-564 | REDACTED:556-561 | REDACTED:507-512 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:567` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7 lines × 13) · ×1
  • Duplicated block (7 lines × 13) REDACTED:823 — REDACTED:823-829 | php/wso/wso-4.1.3.php:449-455 | php/wso/wso-4.2.0.php:449-455 | php/wso/wso-4.2.1.php:449-455 | php/wso/wso-4.2.2.php:448-454 | php/wso/wso-4.2.3.php:452-458 | php/wso/wso-4.2.4.php:457-463 | php/wso/wso-4.2.5.php:463-469 | REDACTED:825-831 | REDACTED:1266-1272 | REDACTED:825-831 | php/zxc/.v.php:467-473 | REDACTED:812-818 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:823` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 12) · ×1
  • Duplicated block (6 lines × 12) REDACTED:1123 — REDACTED:1123-1128 | php/wso/wso-4.1.3.php:1160-1165 | php/wso/wso-4.2.0.php:1157-1162 | php/wso/wso-4.2.1.php:1153-1158 | php/wso/wso-4.2.2.php:1152-1157 | php/wso/wso-4.2.3.php:1156-1161 | php/wso/wso-4.2.4.php:1161-1166 | php/wso/wso-4.2.5.php:1167-1172 | REDACTED:1059-1064 | REDACTED:1539-1544 | php/zxc/.v.php:1167-1172 | REDACTED:961-966 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1123` 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.
D4 · Code Duplication · Duplicated block (6 lines × 11) · ×1
  • Duplicated block (6 lines × 11) REDACTED:283 — REDACTED:283-288 | php/wso/wso-4.1.3.php:305-310 | php/wso/wso-4.2.0.php:305-310 | php/wso/wso-4.2.1.php:305-310 | php/wso/wso-4.2.2.php:304-309 | php/wso/wso-4.2.3.php:308-313 | php/wso/wso-4.2.4.php:313-318 | php/wso/wso-4.2.5.php:319-324 | REDACTED:344-349 | php/zxc/.v.php:323-328 | REDACTED:374-379 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 55 separate duplicated blocks between them, totalling at least 782 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (8 lines × 10) · ×1
  • Duplicated block (8 lines × 10) REDACTED:609 — REDACTED:609-616 | REDACTED:1237-1244 | REDACTED:1213-1220 | REDACTED:1057-1064 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1325-1332 | php/PHPshell/【r57_iFX】/r57_iFX.php:834-841 | php/PHPshell/【r57_karta】/r57_kartal.php:805-812 | php/PHPshell/【r57】/r57.php:1062-1069 | REDACTED:1228-1235 | REDACTED:1060-1067 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1237` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 8) · ×1
  • Duplicated block (6 lines × 8) REDACTED:94 — REDACTED:94-99 | REDACTED:109-114 | REDACTED:133-138 | REDACTED:153-158 | REDACTED:157-162 | REDACTED:174-179 | REDACTED:90-95 | REDACTED:105-110 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:94` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:99` calls `fwrite` and `REDACTED:138` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (2–6 lines × 7) · ×1
  • Duplicated block (2–6 lines × 7) php/wso/wso-4.2.1.php:906 — php/wso/wso-4.2.1.php:906-911 | php/wso/wso-4.2.2.php:905-910 | php/wso/wso-4.2.3.php:909-914 | php/wso/wso-4.2.4.php:914-919 | php/wso/wso-4.2.5.php:920-925 | php/zxc/.v.php:922-927 | REDACTED:654-655 — before extracting anything, compare `php/wso/wso-4.2.1.php` and `php/wso/wso-4.2.2.php` as WHOLE FILES: this scan already matched 105 separate duplicated blocks between them, totalling at least 2027 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `php/wso/wso-4.2.1.php:906` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `php/wso/wso-4.2.1.php:906` calls `array_merge`, `array`, `readlink` and `REDACTED:654` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (4–6 lines × 24) · ×1
  • Duplicated block (4–6 lines × 24) REDACTED:224 — REDACTED:224-229 | REDACTED:228-233 | REDACTED:266-271 | REDACTED:302-307 | php/b374k/source/b374k-2.8.source.php:363-368 | REDACTED:343-346 | REDACTED:661-664 | REDACTED:263-266 | php/wso/wso-4.1.3.php:285-288 | php/wso/wso-4.2.0.php:285-288 | php/wso/wso-4.2.1.php:285-288 | php/wso/wso-4.2.2.php:284-287 | php/wso/wso-4.2.3.php:288-291 | php/wso/wso-4.2.4.php:293-296 | php/wso/wso-4.2.5.php:299-302 | REDACTED:324-327 | REDACTED:345-348 | REDACTED:347-350 | REDACTED:345-348 | php/zxc/.v.php:303-306 | REDACTED:34-37 | REDACTED:354-357 | REDACTED:332-335 | REDACTED:332-335 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 24 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 24 times. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:224` 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, `REDACTED:33` calls `fileperms` and `REDACTED:262` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (3–6 lines × 12) · ×1
  • Duplicated block (3–6 lines × 12) REDACTED:621 — REDACTED:621-623 | REDACTED:518-523 | REDACTED:1249-1251 | REDACTED:1225-1227 | REDACTED:1069-1071 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:1337-1339 | php/PHPshell/【r57_iFX】/r57_iFX.php:846-848 | php/PHPshell/【r57_karta】/r57_kartal.php:817-819 | php/PHPshell/【r57】/r57.php:1074-1076 | REDACTED:1240-1242 | REDACTED:1072-1074 | REDACTED:518-523 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1249` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (5 lines × 18) · ×1
  • Duplicated block (5 lines × 18) REDACTED:358 — REDACTED:358-362 | REDACTED:530-535 | REDACTED:729-734 | php/wso/wso-4.1.3.php:778-783 | php/wso/wso-4.2.0.php:774-779 | php/wso/wso-4.2.1.php:770-775 | php/wso/wso-4.2.2.php:769-774 | php/wso/wso-4.2.3.php:773-778 | php/wso/wso-4.2.4.php:778-783 | php/wso/wso-4.2.5.php:784-789 | REDACTED:485-490 | REDACTED:532-537 | REDACTED:969-974 | REDACTED:532-537 | php/zxc/.v.php:786-791 | REDACTED:522-527 | REDACTED:519-524 | REDACTED:470-475 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:358` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (8–10 lines × 16) · ×1
  • Duplicated block (8–10 lines × 16) REDACTED:858 — REDACTED:858-867 | REDACTED:453-460 | php/wso/wso-4.1.3.php:484-493 | php/wso/wso-4.2.0.php:484-493 | php/wso/wso-4.2.1.php:484-493 | php/wso/wso-4.2.2.php:483-492 | php/wso/wso-4.2.3.php:487-496 | php/wso/wso-4.2.4.php:492-501 | php/wso/wso-4.2.5.php:498-507 | REDACTED:753-760 | REDACTED:860-869 | REDACTED:1301-1310 | REDACTED:860-869 | php/zxc/.v.php:502-511 | REDACTED:847-856 | REDACTED:730-737 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:453` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (5 lines × 11) · ×1
  • Duplicated block (5 lines × 11) REDACTED:262 — REDACTED:262-266 | REDACTED:206-210 | REDACTED:238-242 | REDACTED:242-246 | REDACTED:280-284 | REDACTED:316-320 | php/b374k/source/b374k-2.8.source.php:377-381 | REDACTED:489-493 | REDACTED:511-515 | REDACTED:429-433 | REDACTED:258-262 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (5 lines × 10) · ×1
  • Duplicated block (5 lines × 10) REDACTED:522 — REDACTED:522-526 | REDACTED:532-536 | REDACTED:491-495 | REDACTED:501-505 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:598-602 | php/PHPshell/【r57_Mohajer22】/r57_Mohajer22.php:608-612 | REDACTED:515-519 | REDACTED:525-529 | REDACTED:476-480 | REDACTED:486-490 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 25 separate duplicated blocks between them, totalling at least 436 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:522` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (5 lines × 9) · ×1
  • Duplicated block (5 lines × 9) REDACTED:126 — REDACTED:126-130 | REDACTED:194-198 | REDACTED:148-152 | REDACTED:168-172 | REDACTED:172-176 | REDACTED:189-193 | REDACTED:221-225 | REDACTED:122-126 | REDACTED:190-194 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:126` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:130` calls `is_file`, `unlink`, `fopen` and `REDACTED:152` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (7 lines × 4) · ×1
  • Duplicated block (7 lines × 4) REDACTED:344 — REDACTED:344-350 | REDACTED:386-392 | REDACTED:390-396 | REDACTED:436-442 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 220 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:344` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:436` calls `is_array`, `array` and `REDACTED:344` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (1–5 lines × 5) · ×1
  • Duplicated block (1–5 lines × 5) REDACTED:666 — REDACTED:666-670 | php/wso/wso-4.2.0.php:706-710 | REDACTED:948-952 | REDACTED:1498-1498 | REDACTED:1015-1019 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.2.0.php` as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 835 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1498` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:1495` calls `empty`, `md5` and `REDACTED:663` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (29 lines × 2) · ×1
  • Duplicated block (29 lines × 2) REDACTED:121 — REDACTED:121-149 | REDACTED:121-149 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: 99% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (11 lines × 13) · ×1
  • Duplicated block (11 lines × 13) REDACTED:1501 — REDACTED:1501-1511 | php/wso/wso-4.1.3.php:329-339 | php/wso/wso-4.2.0.php:329-339 | php/wso/wso-4.2.1.php:329-339 | php/wso/wso-4.2.2.php:328-338 | php/wso/wso-4.2.3.php:332-342 | php/wso/wso-4.2.4.php:337-347 | php/wso/wso-4.2.5.php:343-353 | REDACTED:1503-1513 | REDACTED:1982-1992 | REDACTED:1503-1513 | php/zxc/.v.php:347-357 | REDACTED:1496-1506 — before extracting anything, compare `REDACTED` and `php/wso/wso-4.1.3.php` as WHOLE FILES: this scan already matched 69 separate duplicated blocks between them, totalling at least 1152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (12 lines × 4) · ×1
  • Duplicated block (12 lines × 4) REDACTED:527 — REDACTED:527-541 | REDACTED:559-570 | REDACTED:508-522 | REDACTED:540-551 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 399 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (9 lines × 6) · ×1
  • Duplicated block (9 lines × 6) REDACTED:1215 — REDACTED:1215-1223 | REDACTED:1338-1346 | www-7jyewu-cn/免杀php大马.php:1215-1223 | www-7jyewu-cn/免杀php大马.php:1338-1346 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1215-1223 | www-7jyewu-cn/最新过安全狗- 免杀PHP大马 -.php:1338-1346 — before extracting anything, compare `REDACTED` and `www-7jyewu-cn/免杀php大马.php` as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 410 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (6 lines × 19) · ×1
  • Duplicated block (6 lines × 19) REDACTED:347 — REDACTED:347-352 | REDACTED:665-670 | REDACTED:267-272 | php/wso/wso-4.1.3.php:289-294 | php/wso/wso-4.2.0.php:289-294 | php/wso/wso-4.2.1.php:289-294 | php/wso/wso-4.2.2.php:288-293 | php/wso/wso-4.2.3.php:292-297 | php/wso/wso-4.2.4.php:297-302 | php/wso/wso-4.2.5.php:303-308 | REDACTED:328-333 | REDACTED:349-354 | REDACTED:351-356 | REDACTED:349-354 | php/zxc/.v.php:307-312 | REDACTED:38-43 | REDACTED:358-363 | REDACTED:336-341 | REDACTED:336-341 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 513 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (64 lines × 4) · ×1
  • Duplicated block (64 lines × 4) REDACTED:17 — REDACTED:17-80 | REDACTED:17-80 | REDACTED:17-80 | REDACTED:17-80 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 64 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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.
D4 · Code Duplication · Duplicated block (37 lines × 4) · ×1
  • Duplicated block (37 lines × 4) fuzzdb-webshell/jsp/UpServlet.java:28 — fuzzdb-webshell/jsp/UpServlet.java:28-64 | fuzzdb-webshell/servlet/UpServlet.java:28-64 | jsp/hackk8/jsp2/UpServlet.java:28-64 | jsp/hackk8/jsp_77/UpServlet.java:28-64 — `fuzzdb-webshell/jsp/UpServlet.java` and `fuzzdb-webshell/servlet/UpServlet.java` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 2 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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.
D4 · Code Duplication · Duplicated block (22 lines × 4) · ×1
  • Duplicated block (22 lines × 4) REDACTED:16 — REDACTED:16-37 | REDACTED:16-37 | REDACTED:16-37 | REDACTED:16-37 — `REDACTED` and `REDACTED` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 22 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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.
D4 · Code Duplication · Duplicated block (26–28 lines × 2) · ×1
  • Duplicated block (26–28 lines × 2) py/Phyton Shell.py:40 — py/Phyton Shell.py:40-65 | py/d00r_py3.py:43-70 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
P1 · CI/CD gates · No CI pipeline · ×1
  • No CI pipeline — No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
S1 · Cryptographic Hygiene · Third-party script without Subresource Integrity · ×1
  • Third-party script without Subresource Integrity jsp/520.jsp:1175 — `http://xslt.alexa.com/site_stats/js/t/c?url=` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 9 such include(s) across the repository's markup.
Minor — 292 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×226
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file php/PHPshell/【EgY_SpIdEr ShElL V2】/EgY_SpIdEr ShElL V2.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file php/twitter/bh.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file php/b374k/source/b374k-2.8.source.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file php/session91.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file php/PHPshell/【Shell [ci] .Biz was here】/Shell [ci] .Biz was here.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file www-7jyewu-cn/国外免杀PHP大马_未翻译.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file www-7jyewu-cn/国外免杀php大马.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file php/r00ts php大马.php:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 201 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×40
  • Duplicated predicate fuzzdb-webshell/jsp/UpServlet.java:38 — `(c=post.read()) != -1 && c != '\r' && c != '\n'` appears character-identically in 4 files — fuzzdb-webshell/jsp/UpServlet.java, fuzzdb-webshell/servlet/UpServlet.java, jsp/hackk8/jsp2/UpServlet.java, jsp/hackk8/jsp_77/UpServlet.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:424 — `!@file_exists($curfile) || !@file_exists($tarfile)` appears character-identically in 6 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1878 — `!@realpath($d.$f) || !file_exists($d.$f)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:2261 — `!is_array($from) || !count($from) || count($from)==1 && $from[0]==0` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1726 — `!isset($d) || !isset($f) || !@file_exists($d.$f) || !@realpath($d.$f)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1856 — `!isset($from) || !@file_exists($from) || !@realpath($from)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:2252 — `!isset($from) || !preg_match("!^([0-9]+):(([0-9]+,)*[0-9]+)$!",$from,$ok)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1094 — `!isset($tmp2['name']) || $tmp2['name']==""` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1087 — `!isset($tmp['name']) || $tmp['name']==""` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:110 — `!preg_match($s,getenv("REMOTE_ADDR")) && !preg_match($s,gethostbyaddr(getenv("REMOTE_ADDR")))` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate php/PHPshell/MySQL Web Interface Version 0.8/MySQL Web Interface Version 0.8.php:1226 — `$action == "dumpTable" || $action == "dumpDB"` appears character-identically in 3 files — php/PHPshell/MySQL Web Interface Version 0.8/MySQL Web Interface Version 0.8.php, php/PHPshell/Mysql interface v1.0/Mysql interface v1.0.php, web-malware-collection-13-06-2012/PHP/MySQL Web Interface Version 0.8.php. 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 php/PHPshell/MySQL Web Interface Version 0.8/MySQL Web Interface Version 0.8.php:1222 — `$action == "logon" || $action == "" || $action == "logout"` appears character-identically in 3 files — php/PHPshell/MySQL Web Interface Version 0.8/MySQL Web Interface Version 0.8.php, php/PHPshell/Mysql interface v1.0/Mysql interface v1.0.php, web-malware-collection-13-06-2012/PHP/MySQL Web Interface Version 0.8.php. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1738 — `$charset && in_array(strtolower($charset), $charsetdb)` appears character-identically in 4 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate php/PHPshell/MySQL Web Interface Version 0.8/MySQL Web Interface Version 0.8.php:1067 — `$command == "" || substr( $command, 0, 5 ) == "flush"` appears character-identically in 3 files — php/PHPshell/MySQL Web Interface Version 0.8/MySQL Web Interface Version 0.8.php, php/PHPshell/Mysql interface v1.0/Mysql interface v1.0.php, web-malware-collection-13-06-2012/PHP/MySQL Web Interface Version 0.8.php. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:433 — `$curfile && $year && $month && $day && $hour && $minute && $second` appears character-identically in 6 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1640 — `$curpage - $offset > 1 && $pages > $page` appears character-identically in 5 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:644 — `$dirdb['filename']!='..' && $dirdb['filename']!='.'` appears character-identically in 6 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1433 — `$execfunc=='proc_open' && IS_WIN && IS_COM` appears character-identically in 6 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1427 — `$execfunc=='wscript' && IS_WIN && IS_COM` appears character-identically in 6 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1917 — `$file!='.' && $file!='..' && is_file($f) && in_array($ext, explode(',', $writabledb))` appears character-identically in 4 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1214 — `$file['is_file'] && $file['is_readable']` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:676 — `$filedb['filename']!='..' && $filedb['filename']!='.'` appears character-identically in 6 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:645 — `$getdir && $getdir == $dirdb['server_link']` appears character-identically in 5 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:878 — `$key != 'argc' && $key != 'argv' && (strtoupper($key) != $key || ''.intval($key) == "$key")` appears character-identically in 4 files — REDACTED, REDACTED, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:1106 — `$keyfied && strtolower(substr($query,0,13)) == 'select * from'` appears character-identically in 4 files — REDACTED, php/angel大马.php, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • + 15 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×12
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Most significant orphaned file · ×3
  • Most significant orphaned file php/ucen.php:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file php/twitter/adminer-4.2.4.php:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file b4tm4n-toolz/database/adminer-4.5.0.php:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D34 · Knowledge Freshness · Dormant codebase · ×1
  • Dormant codebase — 229 of 229 significant files have no living knowledge — the codebase as a whole is dormant, not 229 separate risks. Counted over 229 of the 404 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
D37 · Vulnerability-disclosure Policy · REDACTED · ×1
  • REDACTED
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.
M3 · Folder & project structure · No src/ separation · ×1
  • No src/ separation — Most of the production code is in directories of its own, but 2 application file(s) sit at the repository root beside the build and tooling files (`php_niu_3.php`, `REDACTED`).
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 1/5 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `.`, `.`, `.`.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add phpstan or psalm (or `semgrep --config=auto`, which runs on any language) — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
X5 · Nullable reference types · Nullable reference types not enabled everywhere · ×1
  • Nullable reference types not enabled everywhere — 0/1 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-7f7a4508af0546ee90ffd437bd1160dc/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-7f7a4508af0546ee90ffd437bd1160dc/tree.json --exit-code 0 --source .0—
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .4240artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnone (no readable dependency manifest)—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—
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep --config /opt/semgrep-rules/gdpr.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .1artifacts/raw/semgrep-gdpr.json
D36 · Supply-chain Provenance & Signingprovenance—provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesnone (no readable dependency manifest)—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 01a1d6d8-dc3c-7862-9a7c-9c4f0b036916 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

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

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