Public report — jadx, published 5 Aug 2026. Concrete security findings (CVE IDs, secret matches, dependency versions) are hidden in this version; ask the repo owner for the full report.
Watchdog 05-08-2026 @ 03:17 UTC Public
Code Health Audit

Skylot/jadx

No baseline yet — first run
60% Adequate
CriticalWeakAdequateStrongExemplary
middle

Large · 132,996 LoC · rebuild ~1.2 person-years · weakest lens: Security (55%)

Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸

22/24dimensions tool-verifieddeterministic · confidence 1.0 · 2 LLM-assisted, advisory
495findings with an exact file:lineof 507 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
24/93dimensions across the health lenses132996 LoC — wide & deep

Executive summary

Read through the Production lens — the standard calibration. *Green* means good enough to run in production. The score is absolute and comparable across repos.

skylot/jadx is sound in substance but carries real gaps (60%). It is not in crisis, but the issues below raise the cost of changing it — friction its consumers ultimately inherit.

It is strongest in Architecture (100%) — the structure is clean and changes stay contained. Code Health (75%) is solid too.

The area that most needs attention is Security (55%) — exposure to security and compliance incidents is elevated. Maturity (58%) is the next concern — onboarding is slow — key decisions and the architecture aren't written down, so contributors have to reverse-engineer the intent.

Leadership focus, highest impact first: Record significant decisions one document per decision (Architecture documentation); SAST step to CI running what this repository's stack ships (Security & performance tooling); Keep a changelog (e.g. Keep-a-Changelog) recording what shipped… (Release Hygiene).

For scale: Large (~132,996 production lines); rebuilding it from scratch would take roughly ~1.2 person-years (~1–3 engineers). Approximate, ±~30%.

It builds on a genuinely strong Architecture foundation (100%); the priorities above are the highest-leverage way to bring the rest up to that level.

How the score is built — each lens's share of the headline Width is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
Security 55% · 47% weightMaturity 58% · 26% weightReadiness 59% · 14% weightCode Health 75% · 8% weightArchitecture 100% · 4% weight

No single dominant problem — the weakest areas are close, so progress on any of them moves the score.

Code composition — where the lines go
Tests 100%
Rebuild cost & value ~ Modeled — €57,000–€290,000
Cost to rebuild€57,000–€290,000 (0.6–1.8 person-years (952–3,019 h), ~1–3 engineers)
Domain complexityStandard — harder problems cost more per line
Quality factor0.8× (at 60% quality) — the last 20% of quality is most of the work
Size & shapeLarge · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)

This codebase represents roughly ~1.2 person-years of build effort (about ~€170,000 to rebuild). Its weakest lens is Security at 55% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × a 0.8× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).

Top priorities

The highest-leverage moves; the full ranked list is in the Roadmap below.

1
Resolve the 2 High finding(s) in Data Compliance (PII/GDPR) — start with FallbackSyncer.java, ADBDialog.java.
+2.5 pts · Low effort · Data Compliance (PII/GDPR)
2
Resolve the 1 The GitHub release artifact section is a boilerplate template and does… finding(s) in Documentation Quality — start with README.md.
+2.3 pts · Low effort · Documentation Quality
3
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
+4.6 pts · Medium effort · Architecture documentation

Diagnosis — what's actually going on

The top fix pays for itself · High · Economics
The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 1.2–8.2 engineer-days every year, paid as drag on the ~24,682 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–29 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 2–5% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.
Evidence: D15 churn: 6,086 line(s) changed over a 90-day window ⇒ ~24,682/year · D1/D2/D4 code quality: averaging 7.4/10 ⇒ a 2–5% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)
→ Do the top-ranked fix now if this code will still be yours in 29 months.
Value concentrated against a weak lens · Medium · Value at risk
This is a Large asset (~1.2 person-years to rebuild), and its weakest lens is Security at 55%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
Evidence: valuation: Large, ~1.2 person-years rebuild (132,996 LoC) · weakest lens: Security 55%
→ Direct remediation budget at Security first — highest risk-reduction per euro on an asset this size.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form). The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 7.4/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 2–5% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)
Evidence: D1/D2/D4 code quality: averaging 7.4/10 across the code-quality signals actually measured
→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.

Architecture — module dependency matrix

244 modules, 950 dependencies — 11 dependency cycles, shown as the red cell(s) above the diagonal. Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)

(global)jadx.api.datajadx.api.metadata…input.data.attributes…i.plugins.input.insns…ex.regions.conditionsjadx.core.xmlgenjadx.zipjadx.api.plugins.gui…nput.data.annotationsjadx.api.plugins…pi.plugins.input.datajadx.core.dex.visitorsjadx.core.plugins…ns.input.dex.sections…ugins.input.java.data….dex.visitors.regionsjadx.core.utilsjadx.core.dex.trycatchjadx.core.codegenjadx.core.dex.nodes…core.dex.instructions….dex.attributes.nodes…x.core.dex.attributes…dex.instructions.argsjadx.core.dex.infojadx.apijadx.gui.ui.dialogjadx.gui.utilsjadx.gui.ui.tabjadx.gui.ui.paneljadx.gui.ui.codeareajadx.gui.ui.actionjadx.gui.uijadx.gui.settingsjadx.gui.jobsjadx.gui.treemodel…x.gui.plugins.contextjadx.gui….gui.search.providers(global)1jadx.api.data2jadx.api.metadata3…input.data.attributes4…i.plugins.input.insns5…ex.regions.conditions6jadx.core.xmlgen7jadx.zip8jadx.api.plugins.gui9…nput.data.annotations10jadx.api.plugins11…pi.plugins.input.data12jadx.core.dex.visitors13jadx.core.plugins14…ns.input.dex.sections15…ugins.input.java.data16….dex.visitors.regions17jadx.core.utils18jadx.core.dex.trycatch19jadx.core.codegen20jadx.core.dex.nodes21…core.dex.instructions22….dex.attributes.nodes23…x.core.dex.attributes24…dex.instructions.args25jadx.core.dex.info26jadx.api27jadx.gui.ui.dialog28jadx.gui.utils29jadx.gui.ui.tab30jadx.gui.ui.panel31jadx.gui.ui.codearea32jadx.gui.ui.action33jadx.gui.ui34jadx.gui.settings35jadx.gui.jobs36jadx.gui.treemodel37…x.gui.plugins.context38jadx.gui39….gui.search.providers401215111313126111121143113122421222783421311124441617131142391801415113912486161038419221142212682114510226111361312167111814813292561351251298135134333221811312512117632110342831411112941113221142173411917352171196476233141111131435312212162212112221254111232551333252521312712212121013717132+204 more modules (most-connected shown)

At a glance — Code Health · 75% · Strong

At a glance — Architecture · 100% · Exemplary

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

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

At a glance — Security · 55% · Adequate · gated by D29, D36

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
A03:2021 — Injection35High / Critical
A04:2021 — Insecure Design2High / Critical

Roadmap

Begin by documenting significant architectural decisions in a centralized `docs/adr/` directory to preserve context and consequences. Next, integrate a SAST step into your CI pipeline to automatically fail builds on security regressions. Maintain a changelog to track each release's changes, and update the root README with clear instructions on how to run the test suite. Finally, resolve the 31 high-severity static analysis findings, prioritizing the release and build configuration files.

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

Do thisHelpsEffortDimension
Resolve the 2 High finding(s) in Data Compliance (PII/GDPR) — start with FallbackSyncer.java, ADBDialog.java.+2.5 ptsLowData Compliance (PII/GDPR)
Resolve the 1 The GitHub release artifact section is a boilerplate template and does… finding(s) in Documentation Quality — start with README.md.+2.3 ptsLowDocumentation Quality
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).+4.6 ptsMediumArchitecture documentation
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.+4.2 ptsMediumSecurity & performance tooling
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.+4.2 ptsMediumRelease Hygiene
Add a 'Testing' section to the root README — how to run the test suite.+3.6 ptsMediumDocumentation (README)
Resolve the 31 High finding(s) in Static Analysis (SAST) — start with release.yml (17), build-artifacts.yml (13), dependabot.yml.+3.6 ptsMediumStatic Analysis (SAST)
Resolve the 1 No build provenance finding(s) in Supply-chain Provenance & Signing.+1.6 ptsLowSupply-chain Provenance & Signing

