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

skylot/jadx

Measured 23 October 2026, 01:30 UTC, at code version c4c45fd

No regression since the last survey

A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.

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

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

Architecture 83 Strong Security and Compliance 79 Adequate Performance 64 Adequate Code Health 63 Adequate Production Readiness 60 Adequate Maturity 53 Adequate

A large codebase: 134,371 lines of product code in 22 projects, tests not counted · Estimated rebuild effort: about 1.2 person-years · Weakest lens: Maturity, 53

Findings by how serious they are

45 critical 685 serious 119 minor

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

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
23 October 2026, 01:30 UTC

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

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

59of 62 dimensions measured by tools. The other 3 are advisory notes from an AI model, which explain the code but don't count towards the score.
830of 849 findings point to an exact file and line, so you can open each one in the code. The other 19 concern the repository as a whole, such as missing documentation.
62dimensions across 6 lenses, read from 134,371 lines of product code in 22 projects.
Chapters

Executive summary

skylot/jadx scores 59 out of 100 and is rated Adequate, while five of its six lenses score higher still: Architecture at 83, rated Strong, and Security and Compliance at 79, Performance at 64, Code Health at 63 and Production Readiness at 60, all rated Adequate.

The score is lower than those five because the weakest lens counts most, and here that is Maturity, which scores 53 and is rated Adequate. Its Architecture documentation dimension scores 0 out of 10, and until that reaches 4, Maturity can't be rated higher than Adequate. The first actions are to resolve the 1 No ADRs found finding(s) in ADR Quality and to resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness, and if Maturity rose to 70, the score would rise from 59 to about 64.

45 findings are critical: 41 in Static Analysis (SAST), three in Knowledge Freshness and one in Dependency direction.

Watchdog couldn't measure 12 dimensions in this code, among them Code Coverage, Test Reliability and Dependency Hygiene, so they are left out of the score. The product code is 134,371 lines, which would take an estimated 1.2 person-years, around €170,000, to rebuild.

Code Health 63 Adequate, capped by Nullable reference types Architecture 83 Strong Maturity 53 Adequate, capped by Architecture documentation Production Readiness 60 Adequate, capped by Security & performance tooling Security and Compliance 79 Adequate, capped by Supply-chain Provenance & Signing Performance 64 Adequate

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.
Maturity 53 · counts for 46%Production Readiness 60 · counts for 25%Code Health 63 · counts for 14%Performance 64 · counts for 8%Security and Compliance 79 · counts for 4%Architecture 83 · counts for 2%

If Maturity rose from 53 to 70, the lowest score rated Strong, the score would rise from 59 to about 64.

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

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

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

Fixed since the last survey: 114 findings

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

  • Cyclomatic Complexity · TabComponent.createTabPopupMenu (cyclomatic 18) jadx-gui/src/main/java/jadx/gui/ui/tab/TabComponent.java
  • Cognitive Complexity · TabComponent.createTabPopupMenu (cognitive 29) jadx-gui/src/main/java/jadx/gui/ui/tab/TabComponent.java
  • Cognitive Complexity · 2.dispatchKeyEvent (cognitive 22) jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java
  • Cognitive Complexity · SimplifyVisitor.convertStringBuilderChain (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.java
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) jadx-gui/src/main/java/jadx/gui/logs/LogPanel.java
  • Code Duplication · Duplicated block (7 lines × 3) jadx-gui/src/main/java/jadx/gui/logs/LogPanel.java
  • Code Duplication · Duplicated block (5 lines × 6) jadx-gui/src/main/java/jadx/gui/logs/LogPanel.java
  • Test Quality · No assertions: testPluginOptionsOverride jadx-cli/src/test/java/jadx/cli/JadxCLIArgsTest.java
  • Test Quality · No assertions: testClassInput jadx-cli/src/test/java/jadx/cli/TestInput.java
  • Test Quality · No assertions: testDexInput jadx-cli/src/test/java/jadx/cli/TestInput.java
  • Test Quality · No assertions: testMultipleInput jadx-cli/src/test/java/jadx/cli/TestInput.java
  • Test Quality · No assertions: testSmaliInput jadx-cli/src/test/java/jadx/cli/TestInput.java
  • Test Quality · No assertions: loadHelloWorld jadx-plugins/jadx-dex-input/src/test/java/jadx/plugins/input/dex/DexInputPluginTest.java
  • Test Quality · No assertions: loadSampleApk jadx-plugins/jadx-dex-input/src/test/java/jadx/plugins/input/dex/DexInputPluginTest.java
  • Test Quality · No assertions: loadTestSmali jadx-plugins/jadx-dex-input/src/test/java/jadx/plugins/input/dex/DexInputPluginTest.java
  • Test Quality · No assertions: testObjects jadx-plugins/jadx-java-input/src/test/java/jadx/plugins/input/java/utils/DescriptorParserTest.java
  • Test Quality · No assertions: testPrimitives jadx-plugins/jadx-java-input/src/test/java/jadx/plugins/input/java/utils/DescriptorParserTest.java
  • Test Quality · No assertions: sanitizeString jadx-core/src/test/java/jadx/api/security/impl/JadxSecurityTest.java
  • Test Quality · No assertions: checkAllSet jadx-core/src/test/java/jadx/api/JadxArgsValidatorOutDirsTest.java
  • Test Quality · No assertions: checkNone jadx-core/src/test/java/jadx/api/JadxArgsValidatorOutDirsTest.java
  • Test Quality · No assertions: checkResOnly jadx-core/src/test/java/jadx/api/JadxArgsValidatorOutDirsTest.java
  • Test Quality · No assertions: checkRootOnly jadx-core/src/test/java/jadx/api/JadxArgsValidatorOutDirsTest.java
  • Test Quality · No assertions: checkSrcOnly jadx-core/src/test/java/jadx/api/JadxArgsValidatorOutDirsTest.java
  • Test Quality · No assertions: testSelectBySource jadx-core/src/test/java/jadx/core/dex/nodes/utils/SelectFromDuplicatesTest.java
  • Test Quality · No assertions: testSelectBySourceShuffled jadx-core/src/test/java/jadx/core/dex/nodes/utils/SelectFromDuplicatesTest.java
  • Test Quality · No assertions: replaceTypeVariablesUsingMap jadx-core/src/test/java/jadx/core/dex/nodes/utils/TypeUtilsTest.java
  • Test Quality · No assertions: replaceTypeVariablesUsingMap2 jadx-core/src/test/java/jadx/core/dex/nodes/utils/TypeUtilsTest.java
  • Test Quality · No assertions: compareArrays jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: compareGenericTypes jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: compareGenericTypes2 jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: compareGenericWildCards jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: compareGenerics jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: compareOuterGenerics jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: compareTypes jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: compareWildCards jadx-core/src/test/java/jadx/core/dex/visitors/typeinference/TypeCompareTest.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/core/plugins/versions/VerifyRequiredVersionTest.java
  • Test Quality · No assertions: testCompare jadx-core/src/test/java/jadx/core/plugins/versions/VersionComparatorTest.java
  • Test Quality · No assertions: testCompareUnstable jadx-core/src/test/java/jadx/core/plugins/versions/VersionComparatorTest.java
  • Test Quality · No assertions: testMulti jadx-core/src/test/java/jadx/core/utils/PassMergeTest.java
  • Test Quality · No assertions: testMultiWithDeps jadx-core/src/test/java/jadx/core/utils/PassMergeTest.java
  • Test Quality · No assertions: testMultiWithDeps2 jadx-core/src/test/java/jadx/core/utils/PassMergeTest.java
  • Test Quality · No assertions: testMultiWithDeps3 jadx-core/src/test/java/jadx/core/utils/PassMergeTest.java
  • Test Quality · No assertions: testSimple jadx-core/src/test/java/jadx/core/utils/PassMergeTest.java
  • Test Quality · No assertions: testSingle jadx-core/src/test/java/jadx/core/utils/PassMergeTest.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/core/utils/TestBetterName.java
  • Test Quality · No assertions: testEquallyGoodNames jadx-core/src/test/java/jadx/core/utils/TestGetBetterClassName.java
  • Test Quality · No assertions: testGoodNamesVsGeneratedAliases jadx-core/src/test/java/jadx/core/utils/TestGetBetterClassName.java
  • Test Quality · No assertions: testGoodNamesVsGeneratedAliasesWithPrefix jadx-core/src/test/java/jadx/core/utils/TestGetBetterClassName.java
  • Test Quality · No assertions: testGoodNamesWithDigitsVsGeneratedAliases jadx-core/src/test/java/jadx/core/utils/TestGetBetterClassName.java
  • Test Quality · No assertions: testShortGoodNamesVsGeneratedAliases jadx-core/src/test/java/jadx/core/utils/TestGetBetterClassName.java
  • Test Quality · No assertions: testShortNamesVsLongNames jadx-core/src/test/java/jadx/core/utils/TestGetBetterClassName.java
  • Test Quality · No assertions: testEquallyGoodNames jadx-core/src/test/java/jadx/core/utils/TestGetBetterResourceName.java
  • Test Quality · No assertions: testGoodNamesVsSyntheticNames jadx-core/src/test/java/jadx/core/utils/TestGetBetterResourceName.java
  • Test Quality · No assertions: testOrder jadx-core/src/test/java/jadx/tests/functional/JadxVisitorsOrderTest.java
  • Test Quality · No assertions: testGenericMap jadx-core/src/test/java/jadx/tests/functional/SignatureParserTest.java
  • Test Quality · No assertions: testGenerics jadx-core/src/test/java/jadx/tests/functional/SignatureParserTest.java
  • Test Quality · No assertions: testSimpleTypes jadx-core/src/test/java/jadx/tests/functional/SignatureParserTest.java
  • Test Quality · No assertions: testWildcards jadx-core/src/test/java/jadx/tests/functional/SignatureParserTest.java
  • Test Quality · No assertions: testResStrValueEscape jadx-core/src/test/java/jadx/tests/functional/StringUtilsTest.java
  • Test Quality · No assertions: testStringUnescape jadx-core/src/test/java/jadx/tests/functional/StringUtilsTest.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/annotations/TestAnnotationsMix.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/conditions/TestConditions2.java
  • Test Quality · No assertions: test2 jadx-core/src/test/java/jadx/tests/integration/conditions/TestTernaryInIf2.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/debuginfo/TestReturnSourceLine.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/inline/TestTernaryCast.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/inner/TestAnonymousClass13.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/inner/TestInnerClassSyntheticConstructor.java
  • Test Quality · No assertions: testFallback jadx-core/src/test/java/jadx/tests/integration/java8/TestLambdaInstance.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/java8/TestLambdaInstance.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/java8/TestLambdaReturn.java
  • Test Quality · No assertions: testFallback jadx-core/src/test/java/jadx/tests/integration/java8/TestLambdaStatic.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/java8/TestLambdaStatic.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/loops/TestIterableForEach3.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/names/TestClassNameWithInvalidChar.java
  • Test Quality · No assertions: testWithDeobfuscation jadx-core/src/test/java/jadx/tests/integration/names/TestClassNameWithInvalidChar.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/names/TestDuplicatedNames.java
  • Test Quality · No assertions: testWithDeobf jadx-core/src/test/java/jadx/tests/integration/names/TestDuplicatedNames.java
  • Test Quality · No assertions: testWithDeobfuscation jadx-core/src/test/java/jadx/tests/integration/names/TestFieldCollideWithPackage.java
  • Test Quality · No assertions: testWithoutImports jadx-core/src/test/java/jadx/tests/integration/names/TestFieldCollideWithPackage.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/names/TestLocalVarCollideWithPackage.java
  • Test Quality · No assertions: testWithDeobfuscation jadx-core/src/test/java/jadx/tests/integration/names/TestLocalVarCollideWithPackage.java
  • Test Quality · No assertions: testWithoutImports jadx-core/src/test/java/jadx/tests/integration/names/TestLocalVarCollideWithPackage.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/others/TestFieldAccessReorder.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/others/TestMultipleNOPs.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/others/TestNullInline.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/others/TestOverridePackagePrivateMethod.java
  • Test Quality · No assertions: testDontChangeAccFlags jadx-core/src/test/java/jadx/tests/integration/others/TestOverridePackagePrivateMethod.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/others/TestWrongCode.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/others/TestWrongCode2.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/trycatch/TestMultiExceptionCatch2.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/trycatch/TestMultiExceptionCatch2.java
  • Test Quality · No assertions: test jadx-core/src/test/java/jadx/tests/integration/trycatch/TestTryCatch7.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/trycatch/TestTryCatch7.java
  • Test Quality · No assertions: test2 jadx-core/src/test/java/jadx/tests/integration/types/TestConstTypeInference.java
  • Test Quality · No assertions: testWithDeobf jadx-core/src/test/java/jadx/tests/integration/types/TestGenericsInFullInnerCls.java
  • Test Quality · No assertions: testWithFullNames jadx-core/src/test/java/jadx/tests/integration/types/TestGenericsInFullInnerCls.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/types/TestTypeInheritance.java
  • Test Quality · No assertions: test2 jadx-core/src/test/java/jadx/tests/integration/types/TestTypeResolver3.java
  • Test Quality · No assertions: test2 jadx-core/src/test/java/jadx/tests/integration/types/TestTypeResolver4.java
  • Test Quality · No assertions: testNoDebug jadx-core/src/test/java/jadx/tests/integration/types/TestTypeResolver6.java
Rebuild cost: about €170,000 · Estimate
Cost to rebuild€57,000 to €290,000, for 957 to 3,037 hours of work, about 1.2 person-years for 1 to 3 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 59. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 134,371 lines of product code

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

Top priorities

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

1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 5 points · Low effort · ADR Quality
2
Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with REDACTED, Smali.java, UsageDialogPlus.java.
Raises the score by about 3 points · Low effort · Knowledge Freshness
3
Record your significant design decisions.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Raises the score by about 5 points · Medium effort · Architecture documentation

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 €170,000 to build again, about 1.2 person-years of work. Its weakest lens is Maturity, at 53 (Adequate). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.

arch :jadx-cli :jadx-cli :jadx-commons:jadx-analysis :jadx-commons:jadx-analysis :jadx-cli->:jadx-commons:jadx-analysis :jadx-commons:jadx-app-commons :jadx-commons:jadx-app-commons :jadx-cli->:jadx-commons:jadx-app-commons :jadx-core :jadx-core :jadx-cli->:jadx-core :jadx-plugins-tools :jadx-plugins-tools :jadx-cli->:jadx-plugins-tools :jadx-plugins:jadx-aab-input :jadx-plugins:jadx-aab-input :jadx-cli->:jadx-plugins:jadx-aab-input :jadx-plugins:jadx-apkm-input :jadx-plugins:jadx-apkm-input :jadx-cli->:jadx-plugins:jadx-apkm-input :jadx-plugins:jadx-apks-input :jadx-plugins:jadx-apks-input :jadx-cli->:jadx-plugins:jadx-apks-input :jadx-plugins:jadx-dex-input :jadx-plugins:jadx-dex-input :jadx-cli->:jadx-plugins:jadx-dex-input :jadx-plugins:jadx-java-convert :jadx-plugins:jadx-java-convert :jadx-cli->:jadx-plugins:jadx-java-convert :jadx-plugins:jadx-java-input :jadx-plugins:jadx-java-input :jadx-cli->:jadx-plugins:jadx-java-input :jadx-plugins:jadx-kotlin-metadata :jadx-plugins:jadx-kotlin-metadata :jadx-cli->:jadx-plugins:jadx-kotlin-metadata :jadx-plugins:jadx-kotlin-source-debug-extension :jadx-plugins:jadx-kotlin-source-debug-extension :jadx-cli->:jadx-plugins:jadx-kotlin-source-debug-extension :jadx-plugins:jadx-rename-mappings :jadx-plugins:jadx-rename-mappings :jadx-cli->:jadx-plugins:jadx-rename-mappings :jadx-plugins:jadx-smali-input :jadx-plugins:jadx-smali-input :jadx-cli->:jadx-plugins:jadx-smali-input :jadx-plugins:jadx-xapk-input :jadx-plugins:jadx-xapk-input :jadx-cli->:jadx-plugins:jadx-xapk-input :jadx-commons:jadx-analysis->:jadx-core :jadx-commons:jadx-zip :jadx-commons:jadx-zip :jadx-core->:jadx-commons:jadx-zip :jadx-plugins:jadx-input-api :jadx-plugins:jadx-input-api :jadx-core->:jadx-plugins:jadx-input-api :jadx-gui :jadx-gui :jadx-gui->:jadx-cli :jadx-gui->:jadx-commons:jadx-app-commons :jadx-gui->:jadx-core :jadx-gui-api :jadx-gui-api :jadx-gui->:jadx-gui-api :jadx-gui->:jadx-plugins-tools :jadx-gui->:jadx-plugins:jadx-rename-mappings :jadx-gui-api->:jadx-core :jadx-plugins-tools->:jadx-commons:jadx-app-commons :jadx-plugins-tools->:jadx-core :jadx-plugins:jadx-aab-input->:jadx-core :jadx-plugins:jadx-apkm-input->:jadx-core :jadx-plugins:jadx-apkm-input->:jadx-plugins:jadx-dex-input :jadx-plugins:jadx-apks-input->:jadx-core :jadx-plugins:jadx-apks-input->:jadx-plugins:jadx-dex-input :jadx-plugins:jadx-dex-input->:jadx-core :jadx-plugins:jadx-java-convert->:jadx-core :jadx-plugins:jadx-java-convert->:jadx-plugins:jadx-dex-input :jadx-plugins:jadx-java-input->:jadx-core :jadx-plugins:jadx-kotlin-metadata->:jadx-core :jadx-plugins:jadx-kotlin-source-debug-extension->:jadx-core :jadx-plugins:jadx-rename-mappings->:jadx-core :jadx-plugins:jadx-smali-input->:jadx-core :jadx-plugins:jadx-smali-input->:jadx-plugins:jadx-dex-input :jadx-plugins:jadx-xapk-input->:jadx-core :jadx-plugins:jadx-xapk-input->:jadx-plugins:jadx-dex-input __more__ +2 more projects

Architecture: which parts of the code depend on which

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

247 modules, with 944 dependencies between them. 11 loops run through 106 of the modules, marked above the diagonal.

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 api.data2 api.metadata3 zip4 api.plugins.gui5 api.plugins.input.data.attributes6 api.plugins.input.insns7 core.xmlgen8 api.plugins.input.data.annotations9 api.plugins.input.data10 api.plugins.input11 core.dex.instructions12 plugins.input.dex.sections13 api.plugins14 core.dex.instructions.args15 core.dex.info16 core.dex.regions.conditions17 core.plugins18 core.dex.attributes.nodes19 core.dex.visitors.regions20 core.dex.visitors21 core.utils22 core.dex.trycatch23 core.dex.attributes24 core.codegen25 core.dex.nodes26 api.plugins.pass.types27 api28 gui.ui.dialog29 gui.utils30 gui.ui.tab31 gui.ui.panel32 gui.ui.codearea33 gui.ui.action34 gui.ui35 gui.jobs36 gui.treemodel37 gui.plugins.context38 gui.settings39 gui40 gui.search.providers
1 api.data
2 api.metadata
3 zip
4 api.plugins.gui1
5 api.plugins.input.data.attributes1
6 api.plugins.input.insns5
7 core.xmlgen611
8 api.plugins.input.data.annotations3
9 api.plugins.input.data311
10 api.plugins.input1
11 core.dex.instructions81325629
12 plugins.input.dex.sections41617
13 api.plugins1114
14 core.dex.instructions.args1118
15 core.dex.info35121
16 core.dex.regions.conditions3311111
17 core.plugins12265
18 core.dex.attributes.nodes135118129253
19 core.dex.visitors.regions1439180
20 core.dex.visitors3222742131814231271
21 core.utils136103111926498
22 core.dex.trycatch421129
23 core.dex.attributes1443233
24 core.codegen28145422112610
25 core.dex.nodes2611361111181613182114
26 api.plugins.pass.types41
27 api1173612341101
28 gui.ui.dialog2831411029
29 gui.utils1113221412
30 gui.ui.tab1624118
31 gui.ui.panel1735172
32 gui.ui.codearea1196476231431
33 gui.ui.action13111415
34 gui.ui353121421
35 gui.jobs22212
36 gui.treemodel54111232551333
37 gui.plugins.context2435213
38 gui.settings632121
39 gui1217122
40 gui.search.providers2211013771312
Uses a module listed above itPart of a loopThe module itself
1 api.data2 api.metadata3 zip4 api.plugins.gui5 api.plugins.input.data.attributes6 api.plugins.input.insns7 core.xmlgen8 api.plugins.input.data.annotations9 api.plugins.input.data10 api.plugins.input11 core.dex.instructions12 plugins.input.dex.sections13 api.plugins14 core.dex.instructions.args15 core.dex.info16 core.dex.regions.conditions17 core.plugins18 core.dex.attributes.nodes19 core.dex.visitors.regions20 core.dex.visitors21 core.utils22 core.dex.trycatch23 core.dex.attributes24 core.codegen25 core.dex.nodes26 api.plugins.pass.types27 api28 gui.ui.dialog29 gui.utils30 gui.ui.tab31 gui.ui.panel32 gui.ui.codearea33 gui.ui.action34 gui.ui35 gui.jobs36 gui.treemodel37 gui.plugins.context38 gui.settings39 gui40 gui.search.providersapi.data1api.metadata2zip3api.plugins.gui4api.plugins.input.data.attributes5api.plugins.input.insns6core.xmlgen7api.plugins.input.data.annotations8api.plugins.input.data9api.plugins.input10core.dex.instructions11plugins.input.dex.sections12api.plugins13core.dex.instructions.args14core.dex.info15core.dex.regions.conditions16core.plugins17core.dex.attributes.nodes18core.dex.visitors.regions19core.dex.visitors20core.utils21core.dex.trycatch22core.dex.attributes23core.codegen24core.dex.nodes25api.plugins.pass.types26api27gui.ui.dialog28gui.utils29gui.ui.tab30gui.ui.panel31gui.ui.codearea32gui.ui.action33gui.ui34gui.jobs35gui.treemodel36gui.plugins.context37gui.settings38gui39gui.search.providers40115611331118132562941617111411183512133111111226513511812925314391803222742131814231271136103111926498421129144323328145422112610261136111118161318211441117361234110128314110291113221412162411817351721196476231431131114153531214212221254111232551333243521363212112171222211013771312+207 more modules (most-connected shown)

At a glance — Code Health · 63% · Adequate · gated by X5 ·

The Good
D3 · .NET / C# God Classes 7.7 D4 · .NET / C# Code Duplication 9.5 D17 · .NET / C# Explicit Debt 9.8 IC1 · Repo Incompleteness & stubs 8.5 X1 · Repo Async correctness 10.0 X12 · Repo Unreachable branch 10.0 X13 · Repo Undrained process stream 10.0 X16 · Repo Unfloored truncation loop 10.0 X18 · Repo Disposal-pattern correctness 10.0 X19 · Repo Unrestored process-global state 10.0 X20 · Repo Mistyped argument guard 10.0 X21 · Repo Side-effecting pattern guard 10.0 X22 · Repo Contradicted release guard 10.0 X23 · Repo Unguarded diagnostic materialisation 10.0 X25 · Repo Inert configuration knob 10.0 X26 · Repo Unsynchronised callback handoff 10.0 X27 · Repo Collection changed while being enumerated 10.0 X28 · Repo Index access outside its own emptiness guard 10.0 X29 · Repo Per-element action decided by a fixed element 10.0 X3 · Repo Exception handling 7.3 X30 · Repo Support guard that admits what it rejects 10.0 X4 · Repo Structured logging 7.8
The Bad
D1 · .NET / C# Cyclomatic Complexity 6.3 D2 · .NET / C# Cognitive Complexity 6.3
The Ugly
X5 · Repo Nullable reference types 2.0