File quality

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

FileScoreBandWorst signal
.github/workflows/build-artifacts.yml4.4MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
.github/workflows/release.yml4.4MixedStatic Analysis (SAST): High: github-actions-mutable-action-tag
jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java4.6MixedData Compliance (PII/GDPR): High: watchdog-sensitive-personal-data-in-log
jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java5.0MixedStatic Analysis (SAST): Medium: unencrypted-socket
jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java5.6MixedCyclomatic Complexity: DebugController.decodeRuntimeValue (cyclomatic 22)
jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/fallback/FallbackSyncer.java5.7MixedData Compliance (PII/GDPR): High: watchdog-sensitive-personal-data-in-log
jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java6.3MixedCognitive Complexity: 2.dispatchKeyEvent (cognitive 26)
jadx-core/src/main/java/jadx/core/utils/files/FileUtils.java6.4MixedStatic Analysis (SAST): Medium: use-of-md5
jadx-gui/src/main/java/jadx/gui/device/protocol/ADB.java6.9MixedStatic Analysis (SAST): Medium: unencrypted-socket
jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java7.0MixedCyclomatic Complexity: LoopRegionMaker.process (cyclomatic 25)
jadx-core/src/main/java/jadx/core/codegen/InsnGen.java7.0MixedCyclomatic Complexity: InsnGen.makeInsnBody (cyclomatic 68)
jadx-core/src/main/java/jadx/core/utils/BlockUtils.java7.0MixedCyclomatic Complexity: BlockUtils.getBottomBlock (cyclomatic 16)
jadx-core/src/main/java/jadx/core/dex/visitors/regions/LoopRegionVisitor.java7.0MixedCyclomatic Complexity: LoopRegionVisitor.checkArrayForEach (cyclomatic 27)
jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java7.0MixedCyclomatic Complexity: IfRegionMaker.mergeNestedIfNodes (cyclomatic 24)
jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java7.0MixedCyclomatic Complexity: BinarySearchServiceImpl.searchForText (cyclomatic 24)
jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java7.0MixedCyclomatic Complexity: EnumVisitor.convertToEnum (cyclomatic 19)
jadx-core/src/main/java/jadx/core/codegen/ClassGen.java7.0MixedCyclomatic Complexity: ClassGen.useClassInternal (cyclomatic 18)
jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java7.0MixedCognitive Complexity: BlockProcessor.mergeConstReturn (cognitive 21)
jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java7.0MixedCognitive Complexity: MainWindow.checkIfCodeHasNonPrintableChars (cognitive 19)
jadx-core/src/main/java/jadx/core/xmlgen/entry/EntryConfig.java7.1MixedCyclomatic Complexity: EntryConfig.generateQualifiers (cyclomatic 75)

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. 22 of 24 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 2 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.6 — 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 — 24 dimensions across the health lenses
D1D2D3D4D13D15D16D19D21D28D29D32D34D35D36D37M1M2M3M4P1P3P4P6

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, 495 of 507 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
jscpdCode duplication✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.302✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.302✓ 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 019fcfec-cda3-7c35-a7b0-2e28b9a027c0.

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.

  • D30 Dependency Vulnerabilities — scanner not present in this environment — The backing tool was not installed where this scan ran, so this dimension was not scored. Install the tool (or run in the hosted environment, where it is always present) for a graded result.

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 (jscpd) — 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.
  • 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.
  • 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.
  • 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.
  • 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").
  • D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • 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 (documentation, ADR quality, naming, comment value, onboarding) — D25 sets the ADR-conformance fraction over sampled code, D22 judges API accuracy over a sample. These 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: DocumentedVerifiedPrevented · effective 6.3 / 10 · rule-coverage 100% · ceiling Prevented

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

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
SwitchOverStringVisitor.collectPart1RegionCases (cyclomatic 35)jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:129
MappingExporter.exportMappings (cyclomatic 35)jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java:57
TypeCompare.compareObjectsNoPreCheck (cyclomatic 31)jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeCompare.java:161

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

What to do

  1. Resolve the 1 EntryConfig.generateQualifiers (cyclomatic 75) finding(s) in Cyclomatic Complexity — start with EntryConfig.java. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 InsnGen.makeInsnBody (cyclomatic 68) finding(s) in Cyclomatic Complexity — start with InsnGen.java. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 SwitchOverStringVisitor.collectPart1RegionCases (cyclomatic 35) finding(s) in Cyclomatic Complexity — start with SwitchOverStringVisitor.java. — One of this dimension's main actionable groups (1 warning-level).
  4. 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: DocumentedVerifiedPrevented · effective 6.3 / 10 · rule-coverage 100% · ceiling Prevented

218 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 78)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
ResXmlGen.addValue (cognitive 61)jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:85
MethodUtils.processMethodArgsOverloaded (cognitive 60)jadx-core/src/main/java/jadx/core/dex/nodes/utils/MethodUtils.java:98

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

What to do

  1. Resolve the 1 SwitchOverStringVisitor.collectPart1RegionCases (cognitive 78) finding(s) in Cognitive Complexity — start with SwitchOverStringVisitor.java. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 MappingExporter.exportMappings (cognitive 78) finding(s) in Cognitive Complexity — start with MappingExporter.java. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 TryCatchBlockAttr.exploreTryPath (cognitive 71) finding(s) in Cognitive Complexity — start with TryCatchBlockAttr.java. — One of this dimension's main actionable groups (1 warning-level).
  4. 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.9 / 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: DocumentedVerifiedPrevented · effective 7.9 / 10 · rule-coverage 100% · ceiling Prevented

71 god class(es) detected.

TooManyMethods: JadxSettings · ×53jadx-gui/src/main/java/jadx/gui/settings/JadxSettings.java:48
FileTooLong: ui/MainWindow.java · ×18jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:0

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 18 FileTooLong finding(s) in God Classes — start with MainWindow.java, DebugController.java, BlockUtils.java. — One of this dimension's main actionable groups (18 warning-level).
  3. 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.7 / 10Exemplary✓ 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: DocumentedVerifiedPrevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Verified

92 duplicated block group(s) detected.

Duplicated block (7 lines × 2) · ×22jadx-core/src/main/java/jadx/api/data/impl/JadxCodeComment.java:82
Duplicated block (8 lines × 2) · ×17jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:109
Duplicated block (6 lines × 2) · ×12jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:843
Duplicated block (10 lines × 2) · ×10jadx-core/src/main/java/jadx/api/plugins/utils/Utils.java:36
Duplicated block (5 lines × 2) · ×9jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:577

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

✓ On the Gold path — maintain.

Detailed fixes: d4_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: DocumentedVerifiedPrevented · 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 Hotspots9.9 / 10Exemplary✓ Tool-verified

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

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

Maturity: DocumentedVerifiedPrevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java (3×20=60); jadx-gui/src/main/java/jadx/gui/treemodel/JResource.java (2×19=38)

Hotspot: jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java · ×2jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java

✓ On the Gold path — maintain.

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

D16 · Bus Factor8.4 / 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: DocumentedVerifiedPrevented · effective 8.4 / 10 · rule-coverage 100% · ceiling Documented

74 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java.

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

What to do

  1. Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 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.

D19 · Documentation Quality / 10Strong◐ 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: DocumentedVerifiedPrevented · effective Strong / 10 · rule-coverage 100% · ceiling Documented

The README documentation is strong and complete for a decompiler tool — it opens with an excellent build/status badge wall, a clear warning about incompleteness, main features, jadx-gui features with links to the wiki, and a detailed call-graph example. It also documents the input-api plugin, zip reader, app-commons modules, analysis utilities, and JFlex flex uniting for SmaliTokenMarker, plus supported publish locations for plugins. The README files are well-organized but there is no architecture or design documentation (the outline marker clips mid-call-graph section), so a dedicated architecture doc would add value.

The GitHub release artifact section is a boilerplate template and does not explain how to install the plugin from the published artifacts.jadx-plugins-tools/src/main/java/jadx/plugins/tools/resolvers/README.md

What to do

  1. Resolve the 1 The GitHub release artifact section is a boilerplate template and does… finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).

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

D21 · Naming Consistency / 10Exemplary◐ 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: DocumentedVerifiedPrevented · 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.

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: Git-history secret scan via gitleaks detect over full history in an isolated checkout; each match flagged High. Exhaustive; degrades cleanly when tool absent.

Maturity: DocumentedVerifiedPrevented · 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)0.0 / 10Critical✓ Tool-verified

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

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

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

Maturity: DocumentedVerifiedPrevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

35 finding(s): 0 critical, 31 high, 4 medium, 0 low.

High: dependabot-missing-cooldown · ×31.github/dependabot.yml:4detected by semgrep finding
Medium: use-of-md5 · ×4jadx-core/src/main/java/jadx/core/utils/files/FileUtils.java:497detected by semgrep finding

What to do

  1. Resolve the 31 High finding(s) in Static Analysis (SAST) — start with release.yml (17), build-artifacts.yml (13), dependabot.yml. — One of this dimension's main actionable groups (31 issue-level).
  2. Resolve the 4 Medium finding(s) in Static Analysis (SAST) — start with ADB.java (2), FileUtils.java, SmaliDebugger.java. — One of this dimension's main actionable groups (4 warning-level).

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

D32 · Data Compliance (PII/GDPR)5.0 / 10Adequate✓ Tool-verified

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

Method: Heuristic PII/GDPR pattern scan via semgrep across the repo, using Watchdog's own ruleset (personal data reaching log/console sinks, URLs and query strings, or unprotected browser storage); matches map to severity and a 0-10 wide normalizer. NotApplicable when the scan runs and detects no PII/GDPR surface (no unearned 10); reported LOUDLY as a measurement gap, never as not-applicable, if the ruleset is missing from the analyzer image. Exhaustive, advisory-leaning; degrades on parse failure.

Maturity: DocumentedVerifiedPrevented · effective 5.0 / 10 · rule-coverage 100% · ceiling Documented

2 finding(s): 0 critical, 2 high, 0 medium, 0 low.

High: watchdog-sensitive-personal-data-in-log · ×2jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/fallback/FallbackSyncer.java:55detected by semgrep finding

What to do

  1. Resolve the 2 High finding(s) in Data Compliance (PII/GDPR) — start with FallbackSyncer.java, ADBDialog.java. — One of this dimension's main actionable groups (2 issue-level).

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

D34 · Knowledge Freshness8.6 / 10Strong✓ 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: DocumentedVerifiedPrevented · effective 8.6 / 10 · rule-coverage 100% · ceiling Documented

64 of 475 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java.

Orphaned knowledge · ×2jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java
Further orphaned files (smaller)

What to do

  1. Resolve the 2 Orphaned knowledge finding(s) in Knowledge Freshness — start with SmaliDebugger.java, Smali.java. — One of this dimension's main actionable groups (2 issue-level).
  2. 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; coupling through a build step, config, or non-source file isn't seen.

Maturity: DocumentedVerifiedPrevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: BackgroundExecutor.java↔DecompileTask.java 70%; TabbedPane.java↔JumpManager.java 58%; DebugController.java↔ADBDialog.java 55%

Change coupling: BackgroundExecutor.java ↔ DecompileTask.java · ×3jadx-gui/src/main/java/jadx/gui/jobs/BackgroundExecutor.java

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.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: DocumentedVerifiedPrevented · effective 2.5 / 10 · rule-coverage 100% · ceiling Documented

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

Unpinned build actions
PR-triggered workflow without a permissions block
No build provenance
No SBOM

What to do

  1. Resolve the 1 Unpinned build actions finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 PR-triggered workflow without a permissions block finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 No build provenance finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

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: DocumentedVerifiedPrevented · 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.

Frontend & cross-cutting dimensions

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

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

  • Add a 'Testing' section to the root README — 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 17 of 21 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 `NNNN-title.md` documents 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/PlantUML/Mermaid diagram or architecture.md — the high-level shape isn't documented.

What to do

  • Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
  • 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.

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

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 Health75%StrongSolid.
Architecture100%ExemplaryStrongest area.
Maturity58%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness59%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security55%Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Not included — 69 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — no DI registrations detected
  • AX10 Code composition — not assessed — code composition is computed by ROLE over a document set 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
  • AX2 Stateful singletons — no singleton implementations detected
  • AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository 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
  • AX4 Dependency direction — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository 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
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — not assessed — interface segregation is computed over a type surface 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 — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) that was not loaded for this repository, because the repository 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
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • 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.
  • 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.
  • D10 Test Quality — ~26910 lines of test source are present (.java) but the test-quality collector reads C# only, so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included
  • D12 Dependency Hygiene — Dependency hygiene not measured — dependency manifest found but not parsed for hygiene
  • D14 License Compliance — Not scored — this repository's package manifest is not parsed for licence data yet. A gap in the analyzer's language coverage, NOT a finding that the repository's licenses are compliant (a Gradle version catalogue), which this pass does not parse yet — so this dimension asserts nothing about this repository's licensing in either direction.
  • D17 Explicit Debt — explicit-debt markers are read through a C# workspace today, so they were not read for this repository's language — this asserts nothing about how many markers the code carries. Not scored — this is a gap in the analyzer, not a finding about this repository
  • 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.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D22 Internal API Consistency — No exposed public API
  • D23 Boundary Type-Coupling — Production source is present (.java, .kt) but bounded contexts are resolved over the C#/VB project set, which exposed none, so context scope could not be assessed. Not scored — this is a gap in the analyzer, not a verdict about this repository. Declaring the codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed — see the recommendation on this dimension for where. 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
  • D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
  • D27 Navigability — No calls could be sampled, so navigability was not assessed — tracing effort is measured over resolved call sites and this target exposed none. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
  • 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 version catalogue — not scanned yet) — where an OSV-supported manifest exists, dependency vulnerabilities for this repository are reported under D38 instead.
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
  • D33 JS/npm Dependency Vulnerabilities — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
  • D38 OSV Dependency Vulnerabilities — No supported non-.NET dependency lockfile found outside build output (npm package-lock/yarn/pnpm/bun, Go go.mod, Rust Cargo.lock, Maven pom.xml, Gradle lockfiles, Python requirements.txt/poetry.lock/Pipfile.lock/pdm.lock, PHP composer.lock, Ruby Gemfile.lock, Elixir mix.lock, Dart pubspec.lock, Swift Package.resolved); nothing for OSV to scan. A NuGet-only repo stays NotApplicable — .NET CVEs are D30's domain.
  • 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.
  • D5 Coupling — Inter-project coupling could not be assessed — no analyzable project graph was found for this repository. Not scored: a gap in the analyzer's reach, not a verdict about this repository. (Coupling here is Martin afferent/efferent/instability plus reference cycles across a project-reference graph, read today from .NET project files; other ecosystems' module graphs are not read yet.)
  • D6 Cohesion (LCOM4) — Cohesion (LCOM4) is measured over a C#/VB class graph, and this repository's production source is .java, .kt, which this pass does not read — so no class could be assessed. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • 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
  • D9 Test Distribution — Test source is present (.java) but the test-pyramid classifier reads C# only, so its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 251 value object(s); 1 domain event(s)
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this check 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 check looks for
  • GD1 Unfinished & placeholder code — no source files
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, 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'.
  • P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, 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
  • P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
  • P8 Schema migrations — not assessed — schema-migration practice is read from a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • 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) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
  • PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
  • PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
  • 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.
  • X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository

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.