At a glance — Architecture · 83% · Strong ·

The Good
D5 · .NET / C# Coupling 9.3 D6 · .NET / C# Cohesion (LCOM4) 9.9 D26 · .NET / C# Project Cohesion 8.1 D27 · .NET / C# Navigability 9.6 D35 · .NET / C# Change Coupling 10.0 AX10 · Repo Code composition 9.0 AX3 · Repo Project dependency cycles 10.0 AX6 · Repo Interface segregation 9.9
The Bad
AX4 · Repo Dependency direction 6.4

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

The Good
D15 · .NET / C# Churn × Complexity Hotspots 10.0 D16 · .NET / C# Bus Factor 8.9 D19 · .NET / C# Documentation Quality 8.0 D21 · .NET / C# Naming Consistency 10.0 D34 · .NET / C# Knowledge Freshness 8.5 M1 · Repo Documentation (README) 7.0 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0
The Ugly
D20 · .NET / C# ADR Quality 0.0 M2 · Repo Architecture documentation 0.0

At a glance — Readiness · 60% · Adequate · gated by P3 ·

The Good
D9 · .NET / C# Test Distribution 10.0 D10 · .NET / C# Test Quality 10.0 D13 · .NET / C# Secret Scanning 10.0 P1 · Repo CI/CD gates 10.0 P2 · Repo Observability 7.0 P4 · Repo Deployment & Rollback 7.0
The Bad
P6 · Repo Release Hygiene 5.0
The Ugly
P3 · Repo Security & performance tooling 3.0

At a glance — Security · 79% · Adequate · gated by D36 ·

The Good
D28 · .NET / C# Secrets (history) 10.0 D37 · .NET / C# Vulnerability-disclosure Policy 10.0 D44 · .NET / C# Platform End-of-Life 10.0 X14 · Repo Bypassable address classification 10.0 X17 · Repo Uncapped recursion over a caller-supplied document 10.0 X24 · Repo Document value interpolated into markup unescaped 10.0
The Bad
D29 · .NET / C# Static Analysis (SAST) 6.8
The Ugly
D36 · .NET / C# Supply-chain Provenance & Signing 2.5 X15 · Repo Unvalidated length from an untrusted reader 3.5

At a glance — Performance · 64% · Adequate ·

The Bad
PF2 · Repo Allocation hygiene 6.4

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 — Injection45High / Critical
A03:2025 — Software Supply Chain Failures7Medium

Roadmap

First, address the lack of Architecture Decision Records by documenting significant design choices in a dedicated folder to ensure traceability. Next, update the root README to clearly explain how to run the test suite, improving onboarding and usability. Then, resolve the three orphaned knowledge findings by reviewing and updating key files such as REDACTED and Smali.java. Finally, maintain the high quality of existing documentation by ensuring all guides remain clear, structured, and accurate.

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

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.+5.4 ptsLowADR Quality
Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with REDACTED, Smali.java, UsageDialogPlus.java.+3.1 ptsLowKnowledge Freshness
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+5.4 ptsMediumArchitecture documentation
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.+3.4 ptsMediumDocumentation (README)
Improve Documentation Quality — currently 8.0/10.+3.1 ptsMediumDocumentation Quality
Resolve the 65 Orphaned file finding(s) in Knowledge Freshness — start with TraverserActivePathState.java, LogcatPanel.java, BinarySearchServiceImpl.java.+2.1 ptsMediumKnowledge Freshness
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor.+0.9 ptsLowBus Factor
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.+0.9 ptsLowBus Factor

File quality

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

FileScoreBandWorst signal
REDACTED1.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/codegen/InsnGen.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/dex/visitors/ReplaceNewArray.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeUpdate.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/codegen/AnnotationGen.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/dex/nodes/InsnNode.java6.0MixedExplicit Debt: TodoComment
jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/dex/visitors/regions/TernaryMod.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java6.0MixedExplicit Debt: TodoComment
jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/codegen/MethodGen.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/utils/BlockUtils.java6.0MixedExplicit Debt: TodoComment
jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java6.0MixedExplicit Debt: TodoComment

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

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

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

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

Could not be resolved — 13

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

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 59 of 62 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

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

What we checked — 62 dimensions across the health lenses
D1D2D3D4D5D6D9D10D13D15D16D17D19D20D21D26D27D28D29D34D35D36D37D44AX10AX3AX4AX6IC1M1M2M3M4P1P2P3P4P6PF2X1X12X13X14X15X16X17X18X19X20X21X22X23X24X25X26X27X28X29X3X30X4X5

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, 830 of 849 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, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — 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
Watchdog 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
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurementLocal LLM◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a16661-4d18-7f00-a5b8-d353ea38c16d.

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.

  • D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.java) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (JaCoCo XML — the Gradle `jacocoTestReport` task) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (JaCoCo XML — the Gradle `jacocoTestReport` task) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
  • D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.java) and this repository declares a JVM test suite (repository root, Gradle), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 24 Maven/Gradle manifest(s) were read, stating a version for 18 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict.
  • C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
  • C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
  • C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
  • GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Java, Kotlin is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
  • D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
  • D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 · Cyclomatic Complexity6.3 / 10Adequate✓ 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 6.3 / 10 · rule-coverage 100% · ceiling Prevented

70 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was EntryConfig.generateQualifiers at 75. 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 InsnDecoder.decode at 151 — they are counted neither in the figure above nor in this dimension's score. 5 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: jadx-core/src/main/java/jadx/core/dex/instructions/InsnDecoder.java (InsnDecoder.decode at 151), REDACTED (ADB.hexToInt at 24), jadx-gui/src/main/java/jadx/gui/treemodel/JResource.java (JResource.getIcon at 19), jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/sections/annotations/EncodedValueParser.java (EncodedValueParser.parseValue at 19), jadx-gui/src/main/java/jadx/gui/device/debugger/RuntimeType.java (RuntimeType.fromJdwpTag at 17). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

EntryConfig.generateQualifiers (cyclomatic 75)jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:153
InsnGen.makeInsnBody (cyclomatic 68)jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:314
MappingExporter.exportMappings (cyclomatic 35)jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java:57
SwitchOverStringVisitor.collectPart1RegionCases (cyclomatic 35)jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:129
TypeCompare.compareObjectsNoPreCheck (cyclomatic 31)jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeCompare.java:161

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

What to do

  1. Bring the 5 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with EntryConfig.generateQualifiers (cyclomatic 75), InsnGen.makeInsnBody (cyclomatic 68), MappingExporter.exportMappings (cyclomatic 35). — 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 5 together lifts Cyclomatic Complexity from 6.3 to about 7.3/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
  2. Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D2 · Cognitive Complexity6.3 / 10Adequate✓ 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 6.3 / 10 · rule-coverage 100% · ceiling Prevented

215 method(s) exceeded the cognitive complexity threshold of 15; the worst was SwitchOverStringVisitor.collectPart1RegionCases at 78.

SwitchOverStringVisitor.collectPart1RegionCases (cognitive 78)jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:129
MappingExporter.exportMappings (cognitive 76)jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java:57
TryCatchBlockAttr.exploreTryPath (cognitive 71)jadx-core/src/main/java/jadx/core/dex/trycatch/TryCatchBlockAttr.java:206
MethodUtils.processMethodArgsOverloaded (cognitive 60)jadx-core/src/main/java/jadx/core/dex/nodes/utils/MethodUtils.java:98
TryEdgeScopeGroupMap.getScopeEnds (cognitive 57)jadx-core/src/main/java/jadx/core/dex/trycatch/TryEdgeScopeGroupMap.java:134

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

What to do

  1. Bring the 3 bodies over 60 down to 60 or less in Cognitive Complexity — start with SwitchOverStringVisitor.collectPart1RegionCases (cognitive 78), MappingExporter.exportMappings (cognitive 76), TryCatchBlockAttr.exploreTryPath (cognitive 71). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cognitive Complexity from 6.3 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D3 · God Classes7.7 / 10Strong✓ Tool-verified

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

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

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

109 god class(es) detected.

TooManyMethods: JadxSettings · ×53jadx-gui/src/main/java/jadx/gui/settings/JadxSettings.java:47
ClassTooLong: MainWindow · ×29jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:194
FileTooLong: ui/MainWindow.java · ×19jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java
MethodTooLong: InsnDecoder.decode · ×8jadx-core/src/main/java/jadx/core/dex/instructions/InsnDecoder.java:68

What to do

  1. Resolve the 53 TooManyMethods finding(s) in God Classes — start with JadxSettings.java, JadxArgs.java, BlockUtils.java. — One of this dimension's main actionable groups (53 warning-level).
  2. Resolve the 29 ClassTooLong finding(s) in God Classes — start with MainWindow.java, DebugController.java, BlockUtils.java. — One of this dimension's main actionable groups (29 warning-level).
  3. Resolve the 19 FileTooLong finding(s) in God Classes — start with MainWindow.java, DebugController.java, BlockUtils.java. — One of this dimension's main actionable groups (19 warning-level).
  4. Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D4 · Code Duplication9.5 / 10Stronggated by 129 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

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

126 duplicated block group(s) detected. A further 3 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.

Duplicated block (7 lines × 2) · ×22jadx-core/src/main/java/jadx/api/data/impl/JadxCodeComment.java:81
Duplicated block (6 lines × 2) · ×15jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:871
Duplicated block (8 lines × 2) · ×14jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:304
Duplicated block (9 lines × 2) · ×13jadx-core/src/main/java/jadx/core/dex/instructions/InvokeCustomRawNode.java:87
Duplicated block (5 lines × 2) · ×13jadx-core/src/main/java/jadx/core/dex/visitors/DeboxingVisitor.java:66

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

What to do

  1. Resolve the 22 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with UsageDialog.java (2), CallGraphDialog.java (2), LookupSwitchDecoder.java (2). — One of this dimension's main actionable groups (22 warning-level).
  2. Resolve the 15 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with ClassGen.java, OverrideMethodVisitor.java, DebugSettings.java. — One of this dimension's main actionable groups (15 warning-level).
  3. Resolve the 14 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with ModVisitor.java, BlockProcessor.java, AndroidManifestParser.java. — One of this dimension's main actionable groups (14 warning-level).
  4. Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

D5 · Coupling9.3 / 10Stronggated by 2 serious findings✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

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

22 production modules (Gradle), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; 4 module(s) off the main sequence, with abstractness counted on 21 of the 22 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

Off the main sequence: :jadx-plugins:jadx-dex-input · ×2
Off the main sequence: :jadx-commons:jadx-app-commons · ×2

What to do

  1. Resolve the 2 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (2 warning-level).
  2. Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

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

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

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

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

2 of 405 classes have LCOM4 above 3.

Low cohesion: InfoStorage (LCOM4 4) · ×2jadx-core/src/main/java/jadx/core/dex/info/InfoStorage.java:10

What to do

  1. Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with InfoStorage.java, ProtoValue.java. — One of this dimension's main actionable groups (2 warning-level).
  2. Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

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

952 test methods: 952 unit, 0 integration, 0 BDD, 0 e2e.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

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

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

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

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

0 skipped, 2 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 952 tests.

No assertions: test · ×2jadx-core/src/test/java/jadx/tests/integration/conditions/TestTernaryInIf3.java:10

What to do

  1. Resolve the 2 No assertions finding(s) in Test Quality — start with TestTernaryInIf3.java, TestI18n.java. — One of this dimension's main actionable groups (2 warning-level).
  2. Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D15 · Churn × Complexity Hotspots10.0 / 10Stronggated by 4 serious findings✓ Tool-verified

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

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

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

No churn × complexity hotspots in the window. Repeated repair below the complexity floor: jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java (5 of 8 changes were fixes); jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java (4 of 5 changes were fixes); jadx-gui/src/main/java/jadx/gui/plugins/GuiPluginsManager.java (3 of 4 changes were fixes)

Repeated repair: jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java · ×4jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1884

What to do

  1. Resolve the 4 Repeated repair finding(s) in Churn × Complexity Hotspots — start with MainWindow.java, JadxSettingsWindow.java, GuiPluginsManager.java. — One of this dimension's main actionable groups (4 warning-level).

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

D16 · Bus Factor8.9 / 10Strong✓ Tool-verified

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

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

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

50 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeUpdate.java. Counted over 464 of the 1295 production source files in this repository: 818 are under the ~2,400-byte size floor this dimension measures over, and the remaining 13 have no attributable history left to measure.

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

What to do

  1. Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

D17 · Explicit Debt9.8 / 10Stronggated by 126 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 9.8 / 10 · rule-coverage 100% · ceiling Prevented

126 deducted task-comment markers across 134371 LoC (0.1/KLoC) → score 9.8. 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 · ×125jadx-cli/src/main/java/jadx/cli/JadxAppCommon.java:25
FixmeCommentjadx-core/src/main/java/jadx/core/codegen/InsnGen.java:938

What to do

  1. Resolve the 125 TodoComment finding(s) in Explicit Debt — start with AnnotationGen.java (3), ProcessVariables.java (3), UsageInfo.java (3). — One of this dimension's main actionable groups (125 warning-level).
  2. Resolve the 1 FixmeComment finding(s) in Explicit Debt — start with InsnGen.java. — One of this dimension's main actionable groups (1 warning-level).
  3. Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D19 · Documentation QualityStrong◐ Sampled · advisory

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

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

The repository's root README gives a strong overview (what jadx is, main features, decompilation limitations), links to the troubleshooting guide, and lists Install/Usage sections plus Build from source. The config/jflex/README.md, jadx-commons/jadx-analysis/, and other directory READMEs each document their own subdirectories rather than the root repository, so they are not flagged for missing overview/installation/usage/contributing. All visible documents are clear and well-structured.

What to do

  1. Improve Documentation Quality — currently 8.0/10. — The repository's root README gives a strong overview (what jadx is, main features, decompilation limitations), links to the troubleshooting guide, and lists Install/Usage sections plus Build from source. The config/jflex/README.md, jadx-commons/jadx-analysis/, and other directory READMEs each document their own subdirectories rather than the root repository, so they are not flagged for missing overview/installation/usage/contributing. All visible documents are clear and well-structured.

Detailed fixes: d19_recommendation.md.

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

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

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

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

No architecture decision records were found.

No ADRs found

What to do

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

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

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

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

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

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

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

D26 · Project Cohesion8.1 / 10Strong✓ Tool-verified

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

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

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

2 of 21 build units (Gradle) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

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

55 % of calls cross a namespace and 8 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)6.8 / 10Adequate✓ 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 6.8 / 10 · rule-coverage 100% · ceiling Documented

45 finding(s): 0 critical, 41 high, 4 medium, 0 low. 40 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `gradlew` (line 74, line 178) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

D34 · Knowledge Freshness8.5 / 10Adequategated by 3 critical findings✓ 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 8.5 / 10 · rule-coverage 100% · ceiling Documented

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

Orphaned knowledge · ×3REDACTED:1
Orphaned file · ×65jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/state/TraverserActivePathState.java:1
Further orphaned files (smaller)

What to do

  1. Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with REDACTED, Smali.java, UsageDialogPlus.java. — One of this dimension's main actionable groups (3 issue-level).
  2. Resolve the 65 Orphaned file finding(s) in Knowledge Freshness — start with TraverserActivePathState.java, LogcatPanel.java, BinarySearchServiceImpl.java. — One of this dimension's main actionable groups (65 recommendation-level).
  3. Resolve the 1 Further orphaned files (smaller) 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.

D36 · Supply-chain Provenance & Signing2.5 / 10Weak✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition9.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.

What to do

  • The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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

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

AX4 · Dependency direction6.4 / 10Adequate✓ Tool-verified

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

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

  • `:jadx-core` is a Domain project but references `:jadx-plugins:jadx-input-api`, a Web project. The clean-architecture rule is that dependencies point INWARD — the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one.

What to do

  • Keep dependencies pointing inward: domain/application define interfaces, infrastructure/web implement them (Dependency Inversion).
AX6 · Interface segregation9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

  • `InsnData` declares 22 abstract methods: `decode`, `getByteCode`, `getFileOffset`, `getIndex`, `getIndexAsCallSite`, `getIndexAsField`, `getIndexAsMethod`, `getIndexAsMethodHandle`, `getIndexAsProto`, `getIndexAsString`, `getIndexAsType`, `getIndexType`, `getLiteral`, `getOffset`, `getOpcode`, `getOpcodeMnemonic`, `getPayload`, `getRawOpcodeUnit`, `getReg`, `getRegsCount`, `getResultReg`, `getTarget`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — jadx-plugins/jadx-input-api/src/main/java/jadx/api/plugins/input/insns/InsnData.java:10
  • `JadxGuiContext` declares 18 abstract methods: `addMenuAction`, `addPopupMenuAction`, `addTreePopupMenuEntry`, `applyNodeRename`, `copyToClipboard`, `getEnclosingNodeUnderCaret`, `getEnclosingNodeUnderMouse`, `getMainFrame`, `getNodeUnderCaret`, `getNodeUnderMouse`, `getSVGIcon`, `open`, `openUsageDialog`, `registerGlobalKeyBinding`, `reloadActiveTab`, `reloadAllTabs`, `settings`, `uiRun`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — jadx-core/src/main/java/jadx/api/plugins/gui/JadxGuiContext.java:17
  • `ICodeWriter` declares 26 abstract methods: `add`, `add`, `add`, `addIndent`, `addMultiLine`, `attachAnnotation`, `attachDefinition`, `attachLineAnnotation`, `attachSourceLine`, `decIndent`, `finish`, `getCodeStr`, `getIndent`, `getLength`, `getLine`, `getLineStartPos`, `getRawAnnotations`, `getRawBuf`, `incIndent`, `isMetadataSupported`, `newLine`, `setIndent`, `startLine`, `startLine`, `startLine`, `startLineWithNum`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. Those 26 declarations carry 22 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 22 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — jadx-core/src/main/java/jadx/api/ICodeWriter.java:10
  • `IAttributeNode` declares 19 abstract methods: `add`, `addAttr`, `addAttr`, `addAttrs`, `clearAttributes`, `contains`, `contains`, `copyAttributeFrom`, `copyAttributesFrom`, `get`, `getAll`, `getAnnotation`, `getAttributesString`, `getAttributesStringsList`, `isAttrStorageEmpty`, `remove`, `remove`, `removeAttr`, `rewriteAttributeFrom`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. Those 19 declarations carry 16 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 16 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — jadx-core/src/main/java/jadx/core/dex/attributes/IAttributeNode.java:9

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
IC1 · Incompleteness & stubs8.5 / 10Strong✓ Tool-verified

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Java: methods that only throw a "not implemented" exception, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

  • `visitUsageData` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — jadx-gui/src/main/java/jadx/gui/cache/usage/UsageData.java:79
  • `copy` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/LazyLoadingBinaryData.java:115

What to do

  • Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
M1 · Documentation (README)7.0 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

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

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
  • Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
  • Add a README to the 18 of 22 project(s) that lack one — worth up to 1.6 pts.
M2 · Architecture documentation0.0 / 10Critical✓ Tool-verified

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

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

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
  • No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

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

M4 · Documentation accuracy10.0 / 10Exemplary◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