Issue — 35 finding(s)
D29 · Static Analysis (SAST) · High · ×31
  • High: dependabot-missing-cooldown .github/dependabot.yml:4 — This Dependabot configuration does not set a cooldown period. Newly published packages can be malicious or unstable. Add a `cooldown` block with `default-days: 7` to each `package-ecosystem` entry under `updates` to wait 7 days before proposing updates to newly published package versions. Reference: https://docs.github.com/en/code-security/dependabot/dependabot-version-updates/configuration-options-for-the-dependabot.yml-file#cooldown. This is a semgrep security-AUDIT rule reporting a POLICY that is absent or weaker than its recommendation, not an exploitable defect. Confirm whether the current setting is a deliberate decision for this repository — and apply the change where it is not; where it is (a policy your release process already enforces elsewhere, or one this repository has consciously opted out of), record the decision and leave the configuration as it is.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:11 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v7`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:16 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-java@<40-character SHA>`. This step references `actions/setup-java@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-java/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:28 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: gradle/actions/setup-gradle@<40-character SHA>`. This step references `gradle/actions/setup-gradle@v6`; resolve the SHA it points at today with `gh api repos/gradle/actions/commits/v6 --jq .sha`. `gradle/actions/setup-gradle` is hosted INSIDE the `gradle/actions` repository (a subdirectory action or a reusable workflow), so the SHA to pin is that repository's commit — keep the full `gradle/actions/setup-gradle` path in `uses:` and query only `gradle/actions`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:36 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v7`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:46 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v7`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:57 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v7`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:62 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: oracle-actions/setup-java@<40-character SHA>`. This step references `oracle-actions/setup-java@v1`; resolve the SHA it points at today with `gh api repos/oracle-actions/setup-java/commits/v1 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:78 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: gradle/actions/setup-gradle@<40-character SHA>`. This step references `gradle/actions/setup-gradle@v6`; resolve the SHA it points at today with `gh api repos/gradle/actions/commits/v6 --jq .sha`. `gradle/actions/setup-gradle` is hosted INSIDE the `gradle/actions` repository (a subdirectory action or a reusable workflow), so the SHA to pin is that repository's commit — keep the full `gradle/actions/setup-gradle` path in `uses:` and query only `gradle/actions`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:84 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v7`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:98 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v7`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:103 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-java@<40-character SHA>`. This step references `actions/setup-java@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-java/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:115 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: gradle/actions/setup-gradle@<40-character SHA>`. This step references `gradle/actions/setup-gradle@v6`; resolve the SHA it points at today with `gh api repos/gradle/actions/commits/v6 --jq .sha`. `gradle/actions/setup-gradle` is hosted INSIDE the `gradle/actions` repository (a subdirectory action or a reusable workflow), so the SHA to pin is that repository's commit — keep the full `gradle/actions/setup-gradle` path in `uses:` and query only `gradle/actions`.
  • High: github-actions-mutable-action-tag .github/workflows/build-artifacts.yml:121 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v7`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:16 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v7`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:19 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: oracle-actions/setup-java@<40-character SHA>`. This step references `oracle-actions/setup-java@v1`; resolve the SHA it points at today with `gh api repos/oracle-actions/setup-java/commits/v1 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:24 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/github-script@<40-character SHA>`. This step references `actions/github-script@v9`; resolve the SHA it points at today with `gh api repos/actions/github-script/commits/v9 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:31 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: gradle/actions/setup-gradle@<40-character SHA>`. This step references `gradle/actions/setup-gradle@v6`; resolve the SHA it points at today with `gh api repos/gradle/actions/commits/v6 --jq .sha`. `gradle/actions/setup-gradle` is hosted INSIDE the `gradle/actions` repository (a subdirectory action or a reusable workflow), so the SHA to pin is that repository's commit — keep the full `gradle/actions/setup-gradle` path in `uses:` and query only `gradle/actions`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:37 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v7`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:50 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v7`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:53 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/setup-java@<40-character SHA>`. This step references `actions/setup-java@v5`; resolve the SHA it points at today with `gh api repos/actions/setup-java/commits/v5 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:59 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/github-script@<40-character SHA>`. This step references `actions/github-script@v9`; resolve the SHA it points at today with `gh api repos/actions/github-script/commits/v9 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:66 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: gradle/actions/setup-gradle@<40-character SHA>`. This step references `gradle/actions/setup-gradle@v6`; resolve the SHA it points at today with `gh api repos/gradle/actions/commits/v6 --jq .sha`. `gradle/actions/setup-gradle` is hosted INSIDE the `gradle/actions` repository (a subdirectory action or a reusable workflow), so the SHA to pin is that repository's commit — keep the full `gradle/actions/setup-gradle` path in `uses:` and query only `gradle/actions`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:72 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/upload-artifact@<40-character SHA>`. This step references `actions/upload-artifact@v7`; resolve the SHA it points at today with `gh api repos/actions/upload-artifact/commits/v7 --jq .sha`.
  • High: github-actions-mutable-action-tag .github/workflows/release.yml:83 — GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v7`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v7 --jq .sha`.
  • + 6 more in this group — see findings.md.
D32 · Data Compliance (PII/GDPR) · High · ×2
  • High: watchdog-sensitive-personal-data-in-log jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/fallback/FallbackSyncer.java:55 — Special-category or directly-identifying personal data appears to be written to a log or console sink. Logs are copied, shipped to third parties and retained far longer than the data itself is lawfully needed. Log a stable pseudonymous reference instead of the value.
  • High: watchdog-sensitive-personal-data-in-log jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:531 — Special-category or directly-identifying personal data appears to be written to a log or console sink. Logs are copied, shipped to third parties and retained far longer than the data itself is lawfully needed. Log a stable pseudonymous reference instead of the value.
D34 · Knowledge Freshness · Orphaned knowledge · ×2
  • Orphaned knowledge jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java — 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 — 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.
Warning — 461 finding(s)
D3 · God Classes · TooManyMethods · ×53
  • TooManyMethods: JadxSettings jadx-gui/src/main/java/jadx/gui/settings/JadxSettings.java:48 — TooManyMethods — 187 methods. 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:47 — TooManyMethods — 151 methods. 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. 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 — 116 methods. 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. 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:183 — TooManyMethods — 106 methods. 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. 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:34 — TooManyMethods — 95 methods. 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 jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java:83 — TooManyMethods — 88 methods. 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:69 — TooManyMethods — 69 methods. 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:86 — TooManyMethods — 65 methods. 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:45 — TooManyMethods — 62 methods. 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 — 61 methods. 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. 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. 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 jadx-core/src/main/java/jadx/core/utils/files/FileUtils.java:45 — TooManyMethods — 51 methods. 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. 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. 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. 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 — 45 methods. 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. 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:52 — TooManyMethods — 43 methods. 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:44 — TooManyMethods — 43 methods. 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. 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: BlockProcessor jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:40 — TooManyMethods — 42 methods. 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.
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:82 — jadx-core/src/main/java/jadx/api/data/impl/JadxCodeComment.java:82-88 | jadx-core/src/main/java/jadx/api/data/impl/JadxCodeRename.java:62-68 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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 (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-122 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (7 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:455 — jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:455-461 | jadx-core/src/main/java/jadx/core/dex/visitors/blocks/BlockProcessor.java:758-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 (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: extract the block into a single shared function in that directory and call it from each site, 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.
  • Duplicated block (7 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-194 | jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:197-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-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:188` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/BinaryXMLParser.java:493 — jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:493-499 | jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/ResXmlProtoParser.java:209-215 — 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/Jadx.java:152 — jadx-core/src/main/java/jadx/core/Jadx.java:152-158 | jadx-core/src/main/java/jadx/core/Jadx.java:240-246 — 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/device/debugger/DebugSettings.java:82 — jadx-gui/src/main/java/jadx/gui/device/debugger/DebugSettings.java:82-88 | jadx-gui/src/main/java/jadx/gui/device/debugger/DebugSettings.java:107-113 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (7 lines × 2) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:432 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:432-438 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:742-748 — 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/ui/JadxSettingsWindow.java:432` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (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-64 — 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 begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (7 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:220 — jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:220-226 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:602-608 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • Duplicated block (7 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-87 | jadx-gui/src/main/java/jadx/gui/ui/export/ExportProjectDialog.java:159-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 (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: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • Duplicated block (7 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:107 — jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:107-113 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:88-94 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • Duplicated block (7 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:114 — jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:114-120 | jadx-gui/src/main/java/jadx/gui/ui/panel/SimpleCodePanel.java:205-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:114` 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/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.
  • Duplicated block (7 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-56 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/attributes/AttributesReader.java:77-83 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (7 lines × 2) 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: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • 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: extract the block into a single shared function in that directory and call it from each site, 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.
  • 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/JavaFieldData.java:64 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/JavaFieldData.java:64-70 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/JavaMethodData.java:64-70 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D3 · God Classes · FileTooLong · ×18
  • FileTooLong: ui/MainWindow.java jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:0 — FileTooLong — 1407 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: MainWindow (183-1916). 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:0 — FileTooLong — 1044 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: DebugController (45-1499). 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:0 — FileTooLong — 967 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: BlockUtils (46-1630). 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/SmaliDebugger.java jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java:0 — FileTooLong — 926 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: SmaliDebugger (83-1383). 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:0 — FileTooLong — 800 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: Smali (73-1085). 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:0 — FileTooLong — 758 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: XMLChar (43-1071). 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:0 — FileTooLong — 680 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: JadxCLIArgs (47-1082). 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:0 — FileTooLong — 665 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: FixTypesVisitor (62-967). 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:0 — FileTooLong — 650 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: SearchDialog (98-878). 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:0 — FileTooLong — 628 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: JadxSettingsWindow (83-843). 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:0 — FileTooLong — 619 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: ClassNode (59-1020). 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:0 — FileTooLong — 599 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: ArgType (24-951). 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:0 — FileTooLong — 571 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: BlockProcessor (40-878). 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:0 — FileTooLong — 569 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: EnumVisitor (75-808). 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:0 — FileTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: InsnDecoder (35-697). 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:0 — FileTooLong — 514 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: RootNode (69-795). 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:0 — FileTooLong — 508 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: MethodNode (51-815). 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:0 — FileTooLong — 505 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: JadxArgs (47-926). 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 (8 lines × 2) · ×17
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:109 — jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:109-116 | jadx-core/src/main/java/jadx/core/dex/nodes/IMethodDetails.java:34-41 — 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.
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:117 — jadx-core/src/main/java/jadx/core/clsp/ClspMethod.java:117-124 | jadx-core/src/main/java/jadx/core/dex/nodes/IMethodDetails.java:41-48 — 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/instructions/InvokeCustomRawNode.java:88 — jadx-core/src/main/java/jadx/core/dex/instructions/InvokeCustomRawNode.java:88-95 | jadx-core/src/main/java/jadx/core/dex/instructions/InvokePolymorphicNode.java:55-62 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • Duplicated block (8 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-277 | jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:782-789 — 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/typeinference/FixTypesVisitor.java:270` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 2) 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: extract the block into a single shared function in that directory and call it from each site, 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/utils/android/AndroidManifestParser.java:158 — jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:158-165 | jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:169-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. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-core/src/main/java/jadx/core/utils/android/AndroidManifestParser.java:158` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/utils/ListUtils.java:74 — jadx-core/src/main/java/jadx/core/utils/ListUtils.java:74-81 | jadx-core/src/main/java/jadx/core/utils/Utils.java:348-355 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/utils/ListUtils.java:74` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:1001 — jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:1001-1008 | jadx-core/src/main/java/jadx/core/xmlgen/XMLChar.java:1028-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:1001` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) jadx-core/src/main/java/jadx/core/Jadx.java:127 — jadx-core/src/main/java/jadx/core/Jadx.java:127-134 | jadx-core/src/main/java/jadx/core/Jadx.java:220-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.
  • Duplicated block (8 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-57 | jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:94-101 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (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/ADBDialog.java:182 — jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java:182-190 | jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java:93-100 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • 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: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • Duplicated block (8 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-134 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:444-451 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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 (8 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-150 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:265-272 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (8 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:73 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:73-81 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:101-108 — 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/MainWindow.java:1040 — jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1040-1047 | jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1071-1078 — 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:1040` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×12
  • Duplicated block (6 lines × 2) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:843 — jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:843-848 | jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:851-856 — 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/codegen/ClassGen.java:843` 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-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-345 | jadx-core/src/main/java/jadx/core/dex/visitors/DeboxingVisitor.java:66-71 — 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 (6 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:364 — jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:364-369 | jadx-core/src/main/java/jadx/core/dex/visitors/OverrideMethodVisitor.java:417-422 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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:364` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (6 lines × 2) jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:98 — jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:98-103 | jadx-gui/src/main/java/jadx/gui/device/debugger/LogcatController.java:104-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/device/debugger/LogcatController.java:104` 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 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-171 | jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:231-236 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (6 lines × 2) 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: extract the block into a single shared function in that directory and call it from each site, 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: extract the block into a single shared function in that directory and call it from each site, 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/dialog/CommonSearchDialog.java:207 — jadx-gui/src/main/java/jadx/gui/ui/dialog/CommonSearchDialog.java:207-212 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:591-596 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • Duplicated block (6 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-156 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:273-278 — 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 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: extract the block into a single shared function in that directory and call it from each site, 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 begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (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: extract the block into a single shared function in that directory and call it from each site, 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. 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:309 — jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:309-314 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnsRegister.java:328-333 — 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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×10
  • Duplicated block (10 lines × 2) jadx-core/src/main/java/jadx/api/plugins/utils/Utils.java:36 — jadx-core/src/main/java/jadx/api/plugins/utils/Utils.java:36-45 | jadx-core/src/main/java/jadx/api/plugins/utils/Utils.java:54-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 (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/ui/action/ViewClassInheritanceGraphAction.java:33 — jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassInheritanceGraphAction.java:33-42 | jadx-gui/src/main/java/jadx/gui/ui/action/ViewClassMethodGraphAction.java:33-42 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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 (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 begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 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-125 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:433-442 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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.
  • Duplicated block (10 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:151 — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialog.java:151-160 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:468-477 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/dialog/UsageDialog.java:151` 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-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:246 — jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:246-255 | jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassMethodGraphDialog.java:144-153 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (10 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-135 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/search/service/BinarySearchServiceImpl.java:233-242 — 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 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-gui/src/main/java/jadx/gui/ui/MainWindow.java:1022 — jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1022-1031 | jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1053-1062 — 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:1022` 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-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/insns/DexInsnData.java:246 — jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/insns/DexInsnData.java:246-255 | jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/data/code/JavaInsnData.java:259-268 — 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-dex-input/src/main/java/jadx/plugins/input/dex/insns/DexInsnData.java:246` 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 (5 lines × 2) · ×9
  • Duplicated block (5 lines × 2) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:577 — jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:577-581 | jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:585-589 — 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/codegen/InsnGen.java:577` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:436 — jadx-core/src/main/java/jadx/core/dex/visitors/ModVisitor.java:436-440 | jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.java:265-269 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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.
  • 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/report/ExceptionDialog.java:112 — jadx-gui/src/main/java/jadx/gui/report/ExceptionDialog.java:112-116 | jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/InstallPluginDialog.java:93-97 — 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/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: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
  • 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:202-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.
  • Duplicated block (5 lines × 2) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:187 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:187-191 | 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.
  • Duplicated block (5 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:80 — jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:80-84 | jadx-gui/src/main/java/jadx/gui/ui/codearea/theme/DynamicCodeAreaTheme.java:106-110 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java:84 — jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java:84-88 | jadx-gui/src/main/java/jadx/gui/ui/panel/JDebuggerPanel.java:323-327 — 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 (12 lines × 2) · ×5
  • Duplicated block (12 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:479 — jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:479-490 | jadx-plugins/jadx-aab-input/src/main/java/jadx/plugins/input/aab/parsers/ResXmlProtoParser.java:195-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. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-core/src/main/java/jadx/core/xmlgen/BinaryXMLParser.java:479` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:117 — jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:117-128 | jadx-gui/src/main/java/jadx/gui/ui/codearea/sync/InsnOffsetJavaSyncer.java:134-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:117` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/codearea/SearchBar.java:50 — jadx-gui/src/main/java/jadx/gui/ui/codearea/SearchBar.java:50-61 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexSearchBar.java:54-65 — 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: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. 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/UsageDialogPlus.java:230 — jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:230-241 | jadx-gui/src/main/java/jadx/gui/ui/dialog/UsageDialogPlus.java:248-259 — 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:230` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:75 — jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:75-86 | jadx-gui/src/main/java/jadx/gui/ui/graphs/CallGraphDialog.java:96-107 — 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/graphs/CallGraphDialog.java:75` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×5
  • Duplicated block (11 lines × 2) jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:566 — jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:566-576 | jadx-core/src/main/java/jadx/core/utils/BlockUtils.java:598-608 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (11 lines × 2) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:165 — jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:165-175 | jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:217-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:165` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:818 — jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:818-828 | jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:836-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:818` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 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-78 | jadx-gui/src/main/java/jadx/gui/ui/popupmenu/VarTreePopupMenu.java:83-93 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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 (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. Read the line range as the matched WINDOW rather than a finished unit: at `jadx-plugins/jadx-dex-input/src/main/java/jadx/plugins/input/dex/DexFileLoader.java:158` 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 (9 lines × 2) · ×5
  • Duplicated block (9 lines × 2) jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:148 — jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/FixTypesVisitor.java:148-156 | jadx-core/src/main/java/jadx/core/dex/visitors/typeinference/TypeInferenceVisitor.java:136-144 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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: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. 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 (9 lines × 2) jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:157 — jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:157-165 | jadx-gui/src/main/java/jadx/gui/plugins/mappings/RenameMappingsGui.java:195-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:157` 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/hexviewer/HexEditorHeader.java:172 — jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:172-180 | jadx-gui/src/main/java/jadx/gui/ui/hexviewer/HexEditorHeader.java:197-205 — 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/MainWindow.java:1230 — jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1230-1238 | jadx-gui/src/main/java/jadx/gui/ui/MainWindow.java:1312-1320 — 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-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: extract the block into a single shared function in that directory and call it from each site, 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 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.
D29 · Static Analysis (SAST) · Medium · ×4
  • Medium: use-of-md5 jadx-core/src/main/java/jadx/core/utils/files/FileUtils.java:497 — Detected MD5 hash algorithm which is considered insecure. MD5 is not collision resistant and is therefore not suitable as a cryptographic signature. Use HMAC instead. This is a semgrep security-AUDIT rule: it reports that a sensitive pattern is present, not that it is exploitable here. Confirm whether the flagged value reaches a security decision — a credential, token, nonce, key, salt or session id, or an externally reachable surface — and apply the change where it does; where it provably does not (cosmetic, simulation, or deliberately reproducible use), record the review and leave the code as it is.
  • Medium: unencrypted-socket jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java:143 — Detected use of a Java socket that is not encrypted. As a result, the traffic could be read by an attacker intercepting the network traffic. Use an SSLSocket created by 'SSLSocketFactory' or 'SSLServerSocketFactory' instead. This is a semgrep security-AUDIT rule: it reports that a sensitive pattern is present, not that it is exploitable here. Confirm whether the flagged value reaches a security decision — a credential, token, nonce, key, salt or session id, or an externally reachable surface — and apply the change where it does; where it provably does not (cosmetic, simulation, or deliberately reproducible use), record the review and leave the code as it is.
  • Medium: unencrypted-socket jadx-gui/src/main/java/jadx/gui/device/protocol/ADB.java:79 — Detected use of a Java socket that is not encrypted. As a result, the traffic could be read by an attacker intercepting the network traffic. Use an SSLSocket created by 'SSLSocketFactory' or 'SSLServerSocketFactory' instead. This is a semgrep security-AUDIT rule: it reports that a sensitive pattern is present, not that it is exploitable here. Confirm whether the flagged value reaches a security decision — a credential, token, nonce, key, salt or session id, or an externally reachable surface — and apply the change where it does; where it provably does not (cosmetic, simulation, or deliberately reproducible use), record the review and leave the code as it is.
  • Medium: unencrypted-socket jadx-gui/src/main/java/jadx/gui/device/protocol/ADB.java:188 — Detected use of a Java socket that is not encrypted. As a result, the traffic could be read by an attacker intercepting the network traffic. Use an SSLSocket created by 'SSLSocketFactory' or 'SSLServerSocketFactory' instead. This is a semgrep security-AUDIT rule: it reports that a sensitive pattern is present, not that it is exploitable here. Confirm whether the flagged value reaches a security decision — a credential, token, nonce, key, salt or session id, or an externally reachable surface — and apply the change where it does; where it provably does not (cosmetic, simulation, or deliberately reproducible use), record the review and leave the code as it is.
D35 · Change Coupling · Change coupling · ×3
  • Change coupling: BackgroundExecutor.java ↔ DecompileTask.java jadx-gui/src/main/java/jadx/gui/jobs/BackgroundExecutor.java — `jadx-gui/src/main/java/jadx/gui/jobs/BackgroundExecutor.java` and `jadx-gui/src/main/java/jadx/gui/jobs/DecompileTask.java` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking.
  • Change coupling: TabbedPane.java ↔ JumpManager.java jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java — `jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java` and `jadx-gui/src/main/java/jadx/gui/utils/JumpManager.java` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking.
  • Change coupling: DebugController.java ↔ ADBDialog.java jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java — `jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java` and `jadx-gui/src/main/java/jadx/gui/ui/dialog/ADBDialog.java` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×3
  • Duplicated block (6 lines × 3) jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/InstallPluginDialog.java:84 — jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/InstallPluginDialog.java:84-90 | 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.
  • Duplicated block (6 lines × 3) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:364 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:364-369 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:433-438 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:743-748 — 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:364` 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/dialog/AboutDialog.java:59 — jadx-gui/src/main/java/jadx/gui/ui/dialog/AboutDialog.java:59-64 | jadx-gui/src/main/java/jadx/gui/ui/dialog/ExcludePkgDialog.java:83-88 | jadx-gui/src/main/java/jadx/gui/ui/panel/JDebuggerPanel.java:316-321 — 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. 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×2
  • Hotspot: jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java — jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java changed 3 times in last 90 days, max complexity 20. 1 of those changes was a fix/bug commit, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time.
  • Hotspot: jadx-gui/src/main/java/jadx/gui/treemodel/JResource.java jadx-gui/src/main/java/jadx/gui/treemodel/JResource.java — jadx-gui/src/main/java/jadx/gui/treemodel/JResource.java changed 2 times in last 90 days, max complexity 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×2
  • Duplicated block (7 lines × 3) jadx-gui/src/main/java/jadx/gui/logs/LogPanel.java:116 — jadx-gui/src/main/java/jadx/gui/logs/LogPanel.java:116-122 | jadx-gui/src/main/java/jadx/gui/ui/dialog/CommentDialog.java:159-165 | jadx-gui/src/main/java/jadx/gui/ui/export/ExportProjectDialog.java:105-111 — 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 (7 lines × 3) jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:311 — jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:311-317 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:364-370 | jadx-gui/src/main/java/jadx/gui/settings/ui/JadxSettingsWindow.java:743-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:311` 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.
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 · 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 · 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 · 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 · 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 · 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 · 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 · 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 · DebugController.decodeRuntimeValue (cyclomatic 22) · ×1
  • DebugController.decodeRuntimeValue (cyclomatic 22) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:723 — 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 · 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 · 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 · SmaliDebugger.decodeCompositeEvents (cyclomatic 21) · ×1
  • SmaliDebugger.decodeCompositeEvents (cyclomatic 21) jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java: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 · 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:281 — 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 · 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 · 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 · 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, separate the cases: extract each independent branch into its 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.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:268 — 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 · 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 · ClassGen.useClassInternal (cyclomatic 18) · ×1
  • ClassGen.useClassInternal (cyclomatic 18) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:676 — 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 · 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 · TabComponent.createTabPopupMenu (cyclomatic 18) · ×1
  • TabComponent.createTabPopupMenu (cyclomatic 18) jadx-gui/src/main/java/jadx/gui/ui/tab/TabComponent.java:234 — TabComponent.createTabPopupMenu 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 · 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 · 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 · 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 · 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 · ExtractFieldInit.processFieldsDependencies (cyclomatic 16) · ×1
  • ExtractFieldInit.processFieldsDependencies (cyclomatic 16) jadx-core/src/main/java/jadx/core/dex/visitors/ExtractFieldInit.java:291 — ExtractFieldInit.processFieldsDependencies 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.
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 37, loops 18, ternaries 12, 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 78) · ×1
  • MappingExporter.exportMappings (cognitive 78) jadx-plugins/jadx-rename-mappings/src/main/java/jadx/plugins/mappings/save/MappingExporter.java:57 — MappingExporter.exportMappings has cognitive complexity 78 (threshold 15). Drivers by points: if/else 53, loops 13, ternaries 7, boolean chains 4, error handling 1 (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 · 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 50, loops 19, 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 · ResXmlGen.addValue (cognitive 61) · ×1
  • ResXmlGen.addValue (cognitive 61) jadx-core/src/main/java/jadx/core/xmlgen/ResXmlGen.java:85 — ResXmlGen.addValue has cognitive complexity 61 (threshold 15). Drivers by points: if/else 45, loops 12, boolean chains 4 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch 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 48, loops 10, boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch 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.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 42, loops 11, 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 35, loops 14, boolean chains 5, ternaries 2 (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 · 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 36, boolean chains 10, ternaries 5, loops 4 (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:268 — DebugChecks.checkPHI has cognitive complexity 53 (threshold 15). Drivers by points: if/else 38, loops 13, 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 33, loops 16, ternaries 2, 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 52) · ×1
  • LoopRegionMaker.makeEndlessLoop (cognitive 52) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/LoopRegionMaker.java:527 — LoopRegionMaker.makeEndlessLoop has cognitive complexity 52 (threshold 15). Drivers by points: if/else 35, loops 12, boolean chains 3, ternaries 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch 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.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 43, boolean chains 5, loops 2 (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 · 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 43, boolean chains 4, ternaries 3 (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 · 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 45, boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 33, loops 10, 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 · 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 28, 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 · 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 38, loops 3, boolean chains 2, match/switch 2, 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 · 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 43, 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 · SwitchOverStringVisitor.prepareMergedSwitchCases (cognitive 45) · ×1
  • SwitchOverStringVisitor.prepareMergedSwitchCases (cognitive 45) jadx-core/src/main/java/jadx/core/dex/visitors/regions/SwitchOverStringVisitor.java:234 — SwitchOverStringVisitor.prepareMergedSwitchCases has cognitive complexity 45 (threshold 15). Drivers by points: if/else 27, loops 15, boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch 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 27, loops 8, boolean chains 5, ternaries 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IfRegionMaker.mergeNestedIfNodes (cognitive 40) · ×1
  • IfRegionMaker.mergeNestedIfNodes (cognitive 40) jadx-core/src/main/java/jadx/core/dex/visitors/regions/maker/IfRegionMaker.java:398 — IfRegionMaker.mergeNestedIfNodes has cognitive complexity 40 (threshold 15). Drivers by points: if/else 30, boolean chains 6, loops 2, ternaries 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 · 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 32, 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 · 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 29, loops 7, boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch 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) jadx-gui/src/main/java/jadx/gui/device/debugger/SmaliDebugger.java:758 — SmaliDebugger.decodeCompositeEvents has cognitive complexity 39 (threshold 15). Drivers by points: if/else 38, 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 · ModifiedUTF8Decoder.decodeString (cognitive 38) · ×1
  • ModifiedUTF8Decoder.decodeString (cognitive 38) jadx-plugins/jadx-java-input/src/main/java/jadx/plugins/input/java/utils/ModifiedUTF8Decoder.java:7 — ModifiedUTF8Decoder.decodeString has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31, boolean chains 5, loops 2 (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 · InsnGen.makeConstructor (cognitive 37) · ×1
  • InsnGen.makeConstructor (cognitive 37) jadx-core/src/main/java/jadx/core/codegen/InsnGen.java:727 — InsnGen.makeConstructor has cognitive complexity 37 (threshold 15). Drivers by points: if/else 30, loops 5, boolean chains 2 (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 · 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 28, loops 5, 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 25, 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 24, loops 7, 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 · SimpleModeHelper.prepareBlocks (cognitive 34) · ×1
  • SimpleModeHelper.prepareBlocks (cognitive 34) jadx-core/src/main/java/jadx/core/codegen/SimpleModeHelper.java:36 — SimpleModeHelper.prepareBlocks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27, boolean chains 4, ternaries 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 24, boolean chains 6, loops 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 · 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 29, loops 3, 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 20, loops 11, 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 27, 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 27, error handling 5, boolean chains 1, loops 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 · SearchDialog.buildSearch (cognitive 34) · ×1
  • SearchDialog.buildSearch (cognitive 34) jadx-gui/src/main/java/jadx/gui/ui/dialog/SearchDialog.java:618 — SearchDialog.buildSearch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 28, loops 5, 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 · 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 23, error handling 6, loops 3, 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 · 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 26, loops 4, boolean chains 3 (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 · 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 22, loops 6, 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 · 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 25, loops 6 (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 25, 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 · ExtractFieldInit.processFieldsDependencies (cognitive 31) · ×1
  • ExtractFieldInit.processFieldsDependencies (cognitive 31) jadx-core/src/main/java/jadx/core/dex/visitors/ExtractFieldInit.java:291 — ExtractFieldInit.processFieldsDependencies has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, loops 7, ternaries 2 (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 · 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 24, loops 4, match/switch 2, 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 · 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 21, error handling 5, loops 4, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 21, loops 5, ternaries 3, 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 · 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 19, loops 8, error handling 2, 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 22, loops 8 (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 19, loops 8, 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 · 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 28, 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:226 — ClassGen.addGenericTypeParameters has cognitive complexity 29 (threshold 15). Drivers by points: if/else 22, loops 4, 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 18, loops 6, ternaries 5 (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 · EnumVisitor.checkExternalRegUsage (cognitive 29) · ×1
  • EnumVisitor.checkExternalRegUsage (cognitive 29) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:528 — EnumVisitor.checkExternalRegUsage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, boolean chains 2, match/switch 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 24, loops 5 (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 24, loops 5 (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 · TabComponent.createTabPopupMenu (cognitive 29) · ×1
  • TabComponent.createTabPopupMenu (cognitive 29) jadx-gui/src/main/java/jadx/gui/ui/tab/TabComponent.java:234 — TabComponent.createTabPopupMenu has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20, loops 5, ternaries 4 (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 · 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 24, 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 · DebugChecks.checkSSAVars (cognitive 28) · ×1
  • DebugChecks.checkSSAVars (cognitive 28) jadx-core/src/main/java/jadx/core/utils/DebugChecks.java:168 — DebugChecks.checkSSAVars has cognitive complexity 28 (threshold 15). Drivers by points: if/else 25, loops 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 · 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 17, error handling 6, 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 · 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 22, boolean chains 3, ternaries 3 (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 · 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 10, boolean chains 8, ternaries 8, 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 18, loops 9 (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 16, loops 10, 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 22, 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 · EnumVisitor.removeEnumMethods (cognitive 27) · ×1
  • EnumVisitor.removeEnumMethods (cognitive 27) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:602 — EnumVisitor.removeEnumMethods has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 2, 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 · 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 27 (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 · ResTableBinaryParser.parseTypeChunk (cognitive 27) · ×1
  • ResTableBinaryParser.parseTypeChunk (cognitive 27) jadx-core/src/main/java/jadx/core/xmlgen/ResTableBinaryParser.java:251 — ResTableBinaryParser.parseTypeChunk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, loops 9, 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 · 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 18, loops 6, 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 21, loops 3, 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 · 2.dispatchKeyEvent (cognitive 26) · ×1
  • 2.dispatchKeyEvent (cognitive 26) jadx-gui/src/main/java/jadx/gui/ui/tab/TabbedPane.java:108 — 2.dispatchKeyEvent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 14, ternaries 5, boolean chains 3, loops 3 (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 17, loops 5, 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 · 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 18, boolean chains 5, ternaries 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 · MethodInvokeVisitor.applyArgsCast (cognitive 25) · ×1
  • MethodInvokeVisitor.applyArgsCast (cognitive 25) jadx-core/src/main/java/jadx/core/dex/visitors/MethodInvokeVisitor.java:177 — MethodInvokeVisitor.applyArgsCast has cognitive complexity 25 (threshold 15). Drivers by points: if/else 23, boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 18, loops 5, 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 · 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 18, loops 6, 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 · 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 19, loops 5, 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 24, 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 · 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 14, loops 10 (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 · 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 17, loops 7 (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 · 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 22, 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:281 — DotGraphUtils.processBlock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 5, boolean chains 3, ternaries 2 (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 19, 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 · ClassInheritanceGraphDialog.addNode (cognitive 24) · ×1
  • ClassInheritanceGraphDialog.addNode (cognitive 24) jadx-gui/src/main/java/jadx/gui/ui/graphs/ClassInheritanceGraphDialog.java:179 — ClassInheritanceGraphDialog.addNode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 10 (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 · 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 20, 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 16, loops 6, 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 · TernaryMod.replaceWithTernary (cognitive 23) · ×1
  • TernaryMod.replaceWithTernary (cognitive 23) jadx-core/src/main/java/jadx/core/dex/visitors/regions/TernaryMod.java:291 — TernaryMod.replaceWithTernary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EnumVisitor.convertToEnum (cognitive 23) · ×1
  • EnumVisitor.convertToEnum (cognitive 23) jadx-core/src/main/java/jadx/core/dex/visitors/EnumVisitor.java:118 — EnumVisitor.convertToEnum has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, boolean chains 3, loops 2 (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 · DebugChecks.checkInsn (cognitive 23) · ×1
  • DebugChecks.checkInsn (cognitive 23) jadx-core/src/main/java/jadx/core/utils/DebugChecks.java:74 — DebugChecks.checkInsn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 3, boolean chains 2, match/switch 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 · DotGraphUtils.dumpToString (cognitive 23) · ×1
  • DotGraphUtils.dumpToString (cognitive 23) jadx-core/src/main/java/jadx/core/utils/DotGraphUtils.java:111 — DotGraphUtils.dumpToString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 5, 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 · 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 19, 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 · ClassGen.useClassInternal (cognitive 22) · ×1
  • ClassGen.useClassInternal (cognitive 22) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:676 — ClassGen.useClassInternal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, 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 12, boolean chains 7, loops 3 (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 17, loops 3, 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 · SimplifyVisitor.simplifyArith (cognitive 22) · ×1
  • SimplifyVisitor.simplifyArith (cognitive 22) jadx-core/src/main/java/jadx/core/dex/visitors/SimplifyVisitor.java:553 — SimplifyVisitor.simplifyArith has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, ternaries 3, 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 15, boolean chains 4, loops 3 (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 11, boolean chains 7, loops 4 (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 · 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 15, loops 3, 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 16, loops 3, 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 · JCommanderWrapper.printOptions (cognitive 21) · ×1
  • JCommanderWrapper.printOptions (cognitive 21) jadx-cli/src/main/java/jadx/cli/JCommanderWrapper.java:174 — JCommanderWrapper.printOptions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 5, 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 · 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 13, loops 8 (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:163 — ClassGen.addClassDeclaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 2, loops 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 · 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 18, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 16, ternaries 4, 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 13, loops 5, 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 13, loops 7, 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 18, boolean chains 2, 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 · 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 18, loops 3 (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 12, loops 9 (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 14, loops 7 (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 13, loops 6, 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 14, 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 · 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 21 (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 · DebugController.updateRegister (cognitive 21) · ×1
  • DebugController.updateRegister (cognitive 21) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:442 — DebugController.updateRegister has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, loops 4, 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 · 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 8, error handling 6, boolean chains 3, loops 3, 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 · 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 15, boolean chains 2, ternaries 2, 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 14, loops 6 (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 · InsnArg.wrapInstruction (cognitive 20) · ×1
  • InsnArg.wrapInstruction (cognitive 20) jadx-core/src/main/java/jadx/core/dex/instructions/args/InsnArg.java:105 — InsnArg.wrapInstruction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, 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 · 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 12, boolean chains 3, loops 3, match/switch 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 · 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 16, loops 3, 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 16, loops 3, 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 12, loops 6, 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 10, ternaries 7, match/switch 2, 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 19, 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 19, 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:172 — ExtractFieldInit.collectFieldsInit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 3, 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 13, loops 6, 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 · PluginSettings.addOptions (cognitive 20) · ×1
  • PluginSettings.addOptions (cognitive 20) jadx-gui/src/main/java/jadx/gui/settings/ui/plugins/PluginSettings.java:144 — PluginSettings.addOptions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, error handling 3, ternaries 2, 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 20 (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 · SyncNLSLines.applySync (cognitive 20) · ×1
  • SyncNLSLines.applySync (cognitive 20) jadx-gui/src/main/java/jadx/gui/utils/tools/SyncNLSLines.java:114 — SyncNLSLines.applySync has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 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 12, boolean chains 4, loops 2, 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 17, 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 · 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 18, 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 · ClassNode.checkSourceFilenameAttr (cognitive 19) · ×1
  • ClassNode.checkSourceFilenameAttr (cognitive 19) jadx-core/src/main/java/jadx/core/dex/nodes/ClassNode.java:263 — ClassNode.checkSourceFilenameAttr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 4, loops 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 · 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 12, loops 5, 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 9, loops 8, 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 · VisibilityUtils.checkVisibility (cognitive 19) · ×1
  • VisibilityUtils.checkVisibility (cognitive 19) jadx-core/src/main/java/jadx/core/dex/visitors/fixaccessmodifiers/VisibilityUtils.java:20 — VisibilityUtils.checkVisibility has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 4, ternaries 4 (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 · 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 15, 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 12, loops 5, 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 13, 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 15, error handling 2, ternaries 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 · 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 13, loops 4, 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 15, loops 2, 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 · DebugController.onSuspendEvent (cognitive 19) · ×1
  • DebugController.onSuspendEvent (cognitive 19) jadx-gui/src/main/java/jadx/gui/device/debugger/DebugController.java:356 — DebugController.onSuspendEvent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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 15, 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 13, loops 5, 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:1825 — MainWindow.checkIfCodeHasNonPrintableChars has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, loops 5, 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 · 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 11, loops 4, boolean chains 2, match/switch 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 · 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 17, 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 · 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 19 (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 · ClassGen.addField (cognitive 18) · ×1
  • ClassGen.addField (cognitive 18) jadx-core/src/main/java/jadx/core/codegen/ClassGen.java:434 — ClassGen.addField has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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 13, loops 3, 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 11,...

    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.