P3 · Security & performance tooling3.0 / 10Weak✓ 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 spotbugs with find-sec-bugs (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 10632 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

  • Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
  • Dependabot is configured but does not watch `gradle` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

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

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

P6 · Release 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.

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
PF2 · Allocation hygiene6.4 / 10Adequate✓ Tool-verified

Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.

Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.

What to do

  • Raise allocation-aware density on the hot paths — currently 128 use(s) across 155,093 production line(s) (~0.8/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
  • Java: on hot paths, work through buffer views (ByteBuffer/LongBuffer slices, MemorySegment) instead of copies, avoid boxing with primitive collections (fastutil, Eclipse Collections, HPPC, Trove), presize collections and StringBuilders, and pool expensive buffers (Netty's pooled allocator, commons-pool).
  • Kotlin: on hot paths, use primitive arrays (IntArray, LongArray …) and @JvmInline value classes instead of boxed values, primitive collections (androidx.collection, fastutil) instead of boxed ones, and presize collections and StringBuilders.
X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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

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

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

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

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

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

X15 · Unvalidated length from an untrusted reader3.5 / 10Weak✓ Tool-verified

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

  • `clsCount` is read from the bytes being parsed at line 320 (`readInt`), then used to size a `new ClspClass[]` at line 321 — and nowhere in its scope is `clsCount` bounded from above — compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an `OutOfMemoryError` or, negative, throws `NegativeArraySizeException` out of a parser whose failure path was written for malformed input, not for hostile input. Bound `clsCount` against the bytes actually remaining and a maximum the format allows before allocating. — jadx-core/src/main/java/jadx/core/clsp/ClsSet.java:321

What to do

  • Each finding names the read that takes the length from the input and the site that spends it, and states that the value is never compared in between. Confirm from the two, then bound the length against the remaining stream before using it.
X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

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

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

X20 · Mistyped argument guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.

Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.

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

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

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

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

X23 · Unguarded diagnostic materialisation10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an enhanced `for` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is iterating invalidates the fail-fast iterator it is holding, so the next `next()` throws `ConcurrentModificationException` and the remaining elements are never seen. Whether a `for (x in c)` or `c.forEach { … }` leaves the collection it is walking alone — a `mutableListOf`/`ArrayList`, `mutableMapOf`/`HashMap` or `mutableSetOf`/`HashSet` is a `java.util` collection on the JVM and is walked by its own fail-fast iterator, so a body that adds to or removes from the very collection the loop is walking makes the next step throw `ConcurrentModificationException` and the remaining elements are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

X3 · Exception handling7.3 / 10Strong✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×4) — jadx-cli/src/main/java/jadx/cli/JCommanderWrapper.java:268, jadx-core/src/main/java/jadx/core/deobf/FileTypeDetector.java:107, jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:351, …
  • `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×9) — jadx-core/src/main/java/jadx/core/dex/visitors/FixSwitchOverEnum.java:141, jadx-core/src/main/java/jadx/core/utils/Utils.java:682, jadx-core/src/main/java/jadx/core/utils/Utils.java:693, …
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `close()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch. — jadx-plugins-tools/src/main/java/jadx/plugins/tools/JadxExternalPluginsLoader.java:173
  • `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmUtils.kt:19

What to do

  • Swallowed exception (empty catch)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

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

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

X4 · Structured logging7.8 / 10Strong✓ Tool-verified

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

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

  • `info` at line 149 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.info("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text. — jadx-core/src/main/java/jadx/core/utils/DecompilerScheduler.java:149
  • `error` at line 118 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.error("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text. — jadx-gui/src/main/java/jadx/gui/cache/code/disk/DiskCodeCache.java:118
  • `error` at line 90 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.error("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text. — jadx-gui/src/main/java/jadx/gui/cache/manager/CacheManager.java:90
  • `debug` at line 143 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.debug("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text. — jadx-gui/src/main/java/jadx/gui/events/services/RenameService.java:143
  • `info` at line 105 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.info("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text. — jadx-gui/src/main/java/jadx/gui/jobs/DecompileTask.java:105

What to do

  • Interpolated log message defeats structured logging
X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether Java packages are null-marked and not undermined by heavy nullness suppression — a package under `@NullMarked` (or `@NonNullApi`, `@ParametersAreNonnullByDefault`, `@NonNullByDefault`, or a NullAway/Checker Framework configuration naming it) makes an unannotated reference exclude null, and `@SuppressWarnings("NullAway")`, `("nullness")`, `("null")` and `castToNonNull(…)` are what silence it.

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

  • 0/224 of this repository's Java package directories are under a non-null default: a `package-info.java` declaring `@NullMarked` (JSpecify) or `@NonNullApi`, `@ParametersAreNonnullByDefault`, `@NonNullByDefault`, `@DefaultQualifier(NonNull.class)`; a `module-info.java` declaring `@NullMarked`; every type in it `@NullMarked`; or a build that runs NullAway with the package in `AnnotatedPackages`, or the Checker Framework's `NullnessChecker`. Elsewhere every reference admits null and no checker warns on the dereference that throws a `NullPointerException`.

What to do

  • Declare the default where Java declares it: `@NullMarked` (org.jspecify.annotations) in each package's `package-info.java`, or once in `module-info.java`, and run NullAway (Error Prone) or the Checker Framework so the declaration is enforced. Then annotate the real exceptions `@Nullable` and resolve the suppressions rather than adding to them: a `@SuppressWarnings("NullAway")` or `castToNonNull(x)` on a value the checker could show to be null is a `NullPointerException` waiting for the path that makes it true — where the value genuinely cannot be null, say something the checker can see instead (a null check, `Objects.requireNonNull`, a non-null field initialised in the constructor).

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 Health63%Adequate — gated by X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture83%StrongStrongest area.
Maturity53%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness60%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security79%Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance64%AdequateAcceptable, with room to improve.
Unscored — 3 check(s) recorded observations but carry no score

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

  • X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 4 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X9 Subsumed condition operand — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 4 control(s) we could not find positive evidence for

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

  • C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 50 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: this repository's Java imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Kotlin imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Java code is a Spring, JSR-330 or CDI singleton bean. No class in this Kotlin code is a Spring, JSR-330 or CDI singleton bean.
  • 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
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included — the .java suite was found but not re-run
  • D12 Dependency Hygiene — Not scored — 24 Maven/Gradle manifest(s) were read, stating a version for 18 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
  • D14 License Compliance — Not scored — this repository's 18 declared JVM dependency coordinate(s) were read from its 24 Maven/Gradle manifest(s), but Maven Central could not be asked for the licence of 18 of them (HTTP 429 Too Many Requests from https://repo1.maven.org/maven2/org/exbin/auxiliary/binary_data/0.2.2/binary_data-0.2.2.pom), and a licence verdict over part of a dependency graph is not a licence verdict. Nothing is asserted about this repository's licensing in either direction.
  • 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.
  • 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+ projects each declaring an entity of their own. 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 — No inline comments to assess — comment value is not applicable here.
  • D25 ADR Conformance — no ADRs to check
  • 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 Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — 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.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • 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 Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — not scanned yet).
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not included — suite not readable by the collector
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 111 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM source, so there is no service whose uptime a failing dependency could take down
  • 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 — no coverage report found on disk — produce a coverage report in a standard format (JaCoCo XML — the Gradle `jacocoTestReport` task) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
  • S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • X2 Cancellation propagation — no C# was loaded; this repository's Java and Kotlin were read, and no request in it can be cancelled by a caller (Ktor, OkHttp's newCall or a URL stream, from a suspend function) — a Java request off Android takes no token: it is cancelled through the handle it returns (Future.cancel, Call.cancel, a Disposable), ambiently (io.grpc.Context) or by interrupting its thread, not through a parameter; a Kotlin request outside a suspend function has no caller's cancellation to honour
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 45 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
  • + 15 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned knowledge · ×3
  • Orphaned knowledge REDACTED:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
AX4 · Dependency direction · Dependency-rule violation · ×1
  • Dependency-rule violation: :jadx-core (Domain) → :jadx-plugins:jadx-input-api (Web) — `:jadx-core` is a Domain project but references `:jadx-plugins:jadx-input-api`, a Web project. The clean-architecture rule is that dependencies point INWARD — the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 685 finding(s)
D17 · Explicit Debt · TodoComment · ×125
  • TodoComment jadx-cli/src/main/java/jadx/cli/JadxAppCommon.java:25 — // TODO: not related to 'xml security', but kept for compatibility — 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 jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphExportJson.java:36 — // .setPrettyPrinting() // TODO: add option for pretty print? — 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 jadx-core/src/main/java/jadx/api/ResourcesLoader.java:38 — // TODO: move to core package — 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 jadx-core/src/main/java/jadx/api/JadxDecompiler.java:389 — // TODO: add property to set file name or reference to resource name — 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 jadx-core/src/main/java/jadx/core/ProcessClass.java:249 — // TODO: make passes list private and not visible — 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 jadx-core/src/main/java/jadx/core/Jadx.java:157 — // TODO: disabled until issue resolved, check TODO comment inside — 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 jadx-core/src/main/java/jadx/core/Consts.java:5 — // TODO: fix errors — 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 jadx-core/src/main/java/jadx/core/codegen/RegionGen.java:315 — // TODO: move search of 'allHandler' to 'TryCatchRegion' — 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 jadx-core/src/main/java/jadx/core/codegen/NameGen.java:82 — // TODO: avoid name collision with variables names — 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 jadx-core/src/main/java/jadx/core/codegen/MethodGen.java:267 — // TODO: try simple mode first — 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 jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:241 — // 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 jadx-core/src/main/java/jadx/core/codegen/AnnotationGen.java:200 — // 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 jadx-gui-api/src/main/java/jadx/api/gui/IMainWindow.java:7 — // 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 jadx-core/src/main/java/jadx/core/codegen/AnnotationGen.java:112 — // TODO: save value type and search using signature — 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 jadx-core/src/main/java/jadx/core/codegen/AnnotationGen.java:143 — // TODO: refactor this boilerplate code — 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 jadx-core/src/main/java/jadx/core/dex/info/ClassInfo.java:55 — // TODO: check case with method declared in array class like ( clone in int[]) — 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 jadx-core/src/main/java/jadx/core/dex/instructions/args/ArgType.java:93 — // TODO: add caching — 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 jadx-core/src/main/java/jadx/core/dex/nodes/RootNode.java:399 — // TODO: make better API for reload passes lists — 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 jadx-core/src/main/java/jadx/core/dex/nodes/MethodNode.java:161 — // TODO: registers not needed without code — 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 jadx-core/src/main/java/jadx/core/dex/nodes/InsnNode.java:280 — // TODO: allow to move final fields — 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 jadx-core/src/main/java/jadx/core/dex/nodes/ClassNode.java:148 — // TODO: implement module attribute parsing — 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 jadx-core/src/main/java/jadx/core/dex/nodes/utils/TypeUtils.java:259 — // TODO: resolve inner type vars: 'List<T> -> List<String>' to 'T -> String' — 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 jadx-core/src/main/java/jadx/core/dex/nodes/utils/TypeUtils.java:281 — // TODO build complete map for type variables — 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 jadx-core/src/main/java/jadx/core/dex/trycatch/ExceptionHandler.java:164 — // TODO: Implement support for finding bottom splitter of catch with inner tries — 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 jadx-core/src/main/java/jadx/core/dex/visitors/ReplaceNewArray.java:176 — // TODO: check that all args already assigned — 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.
  • + 100 more in this group — see findings.md.
D3 · God Classes · TooManyMethods · ×53
  • TooManyMethods: JadxSettings jadx-gui/src/main/java/jadx/gui/settings/JadxSettings.java:47 — TooManyMethods — 179 methods. The bar is 30 methods; this is 149 over it, 5.97× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: JadxArgs jadx-core/src/main/java/jadx/api/JadxArgs.java:49 — TooManyMethods — 151 methods. The bar is 30 methods; this is 121 over it, 5.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.
  • TooManyMethods: BlockUtils jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:46 — TooManyMethods — 117 methods. The bar is 30 methods; this is 87 over it, 3.90× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: JadxCLIArgs jadx-cli/src/main/java/jadx/cli/JadxCLIArgs.java:47 — TooManyMethods — 115 methods. The bar is 30 methods; this is 85 over it, 3.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: MainWindow jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:194 — TooManyMethods — 111 methods. The bar is 30 methods; this is 81 over it, 3.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ClassNode jadx-core/src/main/java/jadx/core/dex/nodes/ClassNode.java:59 — TooManyMethods — 110 methods. The bar is 30 methods; this is 80 over it, 3.67× 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: MethodNode jadx-core/src/main/java/jadx/core/dex/nodes/MethodNode.java:51 — TooManyMethods — 102 methods. The bar is 30 methods; this is 72 over it, 3.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: SmaliDebugger REDACTED:83 — TooManyMethods — 88 methods. The bar is 30 methods; this is 58 over it, 2.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: JadxSettingsData jadx-gui/src/main/java/jadx/gui/settings/JadxSettingsData.java:33 — TooManyMethods — 87 methods. The bar is 30 methods; this is 57 over it, 2.90× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: RootNode jadx-core/src/main/java/jadx/core/dex/nodes/RootNode.java:70 — TooManyMethods — 69 methods. The bar is 30 methods; this is 39 over it, 2.30× 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: JadxDecompiler jadx-core/src/main/java/jadx/api/JadxDecompiler.java:87 — TooManyMethods — 65 methods. The bar is 30 methods; this is 35 over it, 2.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: DebugController jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:46 — TooManyMethods — 61 methods. The bar is 30 methods; this is 31 over it, 2.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.
  • TooManyMethods: ArgType jadx-core/src/main/java/jadx/core/dex/instructions/args/ArgType.java:24 — TooManyMethods — 60 methods. The bar is 30 methods; this is 30 over it, 2.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Utils jadx-core/src/main/java/jadx/core/utils/Utils.java:35 — TooManyMethods — 56 methods. The bar is 30 methods; this is 26 over it, 1.87× 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: InsnNode jadx-core/src/main/java/jadx/core/dex/nodes/InsnNode.java:28 — TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TabbedPane jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java:64 — TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: FileUtils REDACTED:45 — TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TabsController jadx-gui/src/main/java/jadx/gui/ui/tab/TabsController.java:27 — TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: UiUtils jadx-gui/src/main/java/jadx/gui/utils/UiUtils.java:58 — 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: Smali jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java:73 — 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: JavaClass jadx-core/src/main/java/jadx/api/JavaClass.java:27 — 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: FixTypesVisitor jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:62 — 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: JadxProject jadx-gui/src/main/java/jadx/gui/settings/JadxProject.java:53 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: JavaInsnData jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnData.java:18 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: DexInsnData jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/insns/DexInsnData.java:17 — 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.
  • + 28 more in this group — see findings.md.
D3 · God Classes · ClassTooLong · ×29
  • ClassTooLong: MainWindow jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:194 — ClassTooLong — 1268 significant lines (blank, comment-only and punctuation-only lines excluded), 111 methods. The bar is 400 significant lines; this is 868 over it, 3.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.
  • ClassTooLong: DebugController jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:46 — ClassTooLong — 1010 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 400 significant lines; this is 610 over it, 2.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: BlockUtils jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:46 — ClassTooLong — 926 significant lines (blank, comment-only and punctuation-only lines excluded), 117 methods. The bar is 400 significant lines; this is 526 over it, 2.32× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: SmaliDebugger REDACTED:83 — ClassTooLong — 851 significant lines (blank, comment-only and punctuation-only lines excluded), 88 methods. The bar is 400 significant lines; this is 451 over it, 2.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.
  • ClassTooLong: XMLChar jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:43 — ClassTooLong — 756 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 356 over it, 1.89× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: Smali jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java:73 — ClassTooLong — 733 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 400 significant lines; this is 333 over it, 1.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: JadxCLIArgs jadx-cli/src/main/java/jadx/cli/JadxCLIArgs.java:47 — ClassTooLong — 643 significant lines (blank, comment-only and punctuation-only lines excluded), 115 methods. The bar is 400 significant lines; this is 243 over it, 1.61× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: TabbedPane jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java:64 — ClassTooLong — 640 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 400 significant lines; this is 240 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.
  • ClassTooLong: FixTypesVisitor jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:62 — ClassTooLong — 611 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 211 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ArgType jadx-core/src/main/java/jadx/core/dex/instructions/args/ArgType.java:24 — ClassTooLong — 581 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 400 significant lines; this is 181 over it, 1.45× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ClassNode jadx-core/src/main/java/jadx/core/dex/nodes/ClassNode.java:59 — ClassTooLong — 566 significant lines (blank, comment-only and punctuation-only lines excluded), 110 methods. The bar is 400 significant lines; this is 166 over it, 1.42× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: SearchDialog jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:98 — ClassTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 161 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.
  • ClassTooLong: JadxSettingsWindow jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:84 — ClassTooLong — 551 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 151 over it, 1.38× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: BlockProcessor jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:40 — ClassTooLong — 537 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 137 over it, 1.34× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: EnumVisitor jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:75 — ClassTooLong — 503 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 103 over it, 1.26× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: InsnDecoder jadx-core/src/main/java/jadx/core/dex/instructions/InsnDecoder.java:35 — ClassTooLong — 498 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 98 over it, 1.25× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: EntryConfig jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:29 — ClassTooLong — 494 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 94 over it, 1.24× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: JadxArgs jadx-core/src/main/java/jadx/api/JadxArgs.java:49 — ClassTooLong — 465 significant lines (blank, comment-only and punctuation-only lines excluded), 151 methods. The bar is 400 significant lines; this is 65 over it, 1.16× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: MethodNode jadx-core/src/main/java/jadx/core/dex/nodes/MethodNode.java:51 — ClassTooLong — 463 significant lines (blank, comment-only and punctuation-only lines excluded), 102 methods. The bar is 400 significant lines; this is 63 over it, 1.16× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: RootNode jadx-core/src/main/java/jadx/core/dex/nodes/RootNode.java:70 — ClassTooLong — 450 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 400 significant lines; this is 50 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.
  • ClassTooLong: JadxDecompiler jadx-core/src/main/java/jadx/api/JadxDecompiler.java:87 — ClassTooLong — 439 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 400 significant lines; this is 39 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.
  • ClassTooLong: JadxSettings jadx-gui/src/main/java/jadx/gui/settings/JadxSettings.java:47 — ClassTooLong — 436 significant lines (blank, comment-only and punctuation-only lines excluded), 179 methods. The bar is 400 significant lines; this is 36 over it, 1.09× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: Utils jadx-core/src/main/java/jadx/core/utils/Utils.java:35 — ClassTooLong — 424 significant lines (blank, comment-only and punctuation-only lines excluded), 56 methods. The bar is 400 significant lines; this is 24 over it, 1.06× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: IfRegionMaker jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:48 — ClassTooLong — 418 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 18 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: SimplifyVisitor jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.java:48 — ClassTooLong — 414 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 14 over it, 1.04× 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.
  • + 4 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×22
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/api/data/impl/JadxCodeComment.java:81 — jadx-core/src/main/java/jadx/api/data/impl/JadxCodeComment.java:81-87 | jadx-core/src/main/java/jadx/api/data/impl/JadxCodeRename.java:61-67 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `other` to `ICodeComment` in one and `ICodeRename` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/Jadx.java:149 — jadx-core/src/main/java/jadx/core/Jadx.java:149-155 | jadx-core/src/main/java/jadx/core/Jadx.java:239-245 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-core/src/main/java/jadx/core/Jadx.java:146` calls `isExtractFinally`, `add`, `MarkFinallyVisitor` and `jadx-core/src/main/java/jadx/core/Jadx.java:238` 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 × 2) jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:109 — jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:109-115 | jadx-core/src/main/java/jadx/core/dex/nodes/IMethodDetails.java:34-40 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:116` calls `getMethodInfo`, `getFullName` and `jadx-core/src/main/java/jadx/core/dex/nodes/IMethodDetails.java:41` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java:263 — jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java:263-269 | jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:142-148 — 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 `jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java:263` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/export/gen/AndroidGradleGenerator.java:156 — jadx-core/src/main/java/jadx/core/export/gen/AndroidGradleGenerator.java:156-162 | jadx-core/src/main/java/jadx/core/export/gen/AndroidGradleGenerator.java:171-177 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-core/src/main/java/jadx/core/export/gen/AndroidGradleGenerator.java:163` calls `add`, `getTargetSdkVersion`, `getVersionCode` and `jadx-core/src/main/java/jadx/core/export/gen/AndroidGradleGenerator.java:178` 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 × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:48 — jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:48-55 | jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:94-100 — 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) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:127 — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:127-133 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:444-450 — before extracting anything, compare `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:127` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:165 — jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:165-171 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:99-105 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:143 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:143-149 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:265-271 — 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 `jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:143` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/DataReader.java:71 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/DataReader.java:71-77 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/DataReader.java:82-88 — 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) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:309 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:309-315 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:328-334 — 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 `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:309` 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, `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:336` calls `peekFrom` and `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:317` 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 × 2) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:21 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:21-27 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/TableSwitchDecoder.java:21-27 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/TableSwitchDecoder.java:28` calls `readS4` and `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:28` 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 × 2) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:28 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:28-34 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/TableSwitchDecoder.java:30-36 — 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 `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:28` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/TableSwitchDecoder.java:28` calls `readS4` and `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:27` 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 × 2) jadx-commons/jadx-zip/src/main/java/jadx/zip/fallback/FallbackZipParser.java:66 — jadx-commons/jadx-zip/src/main/java/jadx/zip/fallback/FallbackZipParser.java:66-72 | jadx-commons/jadx-zip/src/main/java/jadx/zip/parser/JadxZipParser.java:114-120 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `zipEntry` to `IZipEntry` in one and `JadxZipEntry` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:524 — jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:524-530 | jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/ResXmlProtoParser.java:185-191 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:139 — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:139-145 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:456-462 — before extracting anything, compare `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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) jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:286 — jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:286-292 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:161-167 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/dex/trycatch/TryEdgeScopeGroupMap.java:57 — jadx-core/src/main/java/jadx/core/dex/trycatch/TryEdgeScopeGroupMap.java:57-64 | jadx-core/src/main/java/jadx/core/dex/visitors/finaly/TryCatchEdgeBlockMap.java:108-114 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/utils/android/ExtDataInput.java:36 — jadx-core/src/main/java/jadx/core/utils/android/ExtDataInput.java:36-42 | jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/sections/SectionReader.java:125-131 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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) jadx-core/src/main/java/jadx/core/xmlgen/ResTableBinaryParserProvider.java:18 — jadx-core/src/main/java/jadx/core/xmlgen/ResTableBinaryParserProvider.java:18-24 | jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/ResTableProtoParserProvider.java:20-26 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:136 — jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:136-142 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:75-81 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:436 — jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:436-442 | jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.java:265-271 — 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 `jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:436` 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.
D3 · God Classes · FileTooLong · ×19
  • FileTooLong: ui/MainWindow.java jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java — FileTooLong — 1454 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: MainWindow (194-1975). The bar is 500 significant lines; this is 954 over it, 2.91× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: debugger/DebugController.java jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java — FileTooLong — 1050 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: DebugController (46-1506). The bar is 500 significant lines; this is 550 over it, 2.10× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: utils/BlockUtils.java jadx-core/src/main/java/jadx/core/utils/BlockUtils.java — FileTooLong — 967 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: BlockUtils (46-1630). The bar is 500 significant lines; this is 467 over it, 1.93× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 926 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: SmaliDebugger (83-1383). The bar is 500 significant lines; this is 426 over it, 1.85× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: smali/Smali.java jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java — FileTooLong — 800 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: Smali (73-1085). The bar is 500 significant lines; this is 300 over it, 1.60× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: xmlgen/XMLChar.java jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java — FileTooLong — 758 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: XMLChar (43-1071). The bar is 500 significant lines; this is 258 over it, 1.52× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: tab/TabbedPane.java jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java — FileTooLong — 697 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: TabbedPane (64-990). The bar is 500 significant lines; this is 197 over it, 1.39× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: cli/JadxCLIArgs.java jadx-cli/src/main/java/jadx/cli/JadxCLIArgs.java — FileTooLong — 684 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: JadxCLIArgs (47-1089). The bar is 500 significant lines; this is 184 over it, 1.37× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: typeinference/FixTypesVisitor.java jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java — FileTooLong — 665 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: FixTypesVisitor (62-967). The bar is 500 significant lines; this is 165 over it, 1.33× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: dialog/SearchDialog.java jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java — FileTooLong — 650 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: SearchDialog (98-878). The bar is 500 significant lines; this is 150 over it, 1.30× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: ui/JadxSettingsWindow.java jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java — FileTooLong — 629 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: JadxSettingsWindow (84-845). The bar is 500 significant lines; this is 129 over it, 1.26× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: nodes/ClassNode.java jadx-core/src/main/java/jadx/core/dex/nodes/ClassNode.java — FileTooLong — 619 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: ClassNode (59-1035). The bar is 500 significant lines; this is 119 over it, 1.24× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: args/ArgType.java jadx-core/src/main/java/jadx/core/dex/instructions/args/ArgType.java — FileTooLong — 599 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: ArgType (24-951). The bar is 500 significant lines; this is 99 over it, 1.20× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: blocks/BlockProcessor.java jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java — FileTooLong — 571 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: BlockProcessor (40-878). The bar is 500 significant lines; this is 71 over it, 1.14× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: visitors/EnumVisitor.java jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java — FileTooLong — 569 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: EnumVisitor (75-808). The bar is 500 significant lines; this is 69 over it, 1.14× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: instructions/InsnDecoder.java jadx-core/src/main/java/jadx/core/dex/instructions/InsnDecoder.java — FileTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: InsnDecoder (35-697). The bar is 500 significant lines; this is 29 over it, 1.06× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: nodes/RootNode.java jadx-core/src/main/java/jadx/core/dex/nodes/RootNode.java — FileTooLong — 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: RootNode (70-796). The bar is 500 significant lines; this is 15 over it, 1.03× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: api/JadxArgs.java jadx-core/src/main/java/jadx/api/JadxArgs.java — FileTooLong — 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: JadxArgs (49-930). The bar is 500 significant lines; this is 9 over it, 1.02× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: nodes/MethodNode.java jadx-core/src/main/java/jadx/core/dex/nodes/MethodNode.java — FileTooLong — 508 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: MethodNode (51-815). The bar is 500 significant lines; this is 8 over it, 1.02× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×15
  • Duplicated block (6 lines × 2) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:871 — jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:871-876 | jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:879-884 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (6 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:363 — jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:363-368 | jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:416-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 `jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:363` 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) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugSettings.java:82 — jadx-gui/src/main/java/jadx/gui/device/debugger/DebugSettings.java:82-87 | jadx-gui/src/main/java/jadx/gui/device/debugger/DebugSettings.java:107-112 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/device/debugger/DebugSettings.java:82` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/action/ViewCallGraphAction.java:32 — jadx-gui/src/main/java/jadx/gui/ui/action/ViewCallGraphAction.java:32-37 | jadx-gui/src/main/java/jadx/gui/ui/action/ViewControlFlowGraphAction.java:32-40 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/ui/action/ViewCallGraphAction.java:32` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.java:45 — jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.java:45-50 | jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassMethodGraphAction.java:45-50 — 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 `jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.java:45` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/popupmenu/JClassPopupMenu.java:44 — jadx-gui/src/main/java/jadx/gui/ui/popupmenu/JClassPopupMenu.java:44-49 | jadx-gui/src/main/java/jadx/gui/ui/popupmenu/JPackagePopupMenu.java:85-90 — 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 `jadx-gui/src/main/java/jadx/gui/ui/popupmenu/JClassPopupMenu.java:44` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (6 lines × 2) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/JavaFieldData.java:64 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/JavaFieldData.java:64-69 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/JavaMethodData.java:64-69 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/AttributesReader.java:50 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/AttributesReader.java:50-55 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/AttributesReader.java:77-82 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/AttributesReader.java:50` 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) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/debuginfo/LocalVarTypesAttr.java:22 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/debuginfo/LocalVarTypesAttr.java:22-27 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/debuginfo/LocalVarsAttr.java:22-27 — 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 `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/debuginfo/LocalVarTypesAttr.java:22` 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) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:173 — jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:173-178 | jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeInferenceVisitor.java:157-162 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) jadx-core/src/main/java/jadx/core/utils/Utils.java:53 — jadx-core/src/main/java/jadx/core/utils/Utils.java:53-58 | jadx-gui/src/main/java/jadx/gui/plugins/quark/QuarkReportPanel.java:300-305 — 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 (6 lines × 2) jadx-plugins/jadx-raung-input/src/main/java/jadx/plugins/input/raung/RaungConvert.java:43 — jadx-plugins/jadx-raung-input/src/main/java/jadx/plugins/input/raung/RaungConvert.java:43-48 | jadx-plugins/jadx-smali-input/src/main/java/jadx/plugins/input/smali/SmaliConvert.java:85-90 — 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 (6 lines × 2) jadx-core/src/main/java/jadx/core/export/gen/AndroidGradleGenerator.java:183 — jadx-core/src/main/java/jadx/core/export/gen/AndroidGradleGenerator.java:183-188 | jadx-core/src/main/java/jadx/core/export/gen/SimpleJavaGradleGenerator.java:59-64 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) jadx-gui/src/main/java/jadx/gui/treemodel/JInputFile.java:61 — jadx-gui/src/main/java/jadx/gui/treemodel/JInputFile.java:61-66 | jadx-gui/src/main/java/jadx/gui/treemodel/JInputSmaliFile.java:98-103 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:303 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:303-308 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:321-326 — 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 `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:303` 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, `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:329` calls `peekFrom` and `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:311` 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 × 2) · ×14
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:304 — jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:304-311 | jadx-core/src/main/java/jadx/core/dex/visitors/PrepareForCodeGen.java:343-350 — 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 `jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:304` 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) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:454 — jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:454-461 | jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:757-764 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:188 — jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:188-195 | jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:197-204 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:493 — jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:493-500 | jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/ResXmlProtoParser.java:209-216 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (8 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:164 — jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:164-171 | jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:199-206 — 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 (8 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:406 — jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:406-413 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:201-208 — 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) jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:265 — jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:265-272 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:88-95 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:97` calls `try`, `Formatter`, `StringBuilder` and `jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:274` 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 (8 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:151 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:151-158 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:273-280 — 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 `jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:151` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphExportDot.java:79 — jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphExportDot.java:79-86 | jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphExportJson.java:73-80 — 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) jadx-core/src/main/java/jadx/core/dex/instructions/PhiInsn.java:83 — jadx-core/src/main/java/jadx/core/dex/instructions/PhiInsn.java:83-90 | jadx-core/src/main/java/jadx/core/dex/nodes/InsnNode.java:148-155 — 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 (8 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonDialog.java:39 — jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonDialog.java:39-46 | jadx-gui/src/main/java/jadx/gui/ui/graphs/GraphDialog.java:158-165 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/AttachCommentsVisitor.java:48 — jadx-core/src/main/java/jadx/core/dex/visitors/AttachCommentsVisitor.java:48-55 | jadx-core/src/main/java/jadx/core/dex/visitors/rename/CodeRenameVisitor.java:48-55 — 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 (8 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/handlers/MergePathActivePathTraverserHandler.java:30 — jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/handlers/MergePathActivePathTraverserHandler.java:30-37 | jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/visitors/comparator/InstructionBlockComparatorTraverserVisitor.java:111-118 — 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 (8 lines × 2) jadx-gui/src/main/java/jadx/gui/plugins/mappings/JInputMapping.java:61 — jadx-gui/src/main/java/jadx/gui/plugins/mappings/JInputMapping.java:61-68 | jadx-gui/src/main/java/jadx/gui/treemodel/JInputSmaliFile.java:63-70 — 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 (9 lines × 2) · ×13
  • Duplicated block (9 lines × 2) jadx-core/src/main/java/jadx/core/dex/instructions/InvokeCustomRawNode.java:87 — jadx-core/src/main/java/jadx/core/dex/instructions/InvokeCustomRawNode.java:87-95 | jadx-core/src/main/java/jadx/core/dex/instructions/InvokePolymorphicNode.java:54-62 — 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 (9 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:270 — jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:270-278 | jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:782-790 — 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 (9 lines × 2) jadx-core/src/main/java/jadx/core/utils/ListUtils.java:73 — jadx-core/src/main/java/jadx/core/utils/ListUtils.java:73-81 | jadx-core/src/main/java/jadx/core/utils/Utils.java:347-355 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (9 lines × 2) jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:157 — jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:157-165 | jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:168-176 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (9 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:1000 — jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:1000-1008 | jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:1027-1035 — 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 `jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:1000` 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 × 2) jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1069 — jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1069-1077 | jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1100-1108 — 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 `jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1069` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1258 — jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1258-1266 | jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1340-1348 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:218 — jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:218-226 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:600-608 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:214` calls `JButton`, `str`, `addActionListener` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:597` 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 (9 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:116 — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:116-124 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:433-441 — before extracting anything, compare `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:116` 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 (9 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:246 — jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:246-254 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:144-152 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:239` calls `addNode` and `jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:143` 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 (9 lines × 2) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:37 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:37-45 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/TableSwitchDecoder.java:39-47 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/decoders/LookupSwitchDecoder.java:37` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphExportDot.java:35 — jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphExportDot.java:35-43 | jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphExportJson.java:40-48 — 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 (9 lines × 2) jadx-core/src/main/java/jadx/core/plugins/PluginContext.java:176 — jadx-core/src/main/java/jadx/core/plugins/PluginContext.java:176-184 | jadx-core/src/main/java/jadx/core/plugins/PluginRuntime.java:121-129 — 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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×13
  • Duplicated block (5 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/DeboxingVisitor.java:66 — jadx-core/src/main/java/jadx/core/dex/visitors/DeboxingVisitor.java:66-70 | jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockSplitter.java:340-344 — 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 `jadx-core/src/main/java/jadx/core/dex/visitors/DeboxingVisitor.java:66` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockSplitter.java:340 — jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockSplitter.java:340-344 | jadx-core/src/main/java/jadx/core/utils/InsnUtils.java:145-149 — 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 `jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockSplitter.java: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.
  • Duplicated block (5 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/ResTableBinaryParser.java:561 — jadx-core/src/main/java/jadx/core/xmlgen/ResTableBinaryParser.java:561-567 | jadx-core/src/main/java/jadx/core/xmlgen/ResTableBinaryParser.java:570-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 (5 lines × 2) jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:166 — jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:166-170 | jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:231-235 — 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 `jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:166` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) jadx-gui/src/main/java/jadx/gui/settings/ui/cache/CacheSettingsGroup.java:85 — jadx-gui/src/main/java/jadx/gui/settings/ui/cache/CacheSettingsGroup.java:85-89 | jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/PluginSettingsGroup.java:200-204 — 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) jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:180 — jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:180-185 | jadx-gui/src/main/java/jadx/gui/ui/dialog/SetValueDialog.java:84-88 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/dialog/SetValueDialog.java:90` calls `setTitle`, `str` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:187` 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 (5 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:207 — jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:207-211 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:591-595 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (5 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/state/AwaitingInsnCompareTraverserState.java:46 — jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/state/AwaitingInsnCompareTraverserState.java:46-50 | jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/state/NewBlockTraverserState.java:69-73 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) jadx-gui/src/main/java/jadx/gui/cache/code/disk/adapters/FieldNodeAdapter.java:20 — jadx-gui/src/main/java/jadx/gui/cache/code/disk/adapters/FieldNodeAdapter.java:20-24 | jadx-gui/src/main/java/jadx/gui/cache/code/disk/adapters/MethodNodeAdapter.java:19-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `FieldNode` in one and `MethodNode` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (5 lines × 2) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:576 — jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:576-580 | jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:584-588 — 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) jadx-gui/src/main/java/jadx/gui/search/providers/CodeSearchProvider.java:81 — jadx-gui/src/main/java/jadx/gui/search/providers/CodeSearchProvider.java:81-85 | jadx-gui/src/main/java/jadx/gui/search/providers/ResourceSearchProvider.java:97-101 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-gui/src/main/java/jadx/gui/search/providers/ResourceSearchProvider.java:96` calls `getContentType` and `jadx-gui/src/main/java/jadx/gui/search/providers/CodeSearchProvider.java:80` 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 × 2) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:196 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:196-200 | jadx-gui/src/main/java/jadx/gui/ui/dialog/RenameDialog.java:134-138 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:201` calls `add` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/RenameDialog.java:139` 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 (5 lines × 2) jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/KotlinMetadataExt.kt:37 — jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/KotlinMetadataExt.kt:37-41 | jadx-plugins/jadx-kotlin-source-debug-extension/src/main/kotlin/jadx/plugins/kotlin/smap/utils/Extensions.kt:20-24 — 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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×10
  • Duplicated block (10 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:146 — jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:146-155 | jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeInferenceVisitor.java:134-143 — 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 `jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:146` 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) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:566 — jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:566-575 | jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:598-607 — 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 `jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:566` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:79 — jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:79-88 | jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:94-103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:156 — jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:156-165 | jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:194-203 — 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 `jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:156` 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, `jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:192` calls `getOrElse`, `getCurrentDir`, `setSelectedFile` and `jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:155` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (10 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1052 — jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1052-1061 | jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1083-1092 — 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 `jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1052` 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) jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:182 — jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:182-191 | jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:213-222 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:182` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/MethodsDialog.java:81 — jadx-gui/src/main/java/jadx/gui/ui/dialog/MethodsDialog.java:81-90 | jadx-gui/src/main/java/jadx/gui/ui/export/ExportProjectDialog.java:159-168 — 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 `jadx-gui/src/main/java/jadx/gui/ui/dialog/MethodsDialog.java:81` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (10 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/popupmenu/VarTreePopupMenu.java:68 — jadx-gui/src/main/java/jadx/gui/ui/popupmenu/VarTreePopupMenu.java:68-77 | jadx-gui/src/main/java/jadx/gui/ui/popupmenu/VarTreePopupMenu.java:83-92 — 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 `jadx-gui/src/main/java/jadx/gui/ui/popupmenu/VarTreePopupMenu.java:68` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/AttachCommentsVisitor.java:120 — jadx-core/src/main/java/jadx/core/dex/visitors/AttachCommentsVisitor.java:120-129 | jadx-core/src/main/java/jadx/core/dex/visitors/rename/CodeRenameVisitor.java:105-114 — 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 (10 lines × 2) jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/KotlinMetadataUtils.kt:29 — jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/KotlinMetadataUtils.kt:29-38 | jadx-plugins/jadx-kotlin-source-debug-extension/src/main/kotlin/jadx/plugins/kotlin/smap/utils/KotlinSmapUtils.kt:26-35 — 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×10
  • Swallowed exception (caught, then discarded) jadx-core/src/main/java/jadx/core/dex/visitors/FixSwitchOverEnum.java:141 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-core/src/main/java/jadx/core/utils/Utils.java:682 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-core/src/main/java/jadx/core/utils/Utils.java:693 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:190 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-gui/src/main/java/jadx/gui/plugins/quark/QuarkManager.java:223 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-gui/src/main/java/jadx/gui/ui/filedialog/CustomFileChooser.java:165 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-plugins-tools/src/main/java/jadx/plugins/tools/JadxPluginsList.java:94 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-plugins-tools/src/main/java/jadx/plugins/tools/resolvers/github/GithubTools.java:121 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmUtils.kt:19 — `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/RenameMappingsPlugin.java:53 — `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D3 · God Classes · MethodTooLong · ×8
  • MethodTooLong: InsnDecoder.decode jadx-core/src/main/java/jadx/core/dex/instructions/InsnDecoder.java:68 — MethodTooLong — decode runs 351 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 251 over it, 3.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: EntryConfig.generateQualifiers jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:153 — MethodTooLong — generateQualifiers runs 227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 127 over it, 2.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: MainWindow.initMenuAndToolbar jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1124 — MethodTooLong — initMenuAndToolbar runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25× 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: JadxSettingsWindow.makeDecompilationGroup jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:488 — MethodTooLong — makeDecompilationGroup runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50× 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: SearchDialog.initUI jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:258 — MethodTooLong — initUI runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× 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: UsageDialogPlus.<init> jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:102 — MethodTooLong — <init> runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: MainWindow.initUI jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1393 — MethodTooLong — initUI runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× 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: MappingExporter.exportMappings jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java:57 — MethodTooLong — exportMappings runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
X3 · Exception handling · Swallowed exception (empty catch) · ×5
  • Swallowed exception (empty catch) jadx-cli/src/main/java/jadx/cli/JCommanderWrapper.java:268 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) jadx-core/src/main/java/jadx/core/deobf/FileTypeDetector.java:107 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:351 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:363 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) jadx-plugins-tools/src/main/java/jadx/plugins/tools/JadxExternalPluginsLoader.java:173 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `close()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch.
D15 · Churn × Complexity Hotspots · Repeated repair · ×4
  • Repeated repair: jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1884 — jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is MainWindow.checkIfCodeHasNonPrintableChars at line 1884), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(cli): accept documented values for --mappings-mode (PR #3001)”; “fix: resolve remaining global plugin issues (PR #2987)”; “fix(gui): add missing vertical scrollbar in Quick Tabs pane (PR #2981)”; “fix(gui): handle unopened projects in reopen (PR #2958)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 22:10:03 +00:00' --until='2026-10-14 22:10:03 +00:00' --full-history --no-merges -- jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:217 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is JadxSettingsWindow.activatePage at line 217), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(gui): discard unsaved preferences when the window is closed with X (PR #2996)”; “fix: resolve remaining global plugin issues (PR #2987)”; “fix(gui): handle unopened projects in reopen (PR #2958)”; “fix(gui): avoid project reload when saving settings on start page (PR #2943)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 22:10:03 +00:00' --until='2026-10-14 22:10:03 +00:00' --full-history --no-merges -- jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: jadx-gui/src/main/java/jadx/gui/plugins/GuiPluginsManager.java jadx-gui/src/main/java/jadx/gui/plugins/GuiPluginsManager.java:137 — jadx-gui/src/main/java/jadx/gui/plugins/GuiPluginsManager.java changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is GuiPluginsManager.runGlobalInit at line 137), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: resolve remaining global plugin issues (PR #2987)”; “fix(gui): skip global plugins whose global init failed (PR #2974)”; “fix(gui): show global plugins in plugin settings without a project (PR #2972)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 22:10:03 +00:00' --until='2026-10-14 22:10:03 +00:00' --full-history --no-merges -- jadx-gui/src/main/java/jadx/gui/plugins/GuiPluginsManager.java`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/PluginSettings.java jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/PluginSettings.java:161 — jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/PluginSettings.java changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is PluginSettings.addOptions at line 161), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: resolve remaining global plugin issues (PR #2987)”; “fix(gui): keep shared temp files when opening plugin settings (PR #2973)”; “fix(gui): show global plugins in plugin settings without a project (PR #2972)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 22:10:03 +00:00' --until='2026-10-14 22:10:03 +00:00' --full-history --no-merges -- jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/PluginSettings.java`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×4
  • Duplicated block (11 lines × 2) jadx-core/src/main/java/jadx/api/plugins/utils/Utils.java:35 — jadx-core/src/main/java/jadx/api/plugins/utils/Utils.java:35-45 | jadx-core/src/main/java/jadx/api/plugins/utils/Utils.java:53-63 — 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 (11 lines × 2) jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:117 — jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:117-127 | jadx-core/src/main/java/jadx/core/dex/nodes/IMethodDetails.java:41-51 — 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 (11 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.java:33 — jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.java:33-43 | jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassMethodGraphAction.java:33-43 — 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 `jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.java:33` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/DexFileLoader.java:158 — jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/DexFileLoader.java:158-168 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/JavaInputLoader.java:157-167 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×4
  • Duplicated block (6 lines × 3) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:320 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:320-325 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:373-378 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:744-749 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:320` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 3) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:377 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:377-382 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:683-688 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:753-758 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:377` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (6 lines × 3) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:373 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:373-378 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:442-447 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:744-749 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:373` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 3) jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:94 — jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:94-99 | jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:129-134 | jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:255-260 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java: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.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×3
  • Duplicated block (13 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:478 — jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:478-490 | jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/ResXmlProtoParser.java:194-206 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (13 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:116 — jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:116-128 | jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:133-145 — 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 `jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:116` 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 (13 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:126 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:126-138 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:233-245 — 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 `jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:126` 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 (12 lines × 2) · ×3
  • Duplicated block (12 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:164 — jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:164-175 | jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:216-227 — 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 `jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:164` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:817 — jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:817-828 | jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:835-846 — 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 `jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:817` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomResourcesLoader.kt:23 — jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomResourcesLoader.kt:23-34 | jadx-plugins/jadx-apks-input/src/main/kotlin/jadx/plugins/input/apks/ApksCustomResourcesLoader.kt:19-30 — before extracting anything, compare `jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomResourcesLoader.kt` and `jadx-plugins/jadx-apks-input/src/main/kotlin/jadx/plugins/input/apks/ApksCustomResourcesLoader.kt` as WHOLE FILES: 88% 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. 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 `jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomResourcesLoader.kt:23` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomResourcesLoader.kt:19` calls `getManifest`, `isSupported` and `jadx-plugins/jadx-apks-input/src/main/kotlin/jadx/plugins/input/apks/ApksCustomResourcesLoader.kt:16` 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.
D10 · Test Quality · No assertions · ×2
  • No assertions: test jadx-core/src/test/java/jadx/tests/integration/conditions/TestTernaryInIf3.java:10 — This method's body runs code, and no assertion was recognised in it. Recognised: JUnit's assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5's list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito's verify and the `assert` statement, in the test body and in helper methods of the test's own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: verifyLocales jadx-gui/src/test/java/jadx/gui/TestI18n.java:51 — This method's body runs code, and no assertion was recognised in it. Recognised: JUnit's assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5's list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito's verify and the `assert` statement, in the test body and in helper methods of the test's own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2
  • Duplicated block (16 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/SearchBar.java:49 — jadx-gui/src/main/java/jadx/gui/ui/codearea/SearchBar.java:49-64 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexSearchBar.java:53-68 — 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 `jadx-gui/src/main/java/jadx/gui/ui/codearea/SearchBar.java:49` 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 (16 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:148 — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:148-163 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:465-480 — before extracting anything, compare `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:148` 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 × 2) · ×2
  • Duplicated block (15 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:172 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:172-186 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:197-211 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) jadx-core/src/main/java/jadx/core/utils/exceptions/CodegenException.java:10 — jadx-core/src/main/java/jadx/core/utils/exceptions/CodegenException.java:10-32 | jadx-core/src/main/java/jadx/core/utils/exceptions/DecodeException.java:9-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×2
  • Duplicated block (11–12 lines × 2) jadx-core/src/main/java/jadx/core/Jadx.java:124 — jadx-core/src/main/java/jadx/core/Jadx.java:124-135 | jadx-core/src/main/java/jadx/core/Jadx.java:219-229 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-core/src/main/java/jadx/core/Jadx.java:136` calls `add`, `BlockProcessor`, `BlockFinisher` and `jadx-core/src/main/java/jadx/core/Jadx.java:230` 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–12 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/CommentDialog.java:159 — jadx-gui/src/main/java/jadx/gui/ui/dialog/CommentDialog.java:159-169 | jadx-gui/src/main/java/jadx/gui/ui/export/ExportProjectDialog.java:102-113 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/export/ExportProjectDialog.java:113` calls `setAlignmentX` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/CommentDialog.java:169` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×2
  • Duplicated block (10–11 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:181 — jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:181-191 | jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java:92-101 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (10–11 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:72 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:72-82 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:100-109 — 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 `jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:72` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×2
  • Duplicated block (6–7 lines × 2) jadx-core/src/main/java/jadx/api/plugins/options/impl/BaseOptionsParser.java:31 — jadx-core/src/main/java/jadx/api/plugins/options/impl/BaseOptionsParser.java:31-37 | jadx-core/src/main/java/jadx/api/plugins/options/impl/BasePluginOptionsBuilder.java:116-121 — 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 `jadx-core/src/main/java/jadx/api/plugins/options/impl/BaseOptionsParser.java:31` 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 (6–7 lines × 2) jadx-gui/src/main/java/jadx/gui/settings/TabStateViewAdapter.java:40 — jadx-gui/src/main/java/jadx/gui/settings/TabStateViewAdapter.java:40-46 | jadx-gui/src/main/java/jadx/gui/settings/TabStateViewAdapter.java:58-63 — 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 `jadx-gui/src/main/java/jadx/gui/settings/TabStateViewAdapter.java:40` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. 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 × 3) · ×2
  • Duplicated block (5 lines × 3) jadx-gui/src/main/java/jadx/gui/report/ExceptionDialog.java:114 — jadx-gui/src/main/java/jadx/gui/report/ExceptionDialog.java:114-118 | jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:412-416 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:207-211 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
  • Duplicated block (5 lines × 3) jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:98 — jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:98-102 | jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:104-108 | jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:110-114 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:110` 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 (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:61 — jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:61-77 | jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:87-103 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:78` calls `getStyle` and `jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:104` 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 (17 lines × 2) jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomCodeInput.kt:26 — jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomCodeInput.kt:26-42 | jadx-plugins/jadx-apks-input/src/main/kotlin/jadx/plugins/input/apks/ApksCustomCodeInput.kt:21-37 — before extracting anything, compare `jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomCodeInput.kt` and `jadx-plugins/jadx-apks-input/src/main/kotlin/jadx/plugins/input/apks/ApksCustomCodeInput.kt` as WHOLE FILES: 88% 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. 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 `jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomCodeInput.kt:26` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-plugins/jadx-apkm-input/src/main/kotlin/jadx/plugins/input/apkm/ApkmCustomCodeInput.kt:22` calls `getManifest`, `isSupported` and `jadx-plugins/jadx-apks-input/src/main/kotlin/jadx/plugins/input/apks/ApksCustomCodeInput.kt:18` 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.
D5 · Coupling · Off the main sequence · ×2
  • Off the main sequence: :jadx-plugins:jadx-dex-input — :jadx-plugins:jadx-dex-input: abstractness 0.04, instability 0.14, distance 0.81 — zone of pain — concrete and depended on by 6 project(s), so it's rigid to change.
  • Off the main sequence: :jadx-core — :jadx-core: abstractness 0.18, instability 0.11, distance 0.72 — zone of pain — concrete and depended on by 17 project(s), so it's rigid to change.
D6 · Cohesion (LCOM4) · Low cohesion · ×2
  • Low cohesion: InfoStorage (LCOM4 4) jadx-core/src/main/java/jadx/core/dex/info/InfoStorage.java:10 — InfoStorage's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: ProtoValue (LCOM4 4) jadx-core/src/main/java/jadx/core/xmlgen/entry/ProtoValue.java:5 — ProtoValue's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
IC1 · Incompleteness & stubs · Unfinished stub · ×2
  • Unfinished stub — throws a "not implemented" exception jadx-gui/src/main/java/jadx/gui/cache/usage/UsageData.java:79 — `visitUsageData` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
  • Unfinished stub — throws a "not implemented" exception jadx-gui/src/main/java/jadx/gui/ui/hexviewer/LazyLoadingBinaryData.java:115 — `copy` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
D1 · Cyclomatic Complexity · EntryConfig.generateQualifiers (cyclomatic 75) · ×1
  • EntryConfig.generateQualifiers (cyclomatic 75) jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:153 — EntryConfig.generateQualifiers has cyclomatic complexity 75 (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 · InsnGen.makeInsnBody (cyclomatic 68) · ×1
  • InsnGen.makeInsnBody (cyclomatic 68) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:314 — InsnGen.makeInsnBody has cyclomatic complexity 68 (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 · MappingExporter.exportMappings (cyclomatic 35) · ×1
  • MappingExporter.exportMappings (cyclomatic 35) jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java:57 — MappingExporter.exportMappings 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 · SwitchOverStringVisitor.collectPart1RegionCases (cyclomatic 35) · ×1
  • SwitchOverStringVisitor.collectPart1RegionCases (cyclomatic 35) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:129 — SwitchOverStringVisitor.collectPart1RegionCases 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 · TypeCompare.compareObjectsNoPreCheck (cyclomatic 31) · ×1
  • TypeCompare.compareObjectsNoPreCheck (cyclomatic 31) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeCompare.java:161 — TypeCompare.compareObjectsNoPreCheck 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 · AccessInfo.makeString (cyclomatic 27) · ×1
  • AccessInfo.makeString (cyclomatic 27) jadx-core/src/main/java/jadx/core/dex/info/AccessInfo.java:175 — AccessInfo.makeString 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 · LoopRegionVisitor.checkArrayForEach (cyclomatic 27) · ×1
  • LoopRegionVisitor.checkArrayForEach (cyclomatic 27) jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java:146 — LoopRegionVisitor.checkArrayForEach has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · TryEdgeScopeGroupMap.getScopeEnds (cyclomatic 26) · ×1
  • TryEdgeScopeGroupMap.getScopeEnds (cyclomatic 26) jadx-core/src/main/java/jadx/core/dex/trycatch/TryEdgeScopeGroupMap.java:134 — TryEdgeScopeGroupMap.getScopeEnds 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 · IfRegionVisitor.orderBranches (cyclomatic 26) · ×1
  • IfRegionVisitor.orderBranches (cyclomatic 26) jadx-core/src/main/java/jadx/core/dex/visitors/regions/IfRegionVisitor.java:62 — IfRegionVisitor.orderBranches 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 · CodeShrinkVisitor.checkInline (cyclomatic 26) · ×1
  • CodeShrinkVisitor.checkInline (cyclomatic 26) jadx-core/src/main/java/jadx/core/dex/visitors/shrink/CodeShrinkVisitor.java:78 — CodeShrinkVisitor.checkInline 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 · LoopRegionMaker.process (cyclomatic 25) · ×1
  • LoopRegionMaker.process (cyclomatic 25) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:61 — LoopRegionMaker.process 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 · LoopRegionVisitor.checkIterableForEach (cyclomatic 25) · ×1
  • LoopRegionVisitor.checkIterableForEach (cyclomatic 25) jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java:246 — LoopRegionVisitor.checkIterableForEach 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 · ReplaceNewArray.processNewArray (cyclomatic 25) · ×1
  • ReplaceNewArray.processNewArray (cyclomatic 25) jadx-core/src/main/java/jadx/core/dex/visitors/ReplaceNewArray.java:77 — ReplaceNewArray.processNewArray 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 · BinarySearchServiceImpl.searchForText (cyclomatic 24) · ×1
  • BinarySearchServiceImpl.searchForText (cyclomatic 24) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:163 — BinarySearchServiceImpl.searchForText 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 · TryCatchBlockAttr.exploreTryPath (cyclomatic 24) · ×1
  • TryCatchBlockAttr.exploreTryPath (cyclomatic 24) jadx-core/src/main/java/jadx/core/dex/trycatch/TryCatchBlockAttr.java:206 — TryCatchBlockAttr.exploreTryPath 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 · BlockExceptionHandler.wrapBlocksWithTryCatch (cyclomatic 24) · ×1
  • BlockExceptionHandler.wrapBlocksWithTryCatch (cyclomatic 24) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockExceptionHandler.java:328 — BlockExceptionHandler.wrapBlocksWithTryCatch 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 · IfRegionMaker.mergeNestedIfNodes (cyclomatic 24) · ×1
  • IfRegionMaker.mergeNestedIfNodes (cyclomatic 24) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:398 — IfRegionMaker.mergeNestedIfNodes 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 · TypeUpdate.verifyType (cyclomatic 24) · ×1
  • TypeUpdate.verifyType (cyclomatic 24) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeUpdate.java:203 — TypeUpdate.verifyType 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 · AnnotationGen.encodeValue (cyclomatic 23) · ×1
  • AnnotationGen.encodeValue (cyclomatic 23) jadx-core/src/main/java/jadx/core/codegen/AnnotationGen.java:144 — AnnotationGen.encodeValue has cyclomatic complexity 23 (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 · InsnNode.canReorder (cyclomatic 23) · ×1
  • InsnNode.canReorder (cyclomatic 23) jadx-core/src/main/java/jadx/core/dex/nodes/InsnNode.java:244 — InsnNode.canReorder has cyclomatic complexity 23 (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 · ValuesParser.decodeValue (cyclomatic 23) · ×1
  • ValuesParser.decodeValue (cyclomatic 23) jadx-core/src/main/java/jadx/core/xmlgen/entry/ValuesParser.java:84 — ValuesParser.decodeValue has cyclomatic complexity 23 (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 · AccessFlags.format (cyclomatic 22) · ×1
  • AccessFlags.format (cyclomatic 22) jadx-plugins/jadx-input-api/src/main/java/jadx/api/plugins/input/data/AccessFlags.java:31 — AccessFlags.format 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 · DebugController.decodeRuntimeValue (cyclomatic 22) · ×1
  • DebugController.decodeRuntimeValue (cyclomatic 22) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:730 — DebugController.decodeRuntimeValue has cyclomatic complexity 22 (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 · MethodUtils.processMethodArgsOverloaded (cyclomatic 22) · ×1
  • MethodUtils.processMethodArgsOverloaded (cyclomatic 22) jadx-core/src/main/java/jadx/core/dex/nodes/utils/MethodUtils.java:98 — MethodUtils.processMethodArgsOverloaded 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 · ResXmlGen.addValue (cyclomatic 22) · ×1
  • ResXmlGen.addValue (cyclomatic 22) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:85 — ResXmlGen.addValue 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 · SmaliDebugger.decodeCompositeEvents (cyclomatic 21) · ×1
  • SmaliDebugger.decodeCompositeEvents (cyclomatic 21) REDACTED:758 — SmaliDebugger.decodeCompositeEvents 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 · TypeGen.literalToString (cyclomatic 21) · ×1
  • TypeGen.literalToString (cyclomatic 21) jadx-core/src/main/java/jadx/core/codegen/TypeGen.java:58 — TypeGen.literalToString 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 · IfCondition.simplify (cyclomatic 21) · ×1
  • IfCondition.simplify (cyclomatic 21) jadx-core/src/main/java/jadx/core/dex/regions/conditions/IfCondition.java:152 — IfCondition.simplify 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 · LoopRegionMaker.makeEndlessLoop (cyclomatic 21) · ×1
  • LoopRegionMaker.makeEndlessLoop (cyclomatic 21) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:527 — LoopRegionMaker.makeEndlessLoop 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 · SwitchRegionMaker.calcSwitchOut (cyclomatic 21) · ×1
  • SwitchRegionMaker.calcSwitchOut (cyclomatic 21) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/SwitchRegionMaker.java:146 — SwitchRegionMaker.calcSwitchOut 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 · TernaryMod.makeTernaryInsn (cyclomatic 21) · ×1
  • TernaryMod.makeTernaryInsn (cyclomatic 21) jadx-core/src/main/java/jadx/core/dex/visitors/regions/TernaryMod.java:72 — TernaryMod.makeTernaryInsn 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 · CommandPlugins.process (cyclomatic 21) · ×1
  • CommandPlugins.process (cyclomatic 21) jadx-cli/src/main/java/jadx/cli/commands/CommandPlugins.java:69 — CommandPlugins.process 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 · DebugInfoParser.process (cyclomatic 20) · ×1
  • DebugInfoParser.process (cyclomatic 20) jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/sections/debuginfo/DebugInfoParser.java:83 — DebugInfoParser.process has cyclomatic complexity 20 (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 · CommonProtoParser.parse (cyclomatic 20) · ×1
  • CommonProtoParser.parse (cyclomatic 20) jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/CommonProtoParser.java:129 — CommonProtoParser.parse has cyclomatic complexity 20 (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 · IfCondition.simplifyCmpOp (cyclomatic 20) · ×1
  • IfCondition.simplifyCmpOp (cyclomatic 20) jadx-core/src/main/java/jadx/core/dex/regions/conditions/IfCondition.java:206 — IfCondition.simplifyCmpOp 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 · ModVisitor.replaceStep (cyclomatic 20) · ×1
  • ModVisitor.replaceStep (cyclomatic 20) jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:101 — ModVisitor.replaceStep has cyclomatic complexity 20 (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 · ProcessInstructionsVisitor.initJumps (cyclomatic 20) · ×1
  • ProcessInstructionsVisitor.initJumps (cyclomatic 20) jadx-core/src/main/java/jadx/core/dex/visitors/ProcessInstructionsVisitor.java:44 — ProcessInstructionsVisitor.initJumps 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 · DotGraphUtils.processBlock (cyclomatic 20) · ×1
  • DotGraphUtils.processBlock (cyclomatic 20) jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java:282 — DotGraphUtils.processBlock 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 · SMAPParser.parseStratum (cyclomatic 20) · ×1
  • SMAPParser.parseStratum (cyclomatic 20) jadx-plugins/jadx-kotlin-source-debug-extension/src/main/kotlin/jadx/plugins/kotlin/smap/utils/SMAPParser.kt:66 — SMAPParser.parseStratum has cyclomatic complexity 20 (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 · SearchDialog.buildSearch (cyclomatic 19) · ×1
  • SearchDialog.buildSearch (cyclomatic 19) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:618 — SearchDialog.buildSearch 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 · 2.mouseClicked (cyclomatic 19) · ×1
  • 2.mouseClicked (cyclomatic 19) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:191 — 2.mouseClicked 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 · TabbedPane.buildMenu (cyclomatic 19) · ×1
  • TabbedPane.buildMenu (cyclomatic 19) jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java:613 — TabbedPane.buildMenu 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 · TernaryMod.replaceWithTernary (cyclomatic 19) · ×1
  • TernaryMod.replaceWithTernary (cyclomatic 19) jadx-core/src/main/java/jadx/core/dex/visitors/regions/TernaryMod.java:291 — TernaryMod.replaceWithTernary 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 · CodeShrinkVisitor.canMoveBetweenBlocks (cyclomatic 19) · ×1
  • CodeShrinkVisitor.canMoveBetweenBlocks (cyclomatic 19) jadx-core/src/main/java/jadx/core/dex/visitors/shrink/CodeShrinkVisitor.java:225 — CodeShrinkVisitor.canMoveBetweenBlocks 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 · EnumVisitor.convertToEnum (cyclomatic 19) · ×1
  • EnumVisitor.convertToEnum (cyclomatic 19) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:118 — EnumVisitor.convertToEnum 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 · MethodThrowsVisitor.checkInsn (cyclomatic 19) · ×1
  • MethodThrowsVisitor.checkInsn (cyclomatic 19) jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java:139 — MethodThrowsVisitor.checkInsn 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 · DebugChecks.checkPHI (cyclomatic 19) · ×1
  • DebugChecks.checkPHI (cyclomatic 19) jadx-core/src/main/java/jadx/core/utils/DebugChecks.java:274 — DebugChecks.checkPHI 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 · ModifiedUTF8Decoder.decodeString (cyclomatic 18) · ×1
  • ModifiedUTF8Decoder.decodeString (cyclomatic 18) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/utils/ModifiedUTF8Decoder.java:7 — ModifiedUTF8Decoder.decodeString 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 · Smali.writeEncodedValue (cyclomatic 18) · ×1
  • Smali.writeEncodedValue (cyclomatic 18) jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java:600 — Smali.writeEncodedValue has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ConvertNumberAction.getConversionsFromWord (cyclomatic 18) · ×1
  • ConvertNumberAction.getConversionsFromWord (cyclomatic 18) jadx-gui/src/main/java/jadx/gui/ui/codearea/ConvertNumberAction.java:109 — ConvertNumberAction.getConversionsFromWord 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 · ClassGen.useClassInternal (cyclomatic 18) · ×1
  • ClassGen.useClassInternal (cyclomatic 18) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:704 — ClassGen.useClassInternal 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 · MethodGen.addDefinition (cyclomatic 18) · ×1
  • MethodGen.addDefinition (cyclomatic 18) jadx-core/src/main/java/jadx/core/codegen/MethodGen.java:81 — MethodGen.addDefinition 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 · SimpleModeHelper.prepareBlocks (cyclomatic 18) · ×1
  • SimpleModeHelper.prepareBlocks (cyclomatic 18) jadx-core/src/main/java/jadx/core/codegen/SimpleModeHelper.java:36 — SimpleModeHelper.prepareBlocks 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 · IfRegionMaker.process (cyclomatic 18) · ×1
  • IfRegionMaker.process (cyclomatic 18) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:59 — IfRegionMaker.process 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 · LoopRegionMaker.makeLoopRegion (cyclomatic 18) · ×1
  • LoopRegionMaker.makeLoopRegion (cyclomatic 18) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:187 — LoopRegionMaker.makeLoopRegion 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 · TypeCompare.compareTypes (cyclomatic 18) · ×1
  • TypeCompare.compareTypes (cyclomatic 18) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeCompare.java:61 — TypeCompare.compareTypes 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 · FallbackModeVisitor.visit (cyclomatic 18) · ×1
  • FallbackModeVisitor.visit (cyclomatic 18) jadx-core/src/main/java/jadx/core/dex/visitors/FallbackModeVisitor.java:21 — FallbackModeVisitor.visit has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ResXmlGen.addItem (cyclomatic 18) · ×1
  • ResXmlGen.addItem (cyclomatic 18) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:184 — ResXmlGen.addItem 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 · XposedAction.fixTypeContent (cyclomatic 18) · ×1
  • XposedAction.fixTypeContent (cyclomatic 18) jadx-gui/src/main/java/jadx/gui/ui/action/XposedAction.kt:88 — XposedAction.fixTypeContent has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · DexAnnotationsConvert.convertSystemAnnotations (cyclomatic 17) · ×1
  • DexAnnotationsConvert.convertSystemAnnotations (cyclomatic 17) jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/sections/DexAnnotationsConvert.java:55 — DexAnnotationsConvert.convertSystemAnnotations has cyclomatic complexity 17 (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 · IfRegionMaker.restructureIf (cyclomatic 17) · ×1
  • IfRegionMaker.restructureIf (cyclomatic 17) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:175 — IfRegionMaker.restructureIf 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 · SwitchOverStringVisitor.prepareMergedSwitchCases (cyclomatic 17) · ×1
  • SwitchOverStringVisitor.prepareMergedSwitchCases (cyclomatic 17) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:234 — SwitchOverStringVisitor.prepareMergedSwitchCases 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 · TraverserController.advance (cyclomatic 16) · ×1
  • TraverserController.advance (cyclomatic 16) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/TraverserController.java:100 — TraverserController.advance 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 · SwitchRegionMaker.allSameReturns (cyclomatic 16) · ×1
  • SwitchRegionMaker.allSameReturns (cyclomatic 16) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/SwitchRegionMaker.java:229 — SwitchRegionMaker.allSameReturns 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 · LoopRegionVisitor.checkForIndexedLoop (cyclomatic 16) · ×1
  • LoopRegionVisitor.checkForIndexedLoop (cyclomatic 16) jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java:87 — LoopRegionVisitor.checkForIndexedLoop has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · EnumVisitor.checkExternalRegUsage (cyclomatic 16) · ×1
  • EnumVisitor.checkExternalRegUsage (cyclomatic 16) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:528 — EnumVisitor.checkExternalRegUsage 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 · BlockUtils.getBottomBlock (cyclomatic 16) · ×1
  • BlockUtils.getBottomBlock (cyclomatic 16) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:891 — BlockUtils.getBottomBlock 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 · PassMerge.searchInsertPos (cyclomatic 16) · ×1
  • PassMerge.searchInsertPos (cyclomatic 16) jadx-core/src/main/java/jadx/core/utils/PassMerge.java:53 — PassMerge.searchInsertPos 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 · EntryConfig.<init> (cyclomatic 16) · ×1
  • EntryConfig.<init> (cyclomatic 16) jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:71 — EntryConfig.<init> 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.
D1 · Cyclomatic Complexity · BinaryXMLParser.parseElement (cyclomatic 16) · ×1
  • BinaryXMLParser.parseElement (cyclomatic 16) jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:227 — BinaryXMLParser.parseElement has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D17 · Explicit Debt · FixmeComment · ×1
  • FixmeComment jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:938 — // FIXME: add 'this' for equals methods in scope — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D2 · Cognitive Complexity · SwitchOverStringVisitor.collectPart1RegionCases (cognitive 78) · ×1
  • SwitchOverStringVisitor.collectPart1RegionCases (cognitive 78) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:129 — SwitchOverStringVisitor.collectPart1RegionCases has cognitive complexity 78 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 6 (18 pts), ternaries 4 (12 pts), boolean chains 11 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MappingExporter.exportMappings (cognitive 76) · ×1
  • MappingExporter.exportMappings (cognitive 76) jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java:57 — MappingExporter.exportMappings has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (51 pts), loops 7 (13 pts), ternaries 3 (7 pts), boolean chains 4, error handling 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TryCatchBlockAttr.exploreTryPath (cognitive 71) · ×1
  • TryCatchBlockAttr.exploreTryPath (cognitive 71) jadx-core/src/main/java/jadx/core/dex/trycatch/TryCatchBlockAttr.java:206 — TryCatchBlockAttr.exploreTryPath has cognitive complexity 71 (threshold 15). Drivers by points: if/else 17 (50 pts), loops 6 (19 pts), boolean chains 2 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MethodUtils.processMethodArgsOverloaded (cognitive 60) · ×1
  • MethodUtils.processMethodArgsOverloaded (cognitive 60) jadx-core/src/main/java/jadx/core/dex/nodes/utils/MethodUtils.java:98 — MethodUtils.processMethodArgsOverloaded has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (48 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 38). 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 · TryEdgeScopeGroupMap.getScopeEnds (cognitive 57) · ×1
  • TryEdgeScopeGroupMap.getScopeEnds (cognitive 57) jadx-core/src/main/java/jadx/core/dex/trycatch/TryEdgeScopeGroupMap.java:134 — TryEdgeScopeGroupMap.getScopeEnds has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 6 (11 pts), boolean chains 4 (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 · LoopRegionMaker.process (cognitive 56) · ×1
  • LoopRegionMaker.process (cognitive 56) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:61 — LoopRegionMaker.process has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 4 (14 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · TypeCompare.compareObjectsNoPreCheck (cognitive 55) · ×1
  • TypeCompare.compareObjectsNoPreCheck (cognitive 55) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeCompare.java:161 — TypeCompare.compareObjectsNoPreCheck has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 10, ternaries 2 (5 pts), loops 1 (4 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 · DebugChecks.checkPHI (cognitive 53) · ×1
  • DebugChecks.checkPHI (cognitive 53) jadx-core/src/main/java/jadx/core/utils/DebugChecks.java:274 — DebugChecks.checkPHI has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 6 (13 pts), boolean chains 2 (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 · InsnGen.makeInsnBody (cognitive 52) · ×1
  • InsnGen.makeInsnBody (cognitive 52) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:314 — InsnGen.makeInsnBody has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 7 (16 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 26). 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 · LoopRegionMaker.makeEndlessLoop (cognitive 51) · ×1
  • LoopRegionMaker.makeEndlessLoop (cognitive 51) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:527 — LoopRegionMaker.makeEndlessLoop has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 4 (12 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ResXmlGen.addValue (cognitive 51) · ×1
  • ResXmlGen.addValue (cognitive 51) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:85 — ResXmlGen.addValue has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 3 (10 pts), boolean chains 4 (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 · 2.mouseClicked (cognitive 50) · ×1
  • 2.mouseClicked (cognitive 50) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:191 — 2.mouseClicked has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · LoopRegionVisitor.checkIterableForEach (cognitive 50) · ×1
  • LoopRegionVisitor.checkIterableForEach (cognitive 50) jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java:246 — LoopRegionVisitor.checkIterableForEach has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 5, loops 2 (nesting depth added 22). 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 · TypeUpdate.verifyType (cognitive 49) · ×1
  • TypeUpdate.verifyType (cognitive 49) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeUpdate.java:203 — TypeUpdate.verifyType has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (45 pts), boolean chains 4 (nesting depth added 25). 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 · BinarySearchServiceImpl.searchForText (cognitive 47) · ×1
  • BinarySearchServiceImpl.searchForText (cognitive 47) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:163 — BinarySearchServiceImpl.searchForText has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts), error handling 1, ternaries 1 (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 · MethodThrowsVisitor.checkInsn (cognitive 47) · ×1
  • MethodThrowsVisitor.checkInsn (cognitive 47) jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java:139 — MethodThrowsVisitor.checkInsn has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 2 (10 pts), boolean chains 4 (nesting depth added 28). 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 · EntryConfig.generateQualifiers (cognitive 47) · ×1
  • EntryConfig.generateQualifiers (cognitive 47) jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:153 — EntryConfig.generateQualifiers has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 16, boolean chains 3 (nesting depth added 11). 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 · AccessInfo.makeString (cognitive 46) · ×1
  • AccessInfo.makeString (cognitive 46) jadx-core/src/main/java/jadx/core/dex/info/AccessInfo.java:175 — AccessInfo.makeString has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 2, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BlockExceptionHandler.wrapBlocksWithTryCatch (cognitive 42) · ×1
  • BlockExceptionHandler.wrapBlocksWithTryCatch (cognitive 42) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockExceptionHandler.java:328 — BlockExceptionHandler.wrapBlocksWithTryCatch has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 4 (8 pts), boolean chains 5, 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 · SwitchOverStringVisitor.prepareMergedSwitchCases (cognitive 41) · ×1
  • SwitchOverStringVisitor.prepareMergedSwitchCases (cognitive 41) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:234 — SwitchOverStringVisitor.prepareMergedSwitchCases has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 5 (14 pts), boolean chains 3 (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 · IfRegionVisitor.orderBranches (cognitive 40) · ×1
  • IfRegionVisitor.orderBranches (cognitive 40) jadx-core/src/main/java/jadx/core/dex/visitors/regions/IfRegionVisitor.java:62 — IfRegionVisitor.orderBranches has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 8 (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 · SmaliDebugger.decodeCompositeEvents (cognitive 39) · ×1
  • SmaliDebugger.decodeCompositeEvents (cognitive 39) REDACTED:758 — SmaliDebugger.decodeCompositeEvents has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (38 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 · IfRegionMaker.mergeNestedIfNodes (cognitive 39) · ×1
  • IfRegionMaker.mergeNestedIfNodes (cognitive 39) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:398 — IfRegionMaker.mergeNestedIfNodes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 6, loops 1 (2 pts), ternaries 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 · ClassModifier.removeSyntheticFields (cognitive 39) · ×1
  • ClassModifier.removeSyntheticFields (cognitive 39) jadx-core/src/main/java/jadx/core/dex/visitors/ClassModifier.java:81 — ClassModifier.removeSyntheticFields has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 2 (7 pts), boolean chains 3 (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 · LoopRegionMaker.makeLoopRegion (cognitive 37) · ×1
  • LoopRegionMaker.makeLoopRegion (cognitive 37) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:187 — LoopRegionMaker.makeLoopRegion has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (5 pts), boolean chains 4 (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 · CodeShrinkVisitor.checkInline (cognitive 35) · ×1
  • CodeShrinkVisitor.checkInline (cognitive 35) jadx-core/src/main/java/jadx/core/dex/visitors/shrink/CodeShrinkVisitor.java:78 — CodeShrinkVisitor.checkInline has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 9, 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 · ReplaceNewArray.processNewArray (cognitive 35) · ×1
  • ReplaceNewArray.processNewArray (cognitive 35) jadx-core/src/main/java/jadx/core/dex/visitors/ReplaceNewArray.java:77 — ReplaceNewArray.processNewArray has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 5 (7 pts), boolean chains 3, 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 · FilesWatcher.watch (cognitive 34) · ×1
  • FilesWatcher.watch (cognitive 34) jadx-gui/src/main/java/jadx/gui/utils/fileswatcher/FilesWatcher.java:59 — FilesWatcher.watch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), error handling 2 (6 pts), loops 2 (3 pts), boolean chains 2 (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 · IfCondition.simplify (cognitive 34) · ×1
  • IfCondition.simplify (cognitive 34) jadx-core/src/main/java/jadx/core/dex/regions/conditions/IfCondition.java:152 — IfCondition.simplify has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 6, loops 2 (4 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 · IfRegionMaker.process (cognitive 34) · ×1
  • IfRegionMaker.process (cognitive 34) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:59 — IfRegionMaker.process has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 1 (3 pts), boolean chains 2 (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 · SwitchRegionMaker.allSameReturns (cognitive 34) · ×1
  • SwitchRegionMaker.allSameReturns (cognitive 34) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/SwitchRegionMaker.java:229 — SwitchRegionMaker.allSameReturns has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (11 pts), boolean chains 3 (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 · SwitchRegionMaker.calcSwitchOut (cognitive 34) · ×1
  • SwitchRegionMaker.calcSwitchOut (cognitive 34) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/SwitchRegionMaker.java:146 — SwitchRegionMaker.calcSwitchOut has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 6, loops 1 (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 · ManifestAttributes.parseValues (cognitive 34) · ×1
  • ManifestAttributes.parseValues (cognitive 34) jadx-core/src/main/java/jadx/core/xmlgen/ManifestAttributes.java:133 — ManifestAttributes.parseValues has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (27 pts), error handling 1 (5 pts), boolean chains 1, loops 1 (nesting depth added 22). 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 · ModifiedUTF8Decoder.decodeString (cognitive 33) · ×1
  • ModifiedUTF8Decoder.decodeString (cognitive 33) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/utils/ModifiedUTF8Decoder.java:7 — ModifiedUTF8Decoder.decodeString has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 5, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SearchDialog.buildSearch (cognitive 33) · ×1
  • SearchDialog.buildSearch (cognitive 33) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:618 — SearchDialog.buildSearch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 1 (4 pts), boolean chains 1 (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 · SimplifyVisitor.simplifyStringConstructor (cognitive 33) · ×1
  • SimplifyVisitor.simplifyStringConstructor (cognitive 33) jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.java:175 — SimplifyVisitor.simplifyStringConstructor has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 1 (4 pts), boolean chains 3 (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 · CodeShrinkVisitor.canMoveBetweenBlocks (cognitive 32) · ×1
  • CodeShrinkVisitor.canMoveBetweenBlocks (cognitive 32) jadx-core/src/main/java/jadx/core/dex/visitors/shrink/CodeShrinkVisitor.java:225 — CodeShrinkVisitor.canMoveBetweenBlocks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (6 pts), boolean chains 4 (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 · SimpleCodePanel.showCode (cognitive 31) · ×1
  • SimpleCodePanel.showCode (cognitive 31) jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:74 — SimpleCodePanel.showCode has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 2 (5 pts), loops 1 (4 pts), boolean chains 1 (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 · InsnGen.makeConstructor (cognitive 31) · ×1
  • InsnGen.makeConstructor (cognitive 31) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:727 — InsnGen.makeConstructor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimpleModeHelper.prepareBlocks (cognitive 31) · ×1
  • SimpleModeHelper.prepareBlocks (cognitive 31) jadx-core/src/main/java/jadx/core/codegen/SimpleModeHelper.java:36 — SimpleModeHelper.prepareBlocks has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, ternaries 1 (2 pts), 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 · DeobfuscatorVisitor.process (cognitive 31) · ×1
  • DeobfuscatorVisitor.process (cognitive 31) jadx-core/src/main/java/jadx/core/deobf/DeobfuscatorVisitor.java:34 — DeobfuscatorVisitor.process has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 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 · LoopRegionVisitor.checkArrayForEach (cognitive 31) · ×1
  • LoopRegionVisitor.checkArrayForEach (cognitive 31) jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java:146 — LoopRegionVisitor.checkArrayForEach has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 6 (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 · ProcessInstructionsVisitor.initJumps (cognitive 31) · ×1
  • ProcessInstructionsVisitor.initJumps (cognitive 31) jadx-core/src/main/java/jadx/core/dex/visitors/ProcessInstructionsVisitor.java:44 — ProcessInstructionsVisitor.initJumps has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MarkFinallyVisitor.findCommonInsns (cognitive 30) · ×1
  • MarkFinallyVisitor.findCommonInsns (cognitive 30) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/MarkFinallyVisitor.java:375 — MarkFinallyVisitor.findCommonInsns has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (8 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 · TypeSearch.search (cognitive 30) · ×1
  • TypeSearch.search (cognitive 30) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeSearch.java:109 — TypeSearch.search has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (8 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BlockUtils.getBottomBlock (cognitive 30) · ×1
  • BlockUtils.getBottomBlock (cognitive 30) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:891 — BlockUtils.getBottomBlock has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (8 pts), boolean chains 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 · CommandPlugins.process (cognitive 30) · ×1
  • CommandPlugins.process (cognitive 30) jadx-cli/src/main/java/jadx/cli/commands/CommandPlugins.java:69 — CommandPlugins.process has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (21 pts), loops 2 (5 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 7). 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 · SMAPParser.parseStratum (cognitive 30) · ×1
  • SMAPParser.parseStratum (cognitive 30) jadx-plugins/jadx-kotlin-source-debug-extension/src/main/kotlin/jadx/plugins/kotlin/smap/utils/SMAPParser.kt:66 — SMAPParser.parseStratum has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (6 pts), boolean chains 4, loops 2 (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 · AccessFlags.format (cognitive 29) · ×1
  • AccessFlags.format (cognitive 29) jadx-plugins/jadx-input-api/src/main/java/jadx/api/plugins/input/data/AccessFlags.java:31 — AccessFlags.format has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 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 · ClassGen.addGenericTypeParameters (cognitive 29) · ×1
  • ClassGen.addGenericTypeParameters (cognitive 29) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:229 — ClassGen.addGenericTypeParameters has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 pts), boolean chains 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 · BlockSplitter.addTempConnectionsForExcHandlers (cognitive 29) · ×1
  • BlockSplitter.addTempConnectionsForExcHandlers (cognitive 29) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockSplitter.java:265 — BlockSplitter.addTempConnectionsForExcHandlers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (6 pts), ternaries 1 (5 pts) (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 · OverrideMethodVisitor.applyOverrideAttr (cognitive 29) · ×1
  • OverrideMethodVisitor.applyOverrideAttr (cognitive 29) jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:181 — OverrideMethodVisitor.applyOverrideAttr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (5 pts) (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 · OverrideMethodVisitor.processOverrideMethods (cognitive 29) · ×1
  • OverrideMethodVisitor.processOverrideMethods (cognitive 29) jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:82 — OverrideMethodVisitor.processOverrideMethods has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (5 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 · ConvertNumberAction.getConversionsFromWord (cognitive 28) · ×1
  • ConvertNumberAction.getConversionsFromWord (cognitive 28) jadx-gui/src/main/java/jadx/gui/ui/codearea/ConvertNumberAction.java:109 — ConvertNumberAction.getConversionsFromWord has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 6). 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 · MethodGen.addMethodArguments (cognitive 28) · ×1
  • MethodGen.addMethodArguments (cognitive 28) jadx-core/src/main/java/jadx/core/codegen/MethodGen.java:193 — MethodGen.addMethodArguments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, loops 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 · EnumVisitor.checkExternalRegUsage (cognitive 28) · ×1
  • EnumVisitor.checkExternalRegUsage (cognitive 28) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:528 — EnumVisitor.checkExternalRegUsage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, match/switch 1 (2 pts), 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 · DebugChecks.checkSSAVars (cognitive 28) · ×1
  • DebugChecks.checkSSAVars (cognitive 28) jadx-core/src/main/java/jadx/core/utils/DebugChecks.java:174 — DebugChecks.checkSSAVars has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (3 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 · ResXmlGen.addItem (cognitive 28) · ×1
  • ResXmlGen.addItem (cognitive 28) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:184 — ResXmlGen.addItem has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 2 (6 pts), boolean chains 4, match/switch 1 (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 · IfCondition.simplifyCmpOp (cognitive 27) · ×1
  • IfCondition.simplifyCmpOp (cognitive 27) jadx-core/src/main/java/jadx/core/dex/regions/conditions/IfCondition.java:206 — IfCondition.simplifyCmpOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, ternaries 2 (8 pts), match/switch 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 · DominatorTree.build (cognitive 27) · ×1
  • DominatorTree.build (cognitive 27) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/DominatorTree.java:40 — DominatorTree.build has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (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 · ExcHandlersRegionMaker.collectHandlerRegions (cognitive 27) · ×1
  • ExcHandlersRegionMaker.collectHandlerRegions (cognitive 27) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/ExcHandlersRegionMaker.java:44 — ExcHandlersRegionMaker.collectHandlerRegions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (10 pts), boolean chains 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 · TernaryMod.makeTernaryInsn (cognitive 27) · ×1
  • TernaryMod.makeTernaryInsn (cognitive 27) jadx-core/src/main/java/jadx/core/dex/visitors/regions/TernaryMod.java:72 — TernaryMod.makeTernaryInsn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (22 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 · AndroidManifestParser.parseAttributes (cognitive 27) · ×1
  • AndroidManifestParser.parseAttributes (cognitive 27) jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:60 — AndroidManifestParser.parseAttributes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (27 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 · TabbedPane.buildMenu (cognitive 26) · ×1
  • TabbedPane.buildMenu (cognitive 26) jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java:613 — TabbedPane.buildMenu has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (5 pts), ternaries 3 (5 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 · RenameVisitor.checkNames (cognitive 26) · ×1
  • RenameVisitor.checkNames (cognitive 26) jadx-core/src/main/java/jadx/core/dex/visitors/rename/RenameVisitor.java:48 — RenameVisitor.checkNames has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DeboxingVisitor.canChangeTypeToPrimitive (cognitive 26) · ×1
  • DeboxingVisitor.canChangeTypeToPrimitive (cognitive 26) jadx-core/src/main/java/jadx/core/dex/visitors/DeboxingVisitor.java:135 — DeboxingVisitor.canChangeTypeToPrimitive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts), boolean chains 2 (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 · ToStringParser.process (cognitive 26) · ×1
  • ToStringParser.process (cognitive 26) jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/ToStringParser.kt:38 — ToStringParser.process has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4 (nesting depth added 13). 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 · ADBDevice.listenForJDWP (cognitive 25) · ×1
  • ADBDevice.listenForJDWP (cognitive 25) jadx-gui/src/main/java/jadx/gui/device/protocol/ADBDevice.java:249 — ADBDevice.listenForJDWP has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (5 pts), boolean chains 1 (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 · ADBDialog.processSelected (cognitive 25) · ×1
  • ADBDialog.processSelected (cognitive 25) jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:309 — ADBDialog.processSelected has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 1 (nesting depth added 13). 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 · LoopRegionMaker.insertLoopBreak (cognitive 25) · ×1
  • LoopRegionMaker.insertLoopBreak (cognitive 25) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:652 — LoopRegionMaker.insertLoopBreak has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SwitchRegionMaker.insertContinueInSwitch (cognitive 25) · ×1
  • SwitchRegionMaker.insertContinueInSwitch (cognitive 25) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/SwitchRegionMaker.java:367 — SwitchRegionMaker.insertContinueInSwitch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (5 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 · TypeCompare.compareTypes (cognitive 25) · ×1
  • TypeCompare.compareTypes (cognitive 25) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeCompare.java:61 — TypeCompare.compareTypes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, 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 · PrepareForCodeGen.removeParenthesis (cognitive 25) · ×1
  • PrepareForCodeGen.removeParenthesis (cognitive 25) jadx-core/src/main/java/jadx/core/dex/visitors/PrepareForCodeGen.java:187 — PrepareForCodeGen.removeParenthesis has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (5 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 · RegionUtils.isInsnExitContainer (cognitive 25) · ×1
  • RegionUtils.isInsnExitContainer (cognitive 25) jadx-core/src/main/java/jadx/core/utils/RegionUtils.java:282 — RegionUtils.isInsnExitContainer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (6 pts), boolean chains 1 (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 · SSATransform.removePhiList (cognitive 24) · ×1
  • SSATransform.removePhiList (cognitive 24) jadx-core/src/main/java/jadx/core/dex/visitors/ssa/SSATransform.java:373 — SSATransform.removePhiList has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EnumVisitor.removeEnumMethods (cognitive 24) · ×1
  • EnumVisitor.removeEnumMethods (cognitive 24) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:602 — EnumVisitor.removeEnumMethods has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, loops 2 (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 · MoveInlineVisitor.processMove (cognitive 24) · ×1
  • MoveInlineVisitor.processMove (cognitive 24) jadx-core/src/main/java/jadx/core/dex/visitors/MoveInlineVisitor.java:49 — MoveInlineVisitor.processMove has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 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 · DotGraphUtils.processBlock (cognitive 24) · ×1
  • DotGraphUtils.processBlock (cognitive 24) jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java:282 — DotGraphUtils.processBlock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 3). 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 · PassMerge.searchInsertPos (cognitive 24) · ×1
  • PassMerge.searchInsertPos (cognitive 24) jadx-core/src/main/java/jadx/core/utils/PassMerge.java:53 — PassMerge.searchInsertPos has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3, boolean chains 1, 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 · ResTableBinaryParser.parseTypeChunk (cognitive 24) · ×1
  • ResTableBinaryParser.parseTypeChunk (cognitive 24) jadx-core/src/main/java/jadx/core/xmlgen/ResTableBinaryParser.java:251 — ResTableBinaryParser.parseTypeChunk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 pts), boolean chains 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 · CallGraphBuilder.collectEdges (cognitive 24) · ×1
  • CallGraphBuilder.collectEdges (cognitive 24) jadx-commons/jadx-analysis/src/main/java/jadx/analysis/callgraph/CallGraphBuilder.java:46 — CallGraphBuilder.collectEdges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ClassInheritanceGraphDialog.addNode (cognitive 23) · ×1
  • ClassInheritanceGraphDialog.addNode (cognitive 23) jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:363 — ClassInheritanceGraphDialog.addNode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (10 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 · 1.dispatchKeyEvent (cognitive 23) · ×1
  • 1.dispatchKeyEvent (cognitive 23) jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java:128 — 1.dispatchKeyEvent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 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 · MethodGen.addDefinition (cognitive 23) · ×1
  • MethodGen.addDefinition (cognitive 23) jadx-core/src/main/java/jadx/core/codegen/MethodGen.java:81 — MethodGen.addDefinition has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 3 (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 · LoopRegionMaker.viaValidUncleanSuccessor (cognitive 23) · ×1
  • LoopRegionMaker.viaValidUncleanSuccessor (cognitive 23) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:368 — LoopRegionMaker.viaValidUncleanSuccessor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 13). 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 · MethodInvokeVisitor.applyArgsCast (cognitive 23) · ×1
  • MethodInvokeVisitor.applyArgsCast (cognitive 23) jadx-core/src/main/java/jadx/core/dex/visitors/MethodInvokeVisitor.java:177 — MethodInvokeVisitor.applyArgsCast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 1, loops 1 (nesting depth added 13). 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 · DotGraphUtils.dumpToString (cognitive 23) · ×1
  • DotGraphUtils.dumpToString (cognitive 23) jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java:112 — DotGraphUtils.dumpToString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 pts), boolean chains 1 (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 · ADBDialog.jdwpProcessOccurred (cognitive 22) · ×1
  • ADBDialog.jdwpProcessOccurred (cognitive 22) jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:453 — ADBDialog.jdwpProcessOccurred has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2, error handling 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 · BinarySearchServiceImpl.searchForBinaryData (cognitive 22) · ×1
  • BinarySearchServiceImpl.searchForBinaryData (cognitive 22) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:103 — BinarySearchServiceImpl.searchForBinaryData has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 2, ternaries 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 · ClassGen.useClassInternal (cognitive 22) · ×1
  • ClassGen.useClassInternal (cognitive 22) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:704 — ClassGen.useClassInternal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 1 (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 · TraverserController.advance (cognitive 22) · ×1
  • TraverserController.advance (cognitive 22) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/TraverserController.java:100 — TraverserController.advance has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 1 (3 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 · LoopRegionMaker.validOutBlock (cognitive 22) · ×1
  • LoopRegionMaker.validOutBlock (cognitive 22) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:297 — LoopRegionMaker.validOutBlock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 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 · TernaryMod.replaceWithTernary (cognitive 22) · ×1
  • TernaryMod.replaceWithTernary (cognitive 22) jadx-core/src/main/java/jadx/core/dex/visitors/regions/TernaryMod.java:291 — TernaryMod.replaceWithTernary has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, loops 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, 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 · EnumVisitor.convertToEnum (cognitive 22) · ×1
  • EnumVisitor.convertToEnum (cognitive 22) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:118 — EnumVisitor.convertToEnum has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, loops 2 (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 · ExtractFieldInit.processFieldsDependencies (cognitive 22) · ×1
  • ExtractFieldInit.processFieldsDependencies (cognitive 22) jadx-core/src/main/java/jadx/core/dex/visitors/ExtractFieldInit.java:307 — ExtractFieldInit.processFieldsDependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 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 · SimplifyVisitor.simplifyArith (cognitive 22) · ×1
  • SimplifyVisitor.simplifyArith (cognitive 22) jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.java:540 — SimplifyVisitor.simplifyArith has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (3 pts), boolean chains 2, 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 · DebugChecks.checkInsn (cognitive 22) · ×1
  • DebugChecks.checkInsn (cognitive 22) jadx-core/src/main/java/jadx/core/utils/DebugChecks.java:78 — DebugChecks.checkInsn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 2, 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 · BinaryXMLParser.parseElement (cognitive 22) · ×1
  • BinaryXMLParser.parseElement (cognitive 22) jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:227 — BinaryXMLParser.parseElement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 2 (3 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 · XMLChar.isValidIANAEncoding (cognitive 22) · ×1
  • XMLChar.isValidIANAEncoding (cognitive 22) jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:992 — XMLChar.isValidIANAEncoding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 7, loops 1 (4 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 · SingleClassMode.process (cognitive 22) · ×1
  • SingleClassMode.process (cognitive 22) jadx-cli/src/main/java/jadx/cli/SingleClassMode.java:22 — SingleClassMode.process has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, error handling 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 · DexAnnotationsConvert.convertSystemAnnotations (cognitive 21) · ×1
  • DexAnnotationsConvert.convertSystemAnnotations (cognitive 21) jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/sections/DexAnnotationsConvert.java:55 — DexAnnotationsConvert.convertSystemAnnotations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 3 (6 pts), boolean chains 3, loops 1 (3 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 · Smali.getResultRegOrField (cognitive 21) · ×1
  • Smali.getResultRegOrField (cognitive 21) jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java:163 — Smali.getResultRegOrField has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (21 pts) (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 · DebugController.updateRegister (cognitive 21) · ×1
  • DebugController.updateRegister (cognitive 21) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:449 — DebugController.updateRegister has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (4 pts), error handling 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 · JavaClass.loadLists (cognitive 21) · ×1
  • JavaClass.loadLists (cognitive 21) jadx-core/src/main/java/jadx/api/JavaClass.java:148 — JavaClass.loadLists has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 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 · ClassGen.addClassDeclaration (cognitive 21) · ×1
  • ClassGen.addClassDeclaration (cognitive 21) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:166 — ClassGen.addClassDeclaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, 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 · MethodGen.generateSimpleCode (cognitive 21) · ×1
  • MethodGen.generateSimpleCode (cognitive 21) jadx-core/src/main/java/jadx/core/codegen/MethodGen.java:325 — MethodGen.generateSimpleCode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 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 · TypeUtils.replaceTypeVariablesUsingMap (cognitive 21) · ×1
  • TypeUtils.replaceTypeVariablesUsingMap (cognitive 21) jadx-core/src/main/java/jadx/core/dex/nodes/utils/TypeUtils.java:286 — TypeUtils.replaceTypeVariablesUsingMap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 2 (4 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 · TryEdgeScopeGroupMap.createEdgeTerminusMap (cognitive 21) · ×1
  • TryEdgeScopeGroupMap.createEdgeTerminusMap (cognitive 21) jadx-core/src/main/java/jadx/core/dex/trycatch/TryEdgeScopeGroupMap.java:270 — TryEdgeScopeGroupMap.createEdgeTerminusMap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 3 (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 · BlockExceptionHandler.processCatchAttr (cognitive 21) · ×1
  • BlockExceptionHandler.processCatchAttr (cognitive 21) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockExceptionHandler.java:101 — BlockExceptionHandler.processCatchAttr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (7 pts), boolean chains 1 (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 · BlockProcessor.mergeConstReturn (cognitive 21) · ×1
  • BlockProcessor.mergeConstReturn (cognitive 21) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:371 — BlockProcessor.mergeConstReturn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2, loops 1 (nesting depth added 11). 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 · BlockProcessor.processNestedLoops (cognitive 21) · ×1
  • BlockProcessor.processNestedLoops (cognitive 21) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:326 — BlockProcessor.processNestedLoops has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DebugInfoAttachVisitor.attachDebugInfo (cognitive 21) · ×1
  • DebugInfoAttachVisitor.attachDebugInfo (cognitive 21) jadx-core/src/main/java/jadx/core/dex/visitors/debuginfo/DebugInfoAttachVisitor.java:100 — DebugInfoAttachVisitor.attachDebugInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (9 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 · SSATransform.renameVarsInBlock (cognitive 21) · ×1
  • SSATransform.renameVarsInBlock (cognitive 21) jadx-core/src/main/java/jadx/core/dex/visitors/ssa/SSATransform.java:146 — SSATransform.renameVarsInBlock has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 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 · UsageInfo.processType (cognitive 21) · ×1
  • UsageInfo.processType (cognitive 21) jadx-core/src/main/java/jadx/core/dex/visitors/usage/UsageInfo.java:193 — UsageInfo.processType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (6 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 · EntryConfig.getLocaleString (cognitive 21) · ×1
  • EntryConfig.getLocaleString (cognitive 21) jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:437 — EntryConfig.getLocaleString has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7 (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 · JCommanderWrapper.printOptions (cognitive 21) · ×1
  • JCommanderWrapper.printOptions (cognitive 21) jadx-cli/src/main/java/jadx/cli/JCommanderWrapper.java:178 — JCommanderWrapper.printOptions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 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 · PluginSettings.addOptions (cognitive 20) · ×1
  • PluginSettings.addOptions (cognitive 20) jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/PluginSettings.java:161 — PluginSettings.addOptions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 1, 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 · TextField.<init> (cognitive 20) · ×1
  • TextField.<init> (cognitive 20) jadx-gui/src/main/java/jadx/gui/settings/ui/shortcut/ShortcutEdit.java:93 — TextField.<init> has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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 · InsnGen.makeInsn (cognitive 20) · ×1
  • InsnGen.makeInsn (cognitive 20) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:280 — InsnGen.makeInsn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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 · DeobfPresets.fill (cognitive 20) · ×1
  • DeobfPresets.fill (cognitive 20) jadx-core/src/main/java/jadx/core/deobf/DeobfPresets.java:149 — DeobfPresets.fill has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 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 · RegionMaker.traverse (cognitive 20) · ×1
  • RegionMaker.traverse (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/RegionMaker.java:81 — RegionMaker.traverse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (2 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 · SwitchRegionMaker.addCases (cognitive 20) · ×1
  • SwitchRegionMaker.addCases (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/SwitchRegionMaker.java:93 — SwitchRegionMaker.addCases has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 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 · ExtractCommonBreak.processBranchRegion (cognitive 20) · ×1
  • ExtractCommonBreak.processBranchRegion (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchBreakVisitor.java:68 — ExtractCommonBreak.processBranchRegion has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (3 pts), boolean chains 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 · SwitchOverStringVisitor.replaceWithMergedSwitch (cognitive 20) · ×1
  • SwitchOverStringVisitor.replaceWithMergedSwitch (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:298 — SwitchOverStringVisitor.replaceWithMergedSwitch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), boolean chains 1, error handling 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 · InvokeUpdateCallback.updateCallback (cognitive 20) · ×1
  • InvokeUpdateCallback.updateCallback (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/InvokeUpdateCallback.java:47 — InvokeUpdateCallback.updateCallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (7 pts), match/switch 1 (2 pts), loops 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 · UsageInfoVisitor.processInsn (cognitive 20) · ×1
  • UsageInfoVisitor.processInsn (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/usage/UsageInfoVisitor.java:138 — UsageInfoVisitor.processInsn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 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 · ConstInlineVisitor.replaceArg (cognitive 20) · ×1
  • ConstInlineVisitor.replaceArg (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/ConstInlineVisitor.java:229 — ConstInlineVisitor.replaceArg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 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 · ExtractFieldInit.collectFieldsInit (cognitive 20) · ×1
  • ExtractFieldInit.collectFieldsInit (cognitive 20) jadx-core/src/main/java/jadx/core/dex/visitors/ExtractFieldInit.java:174 — ExtractFieldInit.collectFieldsInit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RegionUtils.isRegionContainsExcHandlerRegion (cognitive 20) · ×1
  • RegionUtils.isRegionContainsExcHandlerRegion (cognitive 20) jadx-core/src/main/java/jadx/core/utils/RegionUtils.java:469 — RegionUtils.isRegionContainsExcHandlerRegion has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (6 pts), boolean chains 1 (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 · CodeVisitor.process (cognitive 19) · ×1
  • CodeVisitor.process (cognitive 19) jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/utils/VariablesUtils.java:68 — CodeVisitor.process has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (19 pts) (nesting depth added 11). 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 · JavaConvertLoader.repackAndConvertJar (cognitive 19) · ×1
  • JavaConvertLoader.repackAndConvertJar (cognitive 19) jadx-plugins/jadx-java-convert/src/main/java/jadx/plugins/input/javaconvert/JavaConvertLoader.java:117 — JavaConvertLoader.repackAndConvertJar has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, error handling 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 · DebugInfoParser.process (cognitive 19) · ×1
  • DebugInfoParser.process (cognitive 19) jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/sections/debuginfo/DebugInfoParser.java:83 — DebugInfoParser.process has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 2, match/switch 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 · DebugController.onSuspendEvent (cognitive 19) · ×1
  • DebugController.onSuspendEvent (cognitive 19) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:363 — DebugController.onSuspendEvent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2 (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 · CodeSearchProvider.next (cognitive 19) · ×1
  • CodeSearchProvider.next (cognitive 19) jadx-gui/src/main/java/jadx/gui/search/providers/CodeSearchProvider.java:46 — CodeSearchProvider.next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, 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 · SmaliFoldParser.getFolds (cognitive 19) · ×1
  • SmaliFoldParser.getFolds (cognitive 19) jadx-gui/src/main/java/jadx/gui/ui/codearea/SmaliFoldParser.java:34 — SmaliFoldParser.getFolds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 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 · MainWindow.checkIfCodeHasNonPrintableChars (cognitive 19) · ×1
  • MainWindow.checkIfCodeHasNonPrintableChars (cognitive 19) jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1884 — MainWindow.checkIfCodeHasNonPrintableChars has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 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 · SyncNLSLines.applySync (cognitive 19) · ×1
  • SyncNLSLines.applySync (cognitive 19) jadx-gui/src/main/java/jadx/gui/utils/tools/SyncNLSLines.java:114 — SyncNLSLines.applySync has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts), boolean chains 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 · InsnGen.generateMethodArguments (cognitive 19) · ×1
  • InsnGen.generateMethodArguments (cognitive 19) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:1119 — InsnGen.generateMethodArguments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (2 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 · ConstStorage.getConstField (cognitive 19) · ×1
  • ConstStorage.getConstField (cognitive 19) jadx-core/src/main/java/jadx/core/dex/info/ConstStorage.java:96 — ConstStorage.getConstField has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · InsnArg.wrapInstruction (cognitive 19) · ×1
  • InsnArg.wrapInstruction (cognitive 19) jadx-core/src/main/java/jadx/core/dex/instructions/args/InsnArg.java:105 — InsnArg.wrapInstruction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 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 · SelectFromDuplicates.process (cognitive 19) · ×1
  • SelectFromDuplicates.process (cognitive 19) jadx-core/src/main/java/jadx/core/dex/nodes/utils/SelectFromDuplicates.java:21 — SelectFromDuplicates.process has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (nesting depth added 11). 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 · ClassNode.checkSourceFilenameAttr (cognitive 19) · ×1
  • ClassNode.checkSourceFilenameAttr (cognitive 19) jadx-core/src/main/java/jadx/core/dex/nodes/ClassNode.java:272 — ClassNode.checkSourceFilenameAttr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, 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 · BlockProcessor.splitThrow (cognitive 19) · ×1
  • BlockProcessor.splitThrow (cognitive 19) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:717 — BlockProcessor.splitThrow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (5 pts), boolean chains 2 (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 · MarkFinallyVisitor.extractFinally (cognitive 19) · ×1
  • MarkFinallyVisitor.extractFinally (cognitive 19) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/MarkFinallyVisitor.java:277 — MarkFinallyVisitor.extractFinally has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 6 (8 pts), boolean chains 2 (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 · LoopRegionVisitor.fixIterableType (cognitive 19) · ×1
  • LoopRegionVisitor.fixIterableType (cognitive 19) jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java:342 — LoopRegionVisitor.fixIterableType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4 (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 · SSATransform.fixPhiWithSameArgs (cognitive 19) · ×1
  • SSATransform.fixPhiWithSameArgs (cognitive 19) jadx-core/src/main/java/jadx/core/dex/visitors/ssa/SSATransform.java:300 — SSATransform.fixPhiWithSameArgs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 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 · EntryConfig.<init> (cognitive 19) · ×1
  • EntryConfig.<init> (cognitive 19) jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java:71 — EntryConfig.<init> has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6 (nesting depth added 2). 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 · BinaryXMLParser.decodeAttribute (cognitive 19) · ×1
  • BinaryXMLParser.decodeAttribute (cognitive 19) jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:411 — BinaryXMLParser.decodeAttribute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (2 pts), ternaries 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 · StringFormattedCheck.findSubstitutions (cognitive 19) · ×1
  • StringFormattedCheck.findSubstitutions (cognitive 19) jadx-core/src/main/java/jadx/core/xmlgen/StringFormattedCheck.java:62 — StringFormattedCheck.findSubstitutions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProcessClass.process (cognitive 19) · ×1
  • ProcessClass.process (cognitive 19) jadx-core/src/main/java/jadx/core/ProcessClass.java:47 — ProcessClass.process has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (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 · 2.mouseMoved (cognitive 18) · ×1
  • 2.mouseMoved (cognitive 18) jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:116 — 2.mouseMoved has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 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 · CaretPositionFix.getNewPos (cognitive 18) · ×1
  • CaretPositionFix.getNewPos (cognitive 18) jadx-gui/src/main/java/jadx/gui/utils/CaretPositionFix.java:105 — CaretPositionFix.getNewPos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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 · ClassGen.addField (cognitive 18) · ×1
  • ClassGen.addField (cognitive 18) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:462 — ClassGen.addField has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 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 · InsnGen.makeSimpleLambda (cognitive 18) · ×1
  • InsnGen.makeSimpleLambda (cognitive 18) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:985 — InsnGen.makeSimpleLambda has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts), boolean chains 1, error handling 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 · TypeGen.literalToString (cognitive 18) · ×1
  • TypeGen.literalToString (cognitive 18) jadx-core/src/main/java/jadx/core/codegen/TypeGen.java:58 — TypeGen.literalToString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, ternaries 1 (2 pts), match/switch 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 · ExcludeAndroidRClass.isR (cognitive 18) · ×1
  • ExcludeAndroidRClass.isR (cognitive 18) jadx-core/src/main/java/jadx/core/deobf/conditions/ExcludeAndroidRClass.java:19 — ExcludeAndroidRClass.isR has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 4 (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 · DeobfAliasProvider.getBaseName (cognitive 18) · ×1
  • DeobfAliasProvider.getBaseName (cognitive 18) jadx-core/src/main/java/jadx/core/deobf/DeobfAliasProvider.java:85 — DeobfAliasProvider.getBaseName has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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 · SignatureParser.consumeObjectType (cognitive 18) · ×1
  • SignatureParser.consumeObjectType (cognitive 18) jadx-core/src/main/java/jadx/core/dex/nodes/parser/SignatureParser.java:190 — SignatureParser.consumeObjectType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 2 (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 · LoopRegion.checkPreCondition (cognitive 18) · ×1
  • LoopRegion.checkPreCondition (cognitive 18) jadx-core/src/main/java/jadx/core/dex/regions/loops/LoopRegion.java:79 — LoopRegion.checkPreCondition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 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 · BlockExceptionHandler.prepareTryBlocks (cognitive 18) · ×1
  • BlockExceptionHandler.prepareTryBlocks (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockExceptionHandler.java:190 — BlockExceptionHandler.prepareTryBlocks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (6 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 · TryCatchEdgeBlockMap.getAllInScope (cognitive 18) · ×1
  • TryCatchEdgeBlockMap.getAllInScope (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/TryCatchEdgeBlockMap.java:52 — TryCatchEdgeBlockMap.getAllInScope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 3 (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 · VisibilityUtils.checkVisibility (cognitive 18) · ×1
  • VisibilityUtils.checkVisibility (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/fixaccessmodifiers/VisibilityUtils.java:20 — VisibilityUtils.checkVisibility has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · IfRegionMaker.restructureIf (cognitive 18) · ×1
  • IfRegionMaker.restructureIf (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:175 — IfRegionMaker.restructureIf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (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 · LiveVarAnalysis.fillBasicBlockInfo (cognitive 18) · ×1
  • LiveVarAnalysis.fillBasicBlockInfo (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/ssa/LiveVarAnalysis.java:56 — LiveVarAnalysis.fillBasicBlockInfo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 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 · TypeUpdate.arrayGetListener (cognitive 18) · ×1
  • TypeUpdate.arrayGetListener (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeUpdate.java:569 — TypeUpdate.arrayGetListener has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ClassModifier.modifySyntheticMethod (cognitive 18) · ×1
  • ClassModifier.modifySyntheticMethod (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/ClassModifier.java:214 — ClassModifier.modifySyntheticMethod has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts), boolean chains 2 (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 · ExtractFieldInit.filterFieldsInit (cognitive 18) · ×1
  • ExtractFieldInit.filterFieldsInit (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/ExtractFieldInit.java:203 — ExtractFieldInit.filterFieldsInit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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 · ExtractFieldInit.moveCommonFieldsInit (cognitive 18) · ×1
  • ExtractFieldInit.moveCommonFieldsInit (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/ExtractFieldInit.java:126 — ExtractFieldInit.moveCommonFieldsInit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (6 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 · OverrideMethodVisitor.checkMethodSignatureCollisions (cognitive 18) · ×1
  • OverrideMethodVisitor.checkMethodSignatureCollisions (cognitive 18) jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:430 — OverrideMethodVisitor.checkMethodSignatureCollisions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2, loops 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.
D2 · Cognitive Complexity · BlockUtils.visitBlocksOnPath (cognitive 18) · ×1
  • BlockUtils.visitBlocksOnPath (cognitive 18) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:468 — BlockUtils.visitBlocksOnPath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 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 · DecompilerScheduler.internalBatches (cognitive 18) · ×1
  • DecompilerScheduler.internalBatches (cognitive 18) jadx-core/src/main/java/jadx/core/utils/DecompilerScheduler.java:50 — DecompilerScheduler.internalBatches has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 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 · ManifestAttributes.updateAttributes (cognitive 18) · ×1
  • ManifestAttributes.updateAttributes (cognitive 18) jadx-core/src/main/java/jadx/core/xmlgen/ManifestAttributes.java:208 — ManifestAttributes.updateAttributes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 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 · DebugSettings.clearForward (cognitive 17) · ×1
  • DebugSettings.clearForward (cognitive 17) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugSettings.java:81 — DebugSettings.clearForward has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (6 pts), if/else 2 (6 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 · LogcatController.getLog (cognitive 17) · ×1
  • LogcatController.getLog (cognitive 17) jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:70 — LogcatController.getLog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 pts), error handling 1, 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 · SmaliDebugger.decodingLoop (cognitive 17) · ×1
  • SmaliDebugger.decodingLoop (cognitive 17) REDACTED:670 — SmaliDebugger.decodingLoop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · InsnOffsetSmaliSyncer.syncTo (cognitive 17) · ×1
  • InsnOffsetSmaliSyncer.syncTo (cognitive 17) jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetSmaliSyncer.java:37 — InsnOffsetSmaliSyncer.syncTo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, boolean chains 1, error handling 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 · ClassInheritanceGraphDialog.visitClass (cognitive 17) · ×1
  • ClassInheritanceGraphDialog.visitClass (cognitive 17) jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:208 — ClassInheritanceGraphDialog.visitClass has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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.
D2 · Cognitive Complexity · WrapLayout.layoutSize (cognitive 17) · ×1
  • WrapLayout.layoutSize (cognitive 17) jadx-gui/src/main/java/jadx/gui/utils/layout/WrapLayout.java:95 — WrapLayout.layoutSize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ClassGen.addEnumFields (cognitive 17) · ×1
  • ClassGen.addEnumFields (cognitive 17) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:529 — ClassGen.addEnumFields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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 · ArgType.containsTypeVariable (cognitive 17) · ×1
  • ArgType.containsTypeVariable (cognitive 17) jadx-core/src/main/java/jadx/core/dex/instructions/args/ArgType.java:816 — ArgType.containsTypeVariable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 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 · ArgType.visitTypes (cognitive 17) · ×1
  • ArgType.visitTypes (cognitive 17) jadx-core/src/main/java/jadx/core/dex/instructions/args/ArgType.java:857 — ArgType.visitTypes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 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 · SwitchInsn.toString (cognitive 17) · ×1
  • SwitchInsn.toString (cognitive 17) jadx-core/src/main/java/jadx/core/dex/instructions/SwitchInsn.java:103 — SwitchInsn.toString has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (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 · BlockProcessor.duplicateSimpleMoveBlock (cognitive 17) · ×1
  • BlockProcessor.duplicateSimpleMoveBlock (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:441 — BlockProcessor.duplicateSimpleMoveBlock has cognitive complexity 17 (threshold 15). Drivers by points: loops 2 (9 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 10). 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 · IfRegionMaker.isBadBranchBlock (cognitive 17) · ×1
  • IfRegionMaker.isBadBranchBlock (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:324 — IfRegionMaker.isBadBranchBlock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (7 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 · LoopRegionVisitor.checkForIndexedLoop (cognitive 17) · ×1
  • LoopRegionVisitor.checkForIndexedLoop (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java:87 — LoopRegionVisitor.checkForIndexedLoop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 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 · FixTypesVisitor.processIncompatiblePrimitives (cognitive 17) · ×1
  • FixTypesVisitor.processIncompatiblePrimitives (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:823 — FixTypesVisitor.processIncompatiblePrimitives has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2, match/switch 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 · TypeUpdate.ifListener (cognitive 17) · ×1
  • TypeUpdate.ifListener (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeUpdate.java:638 — TypeUpdate.ifListener has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, 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 · ConstructorVisitor.processInvoke (cognitive 17) · ×1
  • ConstructorVisitor.processInvoke (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/ConstructorVisitor.java:64 — ConstructorVisitor.processInvoke has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 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 · InlineMethods.replaceRegs (cognitive 17) · ×1
  • InlineMethods.replaceRegs (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/InlineMethods.java:103 — InlineMethods.replaceRegs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), error handling 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 · ShadowFieldVisitor.searchShadowedFields (cognitive 17) · ×1
  • ShadowFieldVisitor.searchShadowedFields (cognitive 17) jadx-core/src/main/java/jadx/core/dex/visitors/ShadowFieldVisitor.java:69 — ShadowFieldVisitor.searchShadowedFields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 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 · BlockUtils.isFollowBackEdge (cognitive 17) · ×1
  • BlockUtils.isFollowBackEdge (cognitive 17) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:139 — BlockUtils.isFollowBackEdge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (4 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.
D2 · Cognitive Complexity · ResXmlGen.addSimpleValue (cognitive 17) · ×1
  • ResXmlGen.addSimpleValue (cognitive 17) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:237 — ResXmlGen.addSimpleValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · LineInfo.writeTip (cognitive 16) · ×1
  • LineInfo.writeTip (cognitive 16) jadx-gui/src/main/java/jadx/gui/device/debugger/smali/Smali.java:1006 — LineInfo.writeTip has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (6 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 · BinarySearchServiceImpl.performFindAgain (cognitive 16) · ×1
  • BinarySearchServiceImpl.performFindAgain (cognitive 16) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:293 — BinarySearchServiceImpl.performFindAgain has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (4 pts), ternaries 1 (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 · QuickTabsChildNode.onTreePopupMenu (cognitive 16) · ×1
  • QuickTabsChildNode.onTreePopupMenu (cognitive 16) jadx-gui/src/main/java/jadx/gui/ui/tab/QuickTabsChildNode.java:28 — QuickTabsChildNode.onTreePopupMenu has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (16 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 · ResTableHelper.addResFile (cognitive 16) · ×1
  • ResTableHelper.addResFile (cognitive 16) jadx-gui/src/main/java/jadx/gui/utils/res/ResTableHelper.java:67 — ResTableHelper.addResFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (5 pts), 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 · JadxDecompiler.loadInputFiles (cognitive 16) · ×1
  • JadxDecompiler.loadInputFiles (cognitive 16) jadx-core/src/main/java/jadx/api/JadxDecompiler.java:159 — JadxDecompiler.loadInputFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 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 · InsnGen.makeInlinedLambdaMethod (cognitive 16) · ×1
  • InsnGen.makeInlinedLambdaMethod (cognitive 16) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:1032 — InsnGen.makeInlinedLambdaMethod has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), 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 · BlockSplitter.expandMoveMulti (cognitive 16) · ×1
  • BlockSplitter.expandMoveMulti (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockSplitter.java:339 — BlockSplitter.expandMoveMulti has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (7 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 · MarkFinallyVisitor.visit (cognitive 16) · ×1
  • MarkFinallyVisitor.visit (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/finaly/MarkFinallyVisitor.java:94 — MarkFinallyVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2, boolean chains 1, error handling 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 · LoopRegionMaker.canInsertContinue (cognitive 16) · ×1
  • LoopRegionMaker.canInsertContinue (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:754 — LoopRegionMaker.canInsertContinue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), boolean chains 2 (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.processBlock (cognitive 16) · ×1
  • 1.processBlock (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/regions/variables/ProcessVariables.java:75 — 1.processBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 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 · SwitchOverStringVisitor.restoreSwitchOverString (cognitive 16) · ×1
  • SwitchOverStringVisitor.restoreSwitchOverString (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:77 — SwitchOverStringVisitor.restoreSwitchOverString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (4 pts), boolean chains 3, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · RenameVisitor.checkMethods (cognitive 16) · ×1
  • RenameVisitor.checkMethods (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/rename/RenameVisitor.java:198 — RenameVisitor.checkMethods has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FixTypesVisitor.fixBooleanUsage (cognitive 16) · ×1
  • FixTypesVisitor.fixBooleanUsage (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:861 — FixTypesVisitor.fixBooleanUsage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AdjustForIfMergeVisitor.getMovableInstructions (cognitive 16) · ×1
  • AdjustForIfMergeVisitor.getMovableInstructions (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/AdjustForIfMergeVisitor.java:77 — AdjustForIfMergeVisitor.getMovableInstructions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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 · AttachCommentsVisitor.applyComments (cognitive 16) · ×1
  • AttachCommentsVisitor.applyComments (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/AttachCommentsVisitor.java:57 — AttachCommentsVisitor.applyComments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 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.
D2 · Cognitive Complexity · ConstInlineVisitor.checkInsn (cognitive 16) · ×1
  • ConstInlineVisitor.checkInsn (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/ConstInlineVisitor.java:61 — ConstInlineVisitor.checkInsn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 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 · MethodThrowsVisitor.processInstructions (cognitive 16) · ×1
  • MethodThrowsVisitor.processInstructions (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java:112 — MethodThrowsVisitor.processInstructions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 2, error handling 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 · ModVisitor.replaceStep (cognitive 16) · ×1
  • ModVisitor.replaceStep (cognitive 16) jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:101 — ModVisitor.replaceStep has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BlockUtils.getPathCross (cognitive 16) · ×1
  • BlockUtils.getPathCross (cognitive 16) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:1016 — BlockUtils.getPathCross has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (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 · BlockUtils.traverseSuccessorsUntil (cognitive 16) · ×1
  • BlockUtils.traverseSuccessorsUntil (cognitive 16) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:728 — BlockUtils.traverseSuccessorsUntil has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1, 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 · RegionUtils.getLastInsnWithBlock (cognitive 16) · ×1
  • RegionUtils.getLastInsnWithBlock (cognitive 16) jadx-core/src/main/java/jadx/core/utils/RegionUtils.java:192 — RegionUtils.getLastInsnWithBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 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 · ValuesParser.decodeValue (cognitive 16) · ×1
  • ValuesParser.decodeValue (cognitive 16) jadx-core/src/main/java/jadx/core/xmlgen/entry/ValuesParser.java:84 — ValuesParser.decodeValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 1 (2 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 · ManifestAttributes.parseAttrList (cognitive 16) · ×1
  • ManifestAttributes.parseAttrList (cognitive 16) jadx-core/src/main/java/jadx/core/xmlgen/ManifestAttributes.java:109 — ManifestAttributes.parseAttrList has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (28 shared lines) · ×1
  • Near-duplicate member pair (28 shared lines) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:103 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:103-158 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:163-280 — These two members are variants of one another: 28 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 (17 corresponding lines) · ×1
  • Edited copy of a member (17 corresponding lines) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:302 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:302-318 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:320-338 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (6 members, 50+ identical tokens) jadx-gui/src/main/java/jadx/gui/ui/dialog/AboutDialog.java:30 — jadx-gui/src/main/java/jadx/gui/ui/dialog/AboutDialog.java:30-85 | jadx-gui/src/main/java/jadx/gui/ui/dialog/CommentDialog.java:118-189 | jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:206-235 | jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java:55-120 | jadx-gui/src/main/java/jadx/gui/ui/export/ExportProjectDialog.java:61-134 | jadx-gui/src/main/java/jadx/gui/ui/panel/JDebuggerPanel.java:213-332 — 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 (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) jadx-core/src/main/java/jadx/core/utils/Utils.java:71 — jadx-core/src/main/java/jadx/core/utils/Utils.java:71-92 | jadx-core/src/main/java/jadx/core/utils/Utils.java:128-149 — 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 `jadx-core/src/main/java/jadx/core/utils/Utils.java:71` 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 (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/insns/DexInsnData.java:238 — jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/insns/DexInsnData.java:238-256 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnData.java:251-269 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×1
  • Duplicated block (15–16 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:227 — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:227-241 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:245-260 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:227` 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 (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:75 — jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:75-89 | jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:96-110 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:106-120 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:75` 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 (11 lines × 3) · ×1
  • Duplicated block (11 lines × 3) jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:218 — jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:218-228 | jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:234-244 | jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:250-260 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:218` 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–9 lines × 2) · ×1
  • Duplicated block (8–9 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:113 — jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:113-120 | jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:204-212 — 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 `jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:113` 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–9 lines × 2) · ×1
  • Duplicated block (7–9 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:93 — jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:93-99 | jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:126-134 — 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 `jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java:93` 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–7 lines × 3) · ×1
  • Duplicated block (6–7 lines × 3) jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/InstallPluginDialog.java:90 — jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/InstallPluginDialog.java:90-96 | jadx-gui/src/main/java/jadx/gui/ui/dialog/MethodsDialog.java:83-88 | jadx-gui/src/main/java/jadx/gui/ui/export/ExportProjectDialog.java:161-166 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/dialog/MethodsDialog.java:79` calls `JButton`, `str`, `addActionListener` and `jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/InstallPluginDialog.java:88` 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 × 3) · ×1
  • Duplicated block (7 lines × 3) jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:206 — jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:206-212 | jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:222-228 | jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:238-244 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-gui/src/main/java/jadx/gui/treemodel/ApkSignatureNode.java:206` 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 (5 lines × 5) · ×1
  • Duplicated block (5 lines × 5) jadx-gui/src/main/java/jadx/gui/ui/dialog/AboutDialog.java:59 — jadx-gui/src/main/java/jadx/gui/ui/dialog/AboutDialog.java:59-63 | jadx-gui/src/main/java/jadx/gui/ui/dialog/CommentDialog.java:159-163 | jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:229-233 | jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java:83-87 | jadx-gui/src/main/java/jadx/gui/ui/panel/JDebuggerPanel.java:317-321 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `jadx-gui/src/main/java/jadx/gui/ui/panel/JDebuggerPanel.java:324` calls `add`, `createRigidArea`, `Dimension` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/AboutDialog.java:66` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (16–17 lines × 2) · ×1
  • Duplicated block (16–17 lines × 2) jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/KotlinMetadataUtils.kt:47 — jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/KotlinMetadataUtils.kt:47-63 | jadx-plugins/jadx-kotlin-source-debug-extension/src/main/kotlin/jadx/plugins/kotlin/smap/utils/KotlinSmapUtils.kt:44-59 — 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 `jadx-plugins/jadx-kotlin-metadata/src/main/kotlin/jadx/plugins/kotlin/metadata/utils/KotlinMetadataUtils.kt:47` 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.
X15 · Unvalidated length from an untrusted reader · Length read from the parsed input is spent without ever being bounded · ×1
  • Length read from the parsed input is spent without ever being bounded jadx-core/src/main/java/jadx/core/clsp/ClsSet.java:321 — `clsCount` is read from the bytes being parsed at line 320 (`readInt`), then used to size a `new ClspClass[]` at line 321 — and nowhere in its scope is `clsCount` bounded from above — compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an `OutOfMemoryError` or, negative, throws `NegativeArraySizeException` out of a parser whose failure path was written for malformed input, not for hostile input. Bound `clsCount` against the bytes actually remaining and a maximum the format allows before allocating.
Minor — 117 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×65
  • Orphaned file jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/state/TraverserActivePathState.java: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 jadx-gui/src/main/java/jadx/gui/ui/panel/LogcatPanel.java: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 jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java: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 jadx-gui/src/main/java/jadx/gui/ui/codearea/SmaliArea.java: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 jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java: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 jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java: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 jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/fallback/FallbackSyncer.java: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 jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java: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 jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java: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 jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexSearchBar.java: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 jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java: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 jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java: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 jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java: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 jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java: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 jadx-gui/src/main/java/jadx/gui/utils/tools/SyncNLSLines.java: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 jadx-gui/src/main/java/jadx/gui/ui/tab/QuickTabsTree.java: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 jadx-gui/src/main/java/jadx/gui/device/debugger/BreakpointManager.java: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 jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/CommonProtoParser.java: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 jadx-gui/src/main/java/jadx/gui/ui/hexviewer/BinEdCodeAreaAssessor.java: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 jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/ResXmlProtoParser.java: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 jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/fallback/MethodDeclaration.java: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 jadx-gui/src/main/java/jadx/gui/ui/action/XposedAction.kt: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 jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetSmaliSyncer.java: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 jadx-core/src/main/java/jadx/core/dex/visitors/finaly/TryCatchEdgeBlockMap.java: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 jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java: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.
  • + 40 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×25
  • Duplicated predicate jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:441 — `assignInsn != null && assignInsn.getType() == InsnType.CHECK_CAST` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java, jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.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 jadx-core/src/main/java/jadx/core/dex/instructions/args/SSAVar.java:188 — `assignInsn != null && assignInsn.getType() == InsnType.PHI` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/instructions/args/SSAVar.java, jadx-core/src/main/java/jadx/core/dex/visitors/ssa/SSATransform.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 jadx-gui/src/main/java/jadx/gui/search/providers/ClassSearchProvider.java:25 — `cancelable.isCanceled() || clsNum >= classes.size()` appears character-identically in 2 files — jadx-gui/src/main/java/jadx/gui/search/providers/ClassSearchProvider.java, jadx-gui/src/main/java/jadx/gui/search/providers/CodeSearchProvider.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 jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:86 — `constField && !fld.getAccessFlags().isPrivate()` appears character-identically in 2 files — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java, jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.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 jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/JavaSyncer.java:20 — `debugLineSyncer.syncTo(to) || insnOffsetSyncer.syncTo(to)` appears character-identically in 2 files — jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/JavaSyncer.java, jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/SmaliSyncer.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 jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/TraverserController.java:134 — `finallyBlock != null && candidateBlock != null` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/TraverserController.java, jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/handlers/InstructionActivePathTraverserHandler.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 jadx-core/src/main/java/jadx/core/utils/Pair.java:30 — `first.equals(other.first) && second.equals(other.second)` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/utils/Pair.java, jadx-core/src/main/java/jadx/core/utils/blocks/BlockPair.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 jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:186 — `lastInsn != null && lastInsn.getType() == InsnType.IF` appears character-identically in 3 files — jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java, jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java, jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.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 jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:157 — `lastInsn == null || lastInsn.getType() != InsnType.IF` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java, jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.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 jadx-gui/src/main/java/jadx/gui/ui/codearea/AbstractCodeArea.java:308 — `len > 2 && str.startsWith("\"") && str.endsWith("\"")` appears character-identically in 2 files — jadx-gui/src/main/java/jadx/gui/ui/codearea/AbstractCodeArea.java, jadx-gui/src/main/java/jadx/gui/ui/codearea/ConvertNumberAction.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 jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:83 — `mainWindow.getSettings().isReplaceConsts() && node instanceof JField` appears character-identically in 2 files — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java, jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.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 jadx-core/src/main/java/jadx/core/dex/visitors/ClassModifier.java:153 — `mth.isNoCode() || mth.contains(AFlag.DONT_GENERATE)` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/ClassModifier.java, jadx-core/src/main/java/jadx/core/dex/visitors/ProcessMethodsForInline.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 jadx-core/src/main/java/jadx/core/dex/visitors/AdjustForIfMergeVisitor.java:30 — `mth.isNoCode() || mth.getBasicBlocks() == null` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/AdjustForIfMergeVisitor.java, jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.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 jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockFinisher.java:10 — `mth.isNoCode() || mth.getBasicBlocks().isEmpty()` appears character-identically in 4 files — jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockFinisher.java, jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java, jadx-core/src/main/java/jadx/core/dex/visitors/regions/CleanRegions.java, jadx-core/src/main/java/jadx/core/dex/visitors/regions/RegionMakerVisitor.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 jadx-core/src/main/java/jadx/core/dex/visitors/regions/variables/ProcessVariables.java:45 — `mth.isNoCode() || mth.getSVars().isEmpty()` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/regions/variables/ProcessVariables.java, jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FinishTypeInference.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 jadx-core/src/main/java/jadx/core/dex/visitors/finaly/MarkFinallyVisitor.java:95 — `mth.isNoCode() || mth.isNoExceptionHandlers()` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/finaly/MarkFinallyVisitor.java, jadx-core/src/main/java/jadx/core/dex/visitors/regions/ProcessTryCatchRegions.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 jadx-core/src/main/java/jadx/core/dex/info/FieldInfo.java:77 — `name.equals(other.name) && type.equals(other.type)` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/info/FieldInfo.java, jadx-gui/src/main/java/jadx/gui/treemodel/JResource.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 jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:125 — `node instanceof JField && mainWindow.getSettings().isReplaceConsts()` appears character-identically in 2 files — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java, jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.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 jadx-gui/src/main/java/jadx/gui/ui/action/CopyReferenceAction.java:44 — `node instanceof JMethod || node instanceof JClass || node instanceof JField` appears character-identically in 5 files — jadx-gui/src/main/java/jadx/gui/ui/action/CopyReferenceAction.java, jadx-gui/src/main/java/jadx/gui/ui/action/CopySmaliReferenceAction.java, jadx-gui/src/main/java/jadx/gui/ui/action/FridaAction.java, jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.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 jadx-core/src/main/java/jadx/core/dex/nodes/FieldNode.java:152 — `obj == null || getClass() != obj.getClass()` appears character-identically in 3 files — jadx-core/src/main/java/jadx/core/dex/nodes/FieldNode.java, jadx-core/src/main/java/jadx/core/dex/nodes/MethodNode.java, jadx-core/src/main/java/jadx/core/dex/trycatch/TryCatchBlockAttr.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 jadx-core/src/main/java/jadx/core/dex/visitors/shrink/CodeShrinkVisitor.java:157 — `parentInsn != null && parentInsn.getType() == InsnType.INVOKE` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/shrink/CodeShrinkVisitor.java, jadx-core/src/main/java/jadx/core/dex/visitors/ssa/SSATransform.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 jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/types/JavaAnnotationsAttr.java:63 — `runtimeAnnAttr == null && buildAnnAttr == null` appears character-identically in 2 files — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/types/JavaAnnotationsAttr.java, jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/types/JavaParamAnnsAttr.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 jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:439 — `sVar != null && sVar.getUseCount() == 1 && !sVar.isUsedInPhi()` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java, jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.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 jadx-gui/src/main/java/jadx/gui/ui/action/JadxAutoCompletion.java:45 — `shortcut != null && shortcut.isKeyboard()` appears character-identically in 2 files — jadx-gui/src/main/java/jadx/gui/ui/action/JadxAutoCompletion.java, jadx-gui/src/main/java/jadx/gui/utils/shortcut/ShortcutsController.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 jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java:268 — `supMth.getMethodInfo().getShortId().startsWith(signature) && !supMth.getAccessFlags().isStatic()` appears character-identically in 2 files — jadx-core/src/main/java/jadx/core/dex/visitors/MethodThrowsVisitor.java, jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.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.
X4 · Structured logging · Interpolated log message defeats structured logging · ×5
  • Interpolated log message defeats structured logging jadx-core/src/main/java/jadx/core/utils/DecompilerScheduler.java:149 — `info` at line 149 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.info("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text.
  • Interpolated log message defeats structured logging jadx-gui/src/main/java/jadx/gui/cache/code/disk/DiskCodeCache.java:118 — `error` at line 118 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.error("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text.
  • Interpolated log message defeats structured logging jadx-gui/src/main/java/jadx/gui/cache/manager/CacheManager.java:90 — `error` at line 90 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.error("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text.
  • Interpolated log message defeats structured logging jadx-gui/src/main/java/jadx/gui/events/services/RenameService.java:143 — `debug` at line 143 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.debug("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text.
  • Interpolated log message defeats structured logging jadx-gui/src/main/java/jadx/gui/jobs/DecompileTask.java:105 — `info` at line 105 is handed a message assembled at the call — a string concatenated with a value, or `String.format` — through SLF4J or log4j 2, so the logger receives one finished string: the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the level is filtered out. Pass a constant pattern and the values beside it instead: `log.info("Order {} moved to {}", orderId, status)`, which keeps the pattern and its arguments apart on the event for a structured encoder (logstash-logback-encoder, log4j 2's JsonTemplateLayout, OpenTelemetry), or `log.atInfo().addKeyValue("order_id", orderId).log("order moved")` with SLF4J 2's fluent API. An exception goes last, as the throwable argument, not into the text.
AX6 · Interface segregation · Fat interface · ×4
  • Fat interface: InsnData (22 abstract methods) jadx-plugins/jadx-input-api/src/main/java/jadx/api/plugins/input/insns/InsnData.java:10 — `InsnData` declares 22 abstract methods: `decode`, `getByteCode`, `getFileOffset`, `getIndex`, `getIndexAsCallSite`, `getIndexAsField`, `getIndexAsMethod`, `getIndexAsMethodHandle`, `getIndexAsProto`, `getIndexAsString`, `getIndexAsType`, `getIndexType`, `getLiteral`, `getOffset`, `getOpcode`, `getOpcodeMnemonic`, `getPayload`, `getRawOpcodeUnit`, `getReg`, `getRegsCount`, `getResultReg`, `getTarget`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: JadxGuiContext (18 abstract methods) jadx-core/src/main/java/jadx/api/plugins/gui/JadxGuiContext.java:17 — `JadxGuiContext` declares 18 abstract methods: `addMenuAction`, `addPopupMenuAction`, `addTreePopupMenuEntry`, `applyNodeRename`, `copyToClipboard`, `getEnclosingNodeUnderCaret`, `getEnclosingNodeUnderMouse`, `getMainFrame`, `getNodeUnderCaret`, `getNodeUnderMouse`, `getSVGIcon`, `open`, `openUsageDialog`, `registerGlobalKeyBinding`, `reloadActiveTab`, `reloadAllTabs`, `settings`, `uiRun`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: ICodeWriter (26 abstract methods) jadx-core/src/main/java/jadx/api/ICodeWriter.java:10 — `ICodeWriter` declares 26 abstract methods: `add`, `add`, `add`, `addIndent`, `addMultiLine`, `attachAnnotation`, `attachDefinition`, `attachLineAnnotation`, `attachSourceLine`, `decIndent`, `finish`, `getCodeStr`, `getIndent`, `getLength`, `getLine`, `getLineStartPos`, `getRawAnnotations`, `getRawBuf`, `incIndent`, `isMetadataSupported`, `newLine`, `setIndent`, `startLine`, `startLine`, `startLine`, `startLineWithNum`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. Those 26 declarations carry 22 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 22 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: IAttributeNode (19 abstract methods) jadx-core/src/main/java/jadx/core/dex/attributes/IAttributeNode.java:9 — `IAttributeNode` declares 19 abstract methods: `add`, `addAttr`, `addAttr`, `addAttrs`, `clearAttributes`, `contains`, `contains`, `copyAttributeFrom`, `copyAttributesFrom`, `get`, `getAll`, `getAnnotation`, `getAttributesString`, `getAttributesStringsList`, `isAttrStorageEmpty`, `remove`, `remove`, `removeAttr`, `rewriteAttributeFrom`. Counted over its ABSTRACT methods, once per signature; `default`, `static` and `private` methods and constants are not counted, because no implementer is forced to write them. Those 19 declarations carry 16 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 16 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
X7 · Silent fallback defaults · Silent fallback default in catch · ×2
  • Silent fallback default in catch jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/RenameMappingsPlugin.java:53 — `getFileHashString` swallows every exception into `return ""` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
  • Silent fallback default in catch jadx-plugins-tools/src/main/java/jadx/plugins/tools/resolvers/github/GithubTools.java:121 — `getResponseString` swallows every exception into `return ""` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×2
  • Silent fallback default on parse failure jadx-gui/src/main/java/jadx/gui/ui/codearea/ConvertNumberAction.java:182 — `tryParseInt` returns `0` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
  • Silent fallback default on parse failure jadx-gui/src/main/java/jadx/gui/ui/codearea/ConvertNumberAction.java:190 — `tryParseLong` returns `0` when `NumberFormatException` is thrown, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 42 significant file(s) lose their only recent owner: jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeUpdate.java, jadx-core/src/main/java/jadx/core/utils/RegionUtils.java, jadx-core/src/main/java/jadx/core/codegen/MethodGen.java, jadx-core/src/main/java/jadx/core/utils/Utils.java, REDACTED, jadx-gui/src/main/java/jadx/gui/cache/usage/UsageFileAdapter.java, jadx-core/src/main/java/jadx/core/utils/StringUtils.java, jadx-core/src/main/java/jadx/core/utils/DebugChecks.java (+34 more). Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 7 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (50 single-owned of 464 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 464 of the 1295 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)) (+1 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: REDACTED, jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLStrings.java, jadx-core/src/main/java/jadx/core/dex/visitors/ExtractFieldInit.java, jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java, jadx-gui/src/main/java/jadx/gui/utils/DesktopEntryUtils.java, jadx-core/src/main/java/jadx/core/utils/ImmutableList.java, jadx-gui/src/main/java/jadx/gui/ui/popupmenu/JPackagePopupMenu.java, jadx-core/src/main/java/jadx/core/deobf/FileTypeDetector.java.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 2 of 21 project(s) overshoot their size bounds, lowering Project Cohesion to 8.1/10. The most over is `jadx-core` (68302 LoC, 588 module-visible types across 95 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 65 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: jadx-core/src/main/java/jadx/core/dex/visitors/finaly/traverser/state/TraverserActivePathState.java, jadx-gui/src/main/java/jadx/gui/ui/panel/LogcatPanel.java, jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java, jadx-gui/src/main/java/jadx/gui/ui/codearea/SmaliArea.java, jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java, jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java, jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/fallback/FallbackSyncer.java, jadx-gui/src/main/java/jadx/gui/ui/startpage/StartPagePanel.java (and 57 more) (68 orphaned of 477 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 477 of the 1295 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
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.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add spotbugs with find-sec-bugs (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 10632 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.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
X5 · Nullable reference types · Java packages are not null-marked everywhere · ×1
  • Java packages are not null-marked everywhere — 0/224 of this repository's Java package directories are under a non-null default: a `package-info.java` declaring `@NullMarked` (JSpecify) or `@NonNullApi`, `@ParametersAreNonnullByDefault`, `@NonNullByDefault`, `@DefaultQualifier(NonNull.class)`; a `module-info.java` declaring `@NullMarked`; every type in it `@NullMarked`; or a build that runs NullAway with the package in `AnnotatedPackages`, or the Checker Framework's `NullnessChecker`. Elsewhere every reference admits null and no checker warns on the dereference that throws a `NullPointerException`.
X9 · Subsumed condition operand · Subsumed condition operand · ×1
  • Subsumed condition operand jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/fallback/JavaCodeAreaLine.java:41 — `l.startsWith("} else if ")` can never decide this `||` — every value satisfying `l.startsWith("} else if ")` also satisfies `l.startsWith("} else ")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Minor — 2 finding(s)
D5 · Coupling · Off the main sequence · ×2
  • Off the main sequence: :jadx-commons:jadx-app-commons — :jadx-commons:jadx-app-commons: abstractness 0.00, instability 0.00, distance 1.00 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.
  • Off the main sequence: :jadx-commons:jadx-zip — :jadx-commons:jadx-zip: abstractness 0.19, instability 0.00, distance 0.81 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-613f1163c4c943e190b980ca7b88cb29/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/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-613f1163c4c943e190b980ca7b88cb29/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .45artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnone (dependency manifest found, not scanned for vulnerabilities here)—none (dependency manifest found, not scanned for vulnerabilities here): 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 Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — 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: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesnone (dependency manifest found, not scanned for vulnerabilities here)—none (dependency manifest found, not scanned for vulnerabilities here): 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 Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — not scanned yet).0—

Run 01a16661-4d18-7f00-a5b8-d353ea38c16d · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Issues: 45 · Warnings: 685 · Recommendations: 117 · Info: 2 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 23-10-2026 @ 01:30 UTC.

Downloadable artifacts

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

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