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

NOAA-GSL/rocoto

Measured 17 November 2026, 08:39 UTC, at code version ab948b0

Test reliability is not measured: The suite could not be re-run, but the repository declares tests of its own unreliable.

Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.

CAI score 49.1out of 100 Weak
CriticalWeakAdequateStrongExemplary

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

A small codebase: 14,869 lines of product code in 6 projects, tests not counted · Estimated rebuild effort: about 0.1 person-years · Weakest lens: Production Readiness, 29.6

Findings by how serious they are

17 critical 221 serious 33 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 08:39 UTC

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

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

49of 49 dimensions measured by tools.
260of 271 findings point to an exact file and line, so you can open each one in the code. The other 11 concern the repository as a whole, such as missing documentation.
49dimensions across 5 lenses, read from 14,869 lines of product code in 6 projects.
Chapters

Executive summary

NOAA-GSL/rocoto falls short of our standard for production because we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 49.1 out of 100 and is rated Weak, and 16 of its 17 critical findings are security problems in the build pipeline and in its code.

Production Readiness, at 29.6, is the weakest lens and counts most in the score. The best first step is adding tests for untested code, worth about 17.3 points. Logging through a logging library would lift Production Readiness itself, worth about 6.0 points. Raising Production Readiness to 70 would lift the score to about 64.7.

Twelve pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Two secrets can leak from the build pipeline, and two weaknesses in the code could be used by an attacker. Pinning each tool to an exact version, limiting each secret to its own step and fixing the weaknesses the scanner points to would close these risks. The test the project itself marks as unreliable needs fixing or deleting.

The product code is 14,869 lines, about €16,000 to rebuild.

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

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

If Production Readiness rose from 29.6 to 70, the lowest score rated Strong, the score would rise from 49.1 to about 64.7.

Code composition: what the lines of code are
Product code 87%Tests 13%
Rebuild cost: about €16,000 · Estimate
Cost to rebuild€5,200 to €26,000, for 87 to 277 hours of work, about 0.1 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 49. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeSmall: 14,869 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 50 Low coverage finding(s) in Code Coverage — start with job.rb (2), install.rb, lockfile-1.3.0.rb.
Raises the score by about 17.3 points · Medium effort · Code Coverage
2
Log through `Rails.logger` (or SemanticLogger/Lograge for structured output) at meaningful points in the services you run.
Raises the score by about 6.0 points · Medium effort · Observability
3
Add a SAST step to CI running what this repository's stack ships: brakeman for Rails apps, otherwise `semgrep --config=auto` or CodeQL's ruby pack — so a security regression fails the build instead of landing.
Raises the score by about 6.0 points · Medium effort · Security & performance tooling

Diagnosis: what the measurements show together

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

Where the investment is most exposed · Value at risk
This code would cost about €16,000 to build again, about 0.1 person-years of work. Its weakest lens is Production Readiness, at 29.6 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 50 Low coverage finding(s) in Code Coverage. Of all the actions in this report, it raises the score most for the work it takes: about 17.3 points for medium effort, because it clears the 50 Code Coverage findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 7% to 15% on every change. The history of the code shows how much it changes: about 3,200 lines over the last 90 days, which is about 12,978 lines a year. At that pace, the extra work comes to an estimated 2.2 to 13.2 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch lib lib lib/rocoto_actor rocoto_actor lib->lib/rocoto_actor lib/lockfile lockfile lib/wfmstat wfmstat lib/workflowmgr workflowmgr lib/wfmstat->lib/workflowmgr sbin sbin sbin->lib/wfmstat sbin->lib/workflowmgr

Architecture: which parts of the code depend on which

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

5 modules, with 2 dependencies between them. Every module uses only modules listed above it, so there are no loops.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 Lockfile2 RocotoActor3 WorkflowMgr4 (global)5 WFMStat
1 Lockfile
2 RocotoActor
3 WorkflowMgr
4 (global)1
5 WFMStat6
Uses a module listed above itPart of a loopThe module itself
1 Lockfile2 RocotoActor3 WorkflowMgr4 (global)5 WFMStatLockfile1RocotoActor2WorkflowMgr3(global)4WFMStat516

At a glance — Code Health · 55.5 · Adequate · gated by D2, D4, X5 ·

At a glance — Architecture · 100.0 · Exemplary ·

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

At a glance — Readiness · 29.6 · Weak · gated by P2, P3, P5 ·

At a glance — Security · 86.3 · Strong ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection18High / Critical
A03:2025 — Software Supply Chain Failures3Medium

Roadmap

Top priorities: Resolve the 50 Low coverage finding(s) in Code Coverage — start with job.rb (2), install.rb, lockfile-1.3.0.rb; Log through `Rails.logger` (or SemanticLogger/Lograge for structured output) at meaningful points in the services you run; Add a SAST step to CI running what this repository's stack ships: brakeman for Rails apps, otherwise `semgrep --config=auto` or CodeQL's ruby pack — so a security regression fails the build instead of landing.

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

Do thisHelpsEffortDimension
Resolve the 50 Low coverage finding(s) in Code Coverage — start with job.rb (2), install.rb, lockfile-1.3.0.rb.+17.3 ptsMediumCode Coverage
Log through `Rails.logger` (or SemanticLogger/Lograge for structured output) at meaningful points in the services you run.+6.0 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: brakeman for Rails apps, otherwise `semgrep --config=auto` or CodeQL's ruby pack — so a security regression fails the build instead of landing.+6.0 ptsMediumSecurity & performance tooling
Resolve the 1 finding(s) in DR & Backup.+6.0 ptsMediumDR & Backup
Adopt a checker and raise it file by file: with Sorbet, `srb init` (or `bundle exec tapioca init`) commits `sorbet/config`, then move each file's sigil from `# typed: false` to `# typed: true` and on to `strict` as its methods get `sig`s — `spoom bump` does the moving; with Steep, write RBS signatures and `check` the product directories in the `Steepfile` under `D::Ruby.default` or `strict`, not `lenient`. Then pay down the assertions rather than adding to them: each `T.must` is a nil the checker could not rule out — narrow it (`return unless x`, `x&.`, `if (y = x)`), make the attribute non-nilable and set it in `initialize`, or change the method so the nil cannot arrive.+4.1 ptsMediumNullable reference types
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+3.2 ptsMediumArchitecture documentation
Swallowed exception (caught, then discarded)+1.6 ptsMediumException handling
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.+0.6 ptsLowBus Factor

File quality

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

FileScoreBandWorst signal
REDACTED0.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.3MixedStatic Analysis (SAST): High: REDACTED
lib/workflowmgr/workflowengine.rb5.5MixedCyclomatic Complexity: WorkflowEngine.submit_new_jobs (cyclomatic 41)
lib/lockfile/lib/lockfile-1.3.0.rb5.5MixedCyclomatic Complexity: Lockfile.lock (cyclomatic 26)
lib/wfmstat/statusengine.rb5.5MixedCyclomatic Complexity: StatusEngine.print_status (cyclomatic 21)
lib/workflowmgr/lsfbatchsystem.rb5.5MixedCyclomatic Complexity: LSFBatchSystem.submit (cyclomatic 30)
lib/workflowmgr/moabbatchsystem.rb5.5MixedCyclomatic Complexity: MOABBatchSystem.submit (cyclomatic 19)
lib/workflowmgr/workflowdb.rb5.5MixedCognitive Complexity: WorkflowSQLite3DB.lock_workflow (cognitive 21)
lib/workflowmgr/slurmbatchsystem.rb5.5MixedCyclomatic Complexity: SLURMBatchSystem.submit (cyclomatic 40)
lib/workflowmgr/cobaltbatchsystem.rb5.6MixedCyclomatic Complexity: COBALTBatchSystem.refresh_jobqueue (cyclomatic 23)
lib/workflowmgr/workflowdoc.rb5.6MixedCyclomatic Complexity: WorkflowXMLDoc.tasks (cyclomatic 23)
lib/workflowmgr/workflowreport.rb5.6MixedCyclomatic Complexity: WorkflowReport.submit_new_jobs (cyclomatic 22)
lib/workflowmgr/pbsprobatchsystem.rb5.7MixedCyclomatic Complexity: PBSPROBatchSystem.refresh_jobacct (cyclomatic 30)
lib/lockfile/lib/lockfile.rb5.7MixedCyclomatic Complexity: Lockfile.lock (cyclomatic 26)
lib/workflowmgr/bqsproxy.rb5.7MixedCode Duplication: Edited copy of a member (57 corresponding lines)
lib/workflowmgr/torquebatchsystem.rb5.9MixedCyclomatic Complexity: TORQUEBatchSystem.refresh_jobqueue (cyclomatic 27)
REDACTED6.2MixedDependency Vulnerabilities: Medium CVE: REDACTED
lib/workflowmgr/lsfcraybatchsystem.rb6.3MixedCyclomatic Complexity: LSFCRAYBatchSystem.submit (cyclomatic 31)
lib/workflowmgr/moabtorquebatchsystem.rb6.3MixedCyclomatic Complexity: MOABTORQUEBatchSystem.refresh_jobqueue (cyclomatic 17)

How the grades work

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

Critical — 17

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 221

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 33

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

Could not be resolved — 7

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

Methodology & how to trust this report

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

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

What we checked — 49 dimensions across the health lenses
D1D2D3D4D5D6D8D12D13D14D15D16D17D28D29D30D31D34D35D43D44AX10AX3AX4AX8GD1IC1M1M2M3M4P1P2P3P4P5P6X12X16X17X18X19X21X24X25X27X3X30X5

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, 260 of 271 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1e8a9-6918-7348-98e5-f06e9fb42ae1.

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.

  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This repository declares 1 of its own test(s) unreliable. The built-in reliability runner does not support this repository's ecosystem (.rb), so the suite was not re-run and no reliability score is given — these are the repository's own declarations, not our measurement.
  • D20 ADR Quality — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The ADR expectation is gated on whether a repository ships a deployable product. Our repo-kind classifier reads .NET project files and the host and package markers of the other ecosystems it knows (a Go `package main`, a Cargo binary, a package.json `bin`, `start` script or application dev server such as Vite or Next, Python console scripts or a Django/WSGI entry point, a Spring Boot / WAR / Gradle application build, a Rack or Rails app, a Composer project, an OTP release or escript, a Dockerfile, a Procfile, a Platform.sh `.platform/routes.yaml`, and the corresponding published-package manifests, including an OTP `*.app.src`, a Drupal module's `*.info` and a Claude Code `.claude-plugin/plugin.json`), and found none here, so we could not tell what kind of repository this is and did not assess its ADR log. This is a gap in our analyzer, not a finding about this repository. Read, stating neither a host nor a published package: `docker/docker-compose-pbs.yml`, `docker/docker-compose.yml`.
  • D22 Internal API Consistency — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's source is written only in languages whose packages are published through a manifest, and no manifest in the tree makes a publication act: either there is no package manifest of any ecosystem (no package.json, pyproject.toml, setup.py, gemspec, Cargo.toml, pom.xml, build.gradle, composer.json, pubspec.yaml or mix.exs), or every one present declares in its package manager's own terms that it is not published (an npm package marked "private": true, a Cargo package with publish = false, a pubspec with publish_to: none, a Composer "project", a Poetry project with package-mode = false, or the "Private :: Do Not Upload" classifier). With no publication act there is no intentionally-exposed surface for API consistency to be judged over.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D26 Project Cohesion — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `(repository root)` (14869 LoC, 167 module-visible types across 6 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
  • C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'sqlite3' is imported (lib/workflowmgr/workflowdb.rb:38), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'sqlite3' is imported (lib/workflowmgr/workflowdb.rb:38), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • C4 Data Retention — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'sqlite3' is imported (lib/workflowmgr/workflowdb.rb:38), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • C5 Data-Subject Rights — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'sqlite3' is imported (lib/workflowmgr/workflowdb.rb:38), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • 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.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity5.0 / 10Weak✓ Tool-verified

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

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

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

37 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was WorkflowEngine.submit_new_jobs at 41. A further 1 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 WorkflowXMLDoc.get_dependency_node at 16 — they are counted neither in the figure above nor in this dimension's score.

Lockfile.lock (cyclomatic 26) · ×2lib/lockfile/lib/lockfile-1.3.0.rb:169
Lockfile.initialize (cyclomatic 17) · ×2lib/lockfile/lib/lockfile-1.3.0.rb:137
WorkflowEngine.submit_new_jobs (cyclomatic 41)lib/workflowmgr/workflowengine.rb:1694
SLURMBatchSystem.submit (cyclomatic 40)lib/workflowmgr/slurmbatchsystem.rb:154
WorkflowEngine.boot (cyclomatic 39)lib/workflowmgr/workflowengine.rb:308

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

What to do

  1. Bring the 5 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with WorkflowEngine.submit_new_jobs (cyclomatic 41), SLURMBatchSystem.submit (cyclomatic 40), WorkflowEngine.boot (cyclomatic 39). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 5 together lifts Cyclomatic Complexity from 5.0 to about 5.9/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.

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

D2 · Cognitive Complexity2.7 / 10Weak✓ Tool-verified

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

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

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

42 method(s) exceeded the cognitive complexity threshold of 15; the worst was WorkflowEngine.boot at 70.

Lockfile.lock (cognitive 37) · ×2lib/lockfile/lib/lockfile-1.3.0.rb:169
Lockfile.initialize (cognitive 17) · ×2lib/lockfile/lib/lockfile-1.3.0.rb:137
WorkflowEngine.boot (cognitive 70)lib/workflowmgr/workflowengine.rb:308
WorkflowEngine.update_active_jobs (cognitive 50)lib/workflowmgr/workflowengine.rb:1305
WorkflowEngine.submit_new_jobs (cognitive 50)lib/workflowmgr/workflowengine.rb:1694

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

What to do

  1. Bring the 1 body over 60 down to 60 or less in Cognitive Complexity — start with WorkflowEngine.boot (cognitive 70). — Refactoring it lifts Cognitive Complexity from 2.7 to about 3.3/10.

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

D3 · God Classes9.1 / 10Stronggated by 5 serious findings✓ Tool-verified

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

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

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

5 god class(es) detected.

FileTooLong: workflowmgr/workflowengine.rb · ×3lib/workflowmgr/workflowengine.rb
TooManyMethods: WorkflowSQLite3DB · ×2lib/workflowmgr/workflowdb.rb:37

What to do

  1. Resolve the 3 FileTooLong finding(s) in God Classes — start with workflowengine.rb, workflowdoc.rb, workflowdb.rb. — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 2 TooManyMethods finding(s) in God Classes — start with workflowdb.rb, workflowdoc.rb. — One of this dimension's main actionable groups (2 warning-level).

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

D4 · Code Duplication3.5 / 10Weak✓ Tool-verified

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

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

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

42 duplicated block group(s) detected. 16.3 % of the production lines (2,417 of 14,869) are in a reported copy. A further 19 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Duplicated block (9 lines × 2) · ×4lib/workflowmgr/workflowdoc.rb:824
Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3lib/workflowmgr/lsfbatchsystem.rb:67
Duplicated block (21 lines × 2) · ×3lib/wfmstat/statusengine.rb:31
Duplicated block (19 lines × 2) · ×2lib/wfmstat/statusengine.rb:97
Duplicated block (11 lines × 2) · ×2lib/workflowmgr/workflowengine.rb:1747

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

What to do

  1. Resolve the 4 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with lockfile-1.3.0.rb (2), workflowdoc.rb, workflowengine.rb. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 3 Members sharing a duplicated core (4 members, 50+ identical tokens) finding(s) in Code Duplication — start with lsfbatchsystem.rb, workflowdb.rb, workflowengine.rb. — One of this dimension's main actionable groups (3 warning-level).
  3. Resolve the 3 Duplicated block (21 lines × 2) finding(s) in Code Duplication — start with statusengine.rb (2), workflowengine.rb. — One of this dimension's main actionable groups (3 warning-level).

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

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

6 production modules (source-import), 0 dependency cycle(s), 0 unstable depended-on module(s). No manifest declares this repository's modules, so the modules are its top-level source directories and the edges the imports between them, and main-sequence distance (abstractness) is not computed for these modules yet.

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

0 of 45 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D8 · Code Coverage4.7 / 10Weak✓ Tool-verified

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

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

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

Line coverage 20.0% — 50 file(s) below 50%. Measured from the Ruby suite (RSpec: repository root, 16 spec files: Ruby's own line coverage, the 3 run(s) test reliability made). Taken over 3 runs of the suite: a line counts as covered only when every run executed it.

Low coverage: lib/lockfile/install.rb · ×50lib/lockfile/install.rb:1

What to do

  1. Resolve the 50 Low coverage finding(s) in Code Coverage — start with job.rb (2), install.rb, lockfile-1.3.0.rb. — One of this dimension's main actionable groups (50 warning-level).

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

D12 · Dependency Hygiene9.8 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

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

4 outdated direct gem(s), 0 pinning defect(s). 13 declaration(s) graded against rubygems.org, 11 of them against a version resolved in a committed REDACTED. 2 declaration(s) carry a requirement that EXCLUDES the current release; that is a deliberate constraint (a supported-version ceiling or a held-back CI pin) and is counted, not charged. Whether any of these gems is DEPRECATED or YANKED is not graded — rubygems.org publishes no deprecation marker, and a yank removes a version rather than flagging it. Whether any is UNMAINTAINED is not graded either: no registry publishes a maintenance status, and release age does not stand in for one. Whether any is UNUSED is a source question, not a registry one. Known CVEs in this dependency graph are D30's question, read from the manifest there.

Outdated: nokogiri · ×4

✓ On the Gold path — maintain.

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

0 of 8 shipped gem(s) use a banned license. Licences were resolved from rubygems.org over the 8 gem(s) a consumer installs — this repository's runtime declarations closed transitively over its committed REDACTED. Development-group and `add_development_dependency` gems are excluded: they are not distributed with this repository.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

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

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

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

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

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

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

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

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

5 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is lib/workflowmgr/workflowdb.rb. Counted over 39 of the 66 production source files in this repository: 24 are under the ~2,400-byte size floor this dimension measures over, and the remaining 3 have no attributable history left to measure.

Off-boarding risk: anonymized user #1

What to do

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

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

D17 · Explicit Debt10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)4.5 / 10Weak✓ Tool-verified

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

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

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

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

18 finding(s): 0 critical, 16 high, 2 medium, 0 low. 12 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

D30 · Dependency Vulnerabilities9.6 / 10Stronggated by 2 serious findings✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no REDACTED is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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

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

REDACTED
REDACTED

What to do

  1. Resolve the 2 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 1 Low CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

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

D31 · IaC & Container Security10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (Dockerfile/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

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

trivy and checkov found no infrastructure-as-code or container misconfigurations.

✓ On the Gold path — maintain.

Detailed fixes: d31_recommendation.md.

D34 · Knowledge Freshness9.3 / 10Exemplary✓ Tool-verified

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

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

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

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

Orphaned file · ×3lib/lockfile/lib/lockfile-1.3.0.rb:1
Orphaned files with no living knowledge

✓ On the Gold path — maintain.

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

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

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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

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

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

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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

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

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

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

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

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

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

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

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

Other · Code Health — Unreviewed-generation residue in this repository's Ruby: methods whose whole body still raises NotImplementedError where nothing overrides them, or a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

IC1 · Incompleteness & stubs10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Ruby: methods that only raise NotImplementedError or a "not implemented" error where nothing overrides them, methods that take inputs and return a constant or do nothing, dead `if false` branches, and skeleton classes most of whose methods are holes.

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

  • A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. — spec/workflowmgr/workflowdb_spec.rb:118

What to do

  • Clear the softer debt: re-enable or delete `xit`/`skip`ped tests, decide whether each empty method or NotImplementedError refusal is deliberate (and say so in a comment), and replace `# rubocop:disable all` with targeted, justified disables.
M1 · Documentation (README)7.3 / 10Strong✓ Tool-verified

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

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

M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

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

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

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

What to do

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

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

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

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

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

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

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

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

P2 · Observability0.0 / 10Critical✓ Tool-verified

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

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

  • No logging call was found in the 68 Ruby production file(s) this check read across 1 module(s). Each was searched for its ecosystem's logging libraries (Ruby: Rails.logger, Logger.new, SemanticLogger, Lograge) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.

What to do

  • Log through `Rails.logger` (or SemanticLogger/Lograge for structured output) at meaningful points in the services you run.
  • Add a health-check endpoint (Rails' /up (rails/health#show) or a /health route) so orchestrators and load balancers can probe liveness/readiness.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add brakeman for Rails apps, otherwise `semgrep --config=auto` or CodeQL's ruby pack as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:8

What to do

  • Add a SAST step to CI running what this repository's stack ships: brakeman for Rails apps, otherwise `semgrep --config=auto` or CodeQL's ruby pack — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback8.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.

What to do

  • Add an approval/environment gate (required reviewers / protection rules) before production promotion.
P5 · DR & Backup0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.

Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.

  • A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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

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

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

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

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

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

X18 · Disposal-pattern correctness2.1 / 10Critical✓ Tool-verified

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

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

  • `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.path` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`). — lib/workflowmgr/cobaltbatchsystem.rb:170
  • `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tf`, and every later use of `tf` in `submit` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`). (×6) — lib/workflowmgr/lsfbatchsystem.rb:266, lib/workflowmgr/lsfcraybatchsystem.rb:181, lib/workflowmgr/moabbatchsystem.rb:175, …

What to do

  • Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

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

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

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

Other · Code Health — Whether a walk over a `Hash` or `Set` (`each`, `each_pair`, `map`, `for … in` and the other block walks) leaves it alone — Ruby refuses `rehash`, `replace`, `compare_by_identity` and `transform_keys!` on a Hash, and `reset`, `replace`, `compare_by_identity` and `map!` on a Set, while it is being iterated: the call raises `RuntimeError` at once and the remaining entries are never seen.

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

X3 · Exception handling6.7 / 10Adequate✓ Tool-verified

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

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

  • `rescue Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — lib/rocoto_actor/error_reporting.rb:14
  • `rescue StandardError` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — lib/rocoto_actor/future.rb:164
  • `… rescue nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×4) — lib/lockfile/lib/lockfile-1.3.0.rb:160, lib/lockfile/lib/lockfile-1.3.0.rb:362, lib/lockfile/lib/lockfile.rb:160, …
  • `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — lib/lockfile/lib/lockfile-1.3.0.rb:305, lib/lockfile/lib/lockfile.rb:305

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

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

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

X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether Ruby's type checker checks nil and is not undermined by assertions — a file Sorbet reads at `# typed: true` or above, or a Steep target `check`s under its default or strict diagnostics, is one where a method call on a `T.nilable(String)` / `String?` is an error, and each `T.must`, `#: as !nil` or `# steep:ignore NoMethod` is the author telling the checker a value cannot be nil.

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

  • This repository commits no Sorbet configuration (`sorbet/config`) and no `Steepfile`, so nothing type-checks its 66 Ruby product file(s): a nilable value reaches a method call silently and raises `NoMethodError: undefined method … for nil` the first time it is nil. A `# typed:` sigil does nothing without a `sorbet/config` beside the code; a Steep run configured only on a command line is not something this check can read.

What to do

  • Adopt a checker and raise it file by file: with Sorbet, `srb init` (or `bundle exec tapioca init`) commits `sorbet/config`, then move each file's sigil from `# typed: false` to `# typed: true` and on to `strict` as its methods get `sig`s — `spoom bump` does the moving; with Steep, write RBS signatures and `check` the product directories in the `Steepfile` under `D::Ruby.default` or `strict`, not `lenient`. Then pay down the assertions rather than adding to them: each `T.must` is a nil the checker could not rule out — narrow it (`return unless x`, `x&.`, `if (y = x)`), make the attribute non-nilable and set it in `initialize`, or change the method so the nil cannot arrive.

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 Health55.5Adequate — gated by D2, D4, X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture100.0ExemplaryStrongest area.
Maturity65.9Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness29.6Weak — gated by P2, P3, P5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security86.3StrongSolid.
Unscored — 3 check(s) recorded observations but carry no score

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

  • D11 Test Reliability — 1 observation(s) recorded · This repository declares 1 of its own test(s) unreliable. The built-in reliability runner does not support this repository's ecosystem (.rb), so the suite was not re-run and no reliability score is given — these are the repository's own declarations, not our measurement.
  • D36 Supply-chain Provenance & Signing — 5 observation(s) recorded · The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
  • X10 Duplicated predicate — 18 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 control(s) we could not find positive evidence for

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

  • C3 Audit Trail — Not assessed: this repository stores data through 'sqlite3' (lib/workflowmgr/workflowdb.rb:38) but declares no persisted model this check reads (ActiveRecord and Sequel migration columns, db/schema.rb, Mongoid document fields). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
  • C4 Data Retention — Not assessed: this repository stores data through 'sqlite3' (lib/workflowmgr/workflowdb.rb:38) but declares no persisted model this check reads (ActiveRecord/Sequel migration and db/schema.rb columns, Mongoid document fields). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
  • C5 Data-Subject Rights — Not assessed: this repository stores data through 'sqlite3' (lib/workflowmgr/workflowdb.rb:38) but declares no persisted model this check reads (ActiveRecord migration and db/schema.rb columns, Sequel migration columns, Mongoid fields). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
Not included — 62 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: this repository's Ruby imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Ruby code is a Rails controller, a Sinatra, Grape or Roda app, a Hanami action or a Rack app (an instance `call(env)`), so no request handler shares state between request threads.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — no class or module declares an abstract method
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — This repository has no user interface to render — no markup (HTML, Razor, JSX, Vue, Svelte or server templates), no UI framework dependency, no UI component source and no native UI project — so WCAG's runtime success criteria have nothing to apply to here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • AXS1 Runtime exposed surface — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — Not assessed: this repository stores data through 'sqlite3' (lib/workflowmgr/workflowdb.rb:38) but declares no persisted model this check reads (ActiveRecord migration and db/schema.rb columns, Sequel migration columns, Mongoid fields). Personal data may be written through raw SQL or a hosted backend, so the absence of a personal-data field here is not evidence that none is stored, and encryption at rest is not scored over a subject that could not be established.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository draws no route and defines no request handler (no Rails routes.draw or controller, no Sinatra, Roda or Grape application, no Hanami action). Access control is therefore N/A here — a gem is authorized by the application that mounts it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • D10 Test Quality — ~2177 lines of test source are present (.rb) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. 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.
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D20 ADR Quality — Repository kind not determined
  • D21 Naming Consistency — N/A — too few peers to establish a naming convention (1233 declarations, no unit with a dominant convention).
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .rb, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D27 Navigability — symbol resolution incomplete — navigability not assessed
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs, and no 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
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (5 value object(s))
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Ruby source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage data present for 67 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `x.report(…)` entries in a `Benchmark.ips`/`bm`/`bmbm`/`benchmark`/`memory` block, `benchmark:` entries in a benchmark-driver YAML under a bench* directory, rspec-benchmark `perform_*` expectations where the gem is installed, or benchmark-ips, benchmark-memory, rspec-benchmark or benchmark-driver in a Gemfile or gemspec, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • PF3 Async & latency hygiene — Not applicable: Ruby has no async/await function colour, so there is no asynchronous code for a blocking call to stall.
  • S1 Web-Security Posture — No web surface: 66 Ruby file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no `config.ru`, no web framework, Rack or server gem among its gemspec run-time dependencies or its Gemfile's production gems, and no Rails, Rack, Sinatra, Grape, Hanami, WEBrick, Puma or Falcon server defined or booted in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Ruby was read, and no request in it can be cancelled by a caller — a Ruby request takes no token: Net::HTTP, Faraday and async-http are stopped from outside the call (Async::Task#stop, Thread#raise, Timeout), not through a parameter
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Ruby was read, and it logs through none: the standard library's Logger, which Rails.logger is, takes one finished message and no template arguments or fields (as log4net does in C#), so an interpolated message there loses nothing the API could have kept. The console gem (`Console.info`), SemanticLogger, Ougai and dry-logger would be judged.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 17 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D11 · Test Reliability · Test declared unreliable · ×1
  • Test declared unreliable: local_ip spec/workflowmgr/workflowdb_spec.rb:118 — This test is disabled or skipped with a reason naming unreliability — the repository's own words: "Flaky test with race conditions - needs redesign with proper IPC instead of sleep-based timing". A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository's own test source — the suite itself was not re-run, since the reliability runner does not support this ecosystem.)
Serious — 221 finding(s)
D8 · Code Coverage · Low coverage · ×50
  • Low coverage: lib/lockfile/install.rb lib/lockfile/install.rb:1 — 0.0% line coverage (0/84).
  • Low coverage: lib/lockfile/lib/lockfile-1.3.0.rb lib/lockfile/lib/lockfile-1.3.0.rb:1 — 0.0% line coverage (0/310).
  • Low coverage: lib/lockfile/lib/lockfile.rb lib/lockfile/lib/lockfile.rb:1 — 0.0% line coverage (0/310).
  • Low coverage: lib/lockfile/samples/a.rb lib/lockfile/samples/a.rb:1 — 0.0% line coverage (0/46).
  • Low coverage: REDACTED REDACTED:1 — 0.0% line coverage (0/114).
  • Low coverage: lib/wfmstat/job.rb lib/wfmstat/job.rb:1 — 0.0% line coverage (0/23).
  • Low coverage: lib/wfmstat/statusengine.rb lib/wfmstat/statusengine.rb:1 — 0.0% line coverage (0/233).
  • Low coverage: lib/wfmstat/wfmstatoption.rb lib/wfmstat/wfmstatoption.rb:1 — 0.0% line coverage (0/25).
  • Low coverage: lib/workflowmgr/bqsproxy.rb lib/workflowmgr/bqsproxy.rb:1 — 17.5% line coverage (10/57).
  • Low coverage: lib/workflowmgr/cobaltbatchsystem.rb lib/workflowmgr/cobaltbatchsystem.rb:1 — 10.8% line coverage (17/158).
  • Low coverage: lib/workflowmgr/compoundtimestring.rb lib/workflowmgr/compoundtimestring.rb:1 — 47.6% line coverage (10/21).
  • Low coverage: lib/workflowmgr/cycle.rb lib/workflowmgr/cycle.rb:1 — 23.1% line coverage (21/91).
  • Low coverage: lib/workflowmgr/cyclestring.rb lib/workflowmgr/cyclestring.rb:1 — 37.5% line coverage (9/24).
  • Low coverage: lib/workflowmgr/dbproxy.rb lib/workflowmgr/dbproxy.rb:1 — 13.3% line coverage (8/60).
  • Low coverage: lib/workflowmgr/dependency.rb lib/workflowmgr/dependency.rb:1 — 26.6% line coverage (77/290).
  • Low coverage: lib/workflowmgr/job.rb lib/workflowmgr/job.rb:1 — 40.0% line coverage (10/25).
  • Low coverage: lib/workflowmgr/launchserver.rb lib/workflowmgr/launchserver.rb:1 — 23.1% line coverage (6/26).
  • Low coverage: lib/workflowmgr/lsfbatchsystem.rb lib/workflowmgr/lsfbatchsystem.rb:1 — 8.1% line coverage (26/322).
  • Low coverage: lib/workflowmgr/lsfcraybatchsystem.rb lib/workflowmgr/lsfcraybatchsystem.rb:1 — 10.9% line coverage (12/110).
  • Low coverage: lib/workflowmgr/moabbatchsystem.rb lib/workflowmgr/moabbatchsystem.rb:1 — 10.8% line coverage (17/158).
  • Low coverage: lib/workflowmgr/moabtorquebatchsystem.rb lib/workflowmgr/moabtorquebatchsystem.rb:1 — 13.9% line coverage (17/122).
  • Low coverage: lib/workflowmgr/pbsprobatchsystem.rb lib/workflowmgr/pbsprobatchsystem.rb:1 — 9.3% line coverage (14/151).
  • Low coverage: lib/workflowmgr/reportoption.rb lib/workflowmgr/reportoption.rb:1 — 0.0% line coverage (0/43).
  • Low coverage: lib/workflowmgr/slurmbatchsystem.rb lib/workflowmgr/slurmbatchsystem.rb:1 — 7.2% line coverage (19/265).
  • Low coverage: lib/workflowmgr/stringevaluator.rb lib/workflowmgr/stringevaluator.rb:1 — 17.7% line coverage (22/124).
  • + 25 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×8
  • Swallowed exception (caught, then discarded) lib/rocoto_actor/error_reporting.rb:14 — `rescue Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/rocoto_actor/future.rb:164 — `rescue StandardError` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/lockfile/lib/lockfile-1.3.0.rb:160 — `… rescue nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/lockfile/lib/lockfile-1.3.0.rb:305 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/lockfile/lib/lockfile-1.3.0.rb:362 — `… rescue nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/lockfile/lib/lockfile.rb:160 — `… rescue nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/lockfile/lib/lockfile.rb:305 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/lockfile/lib/lockfile.rb:362 — `… rescue nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
X18 · Disposal-pattern correctness · Disposable created and abandoned in the function that made it · ×7
  • Disposable created and abandoned in the function that made it lib/workflowmgr/cobaltbatchsystem.rb:170 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.path` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/workflowmgr/lsfbatchsystem.rb:266 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tf`, and every later use of `tf` in `submit` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/workflowmgr/lsfcraybatchsystem.rb:181 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tf`, and every later use of `tf` in `submit` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/workflowmgr/moabbatchsystem.rb:175 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tf`, and every later use of `tf` in `submit` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/workflowmgr/pbsprobatchsystem.rb:212 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tf`, and every later use of `tf` in `submit` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/workflowmgr/slurmbatchsystem.rb:302 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tf`, and every later use of `tf` in `submit` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/workflowmgr/torquebatchsystem.rb:162 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tf`, and every later use of `tf` in `submit` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
D36 · Supply-chain Provenance & Signing · REDACTED · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×4
  • Duplicated block (9 lines × 2) lib/workflowmgr/workflowdoc.rb:824 — lib/workflowmgr/workflowdoc.rb:824-832 | lib/workflowmgr/workflowdoc.rb:897-905 — 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) lib/workflowmgr/workflowengine.rb:1520 — lib/workflowmgr/workflowengine.rb:1520-1528 | lib/workflowmgr/workflowengine.rb:1562-1570 — 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) lib/lockfile/lib/lockfile-1.3.0.rb:436 — lib/lockfile/lib/lockfile-1.3.0.rb:436-444 | lib/lockfile/lib/lockfile.rb:436-444 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:459 — lib/lockfile/lib/lockfile-1.3.0.rb:459-467 | lib/lockfile/lib/lockfile.rb:459-467 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D3 · God Classes · FileTooLong · ×3
  • FileTooLong: workflowmgr/workflowengine.rb lib/workflowmgr/workflowengine.rb — FileTooLong — 1169 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 669 over it, 2.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: workflowmgr/workflowdoc.rb lib/workflowmgr/workflowdoc.rb — FileTooLong — 624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 124 over it, 1.25× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: workflowmgr/workflowdb.rb lib/workflowmgr/workflowdb.rb — FileTooLong — 606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 106 over it, 1.21× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
  • Members sharing a duplicated core (4 members, 50+ identical tokens) lib/workflowmgr/lsfbatchsystem.rb:67 — lib/workflowmgr/lsfbatchsystem.rb:67-84 | lib/workflowmgr/moabbatchsystem.rb:56-73 | lib/workflowmgr/moabtorquebatchsystem.rb:59-76 | lib/workflowmgr/torquebatchsystem.rb:50-67 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) lib/workflowmgr/workflowdb.rb:289 — lib/workflowmgr/workflowdb.rb:289-302 | lib/workflowmgr/workflowdb.rb:313-331 | lib/workflowmgr/workflowdb.rb:341-362 | lib/workflowmgr/workflowdb.rb:373-386 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) lib/workflowmgr/workflowengine.rb:1490 — lib/workflowmgr/workflowengine.rb:1490-1636 | lib/workflowmgr/workflowengine.rb:1696-1948 | lib/workflowmgr/workflowreport.rb:590-672 | lib/workflowmgr/workflowreport.rb:731-850 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×3
  • Duplicated block (21 lines × 2) lib/wfmstat/statusengine.rb:31 — lib/wfmstat/statusengine.rb:31-51 | lib/workflowmgr/workflowengine.rb:32-52 — 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 (21 lines × 2) lib/workflowmgr/workflowengine.rb:1059 — lib/workflowmgr/workflowengine.rb:1059-1079 | lib/workflowmgr/workflowreport.rb:239-259 — before extracting anything, compare `lib/workflowmgr/workflowengine.rb` and `lib/workflowmgr/workflowreport.rb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (21 lines × 2) lib/wfmstat/statusengine.rb:310 — lib/wfmstat/statusengine.rb:310-330 | lib/wfmstat/statusengine.rb:369-389 — 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.
D1 · Cyclomatic Complexity · Lockfile.lock (cyclomatic 26) · ×2
  • Lockfile.lock (cyclomatic 26) lib/lockfile/lib/lockfile-1.3.0.rb:169 — Lockfile.lock 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.
  • Lockfile.lock (cyclomatic 26) lib/lockfile/lib/lockfile.rb:169 — Lockfile.lock 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 · Lockfile.initialize (cyclomatic 17) · ×2
  • Lockfile.initialize (cyclomatic 17) lib/lockfile/lib/lockfile-1.3.0.rb:137 — Lockfile.initialize has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
  • Lockfile.initialize (cyclomatic 17) lib/lockfile/lib/lockfile.rb:137 — Lockfile.initialize has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Lockfile.lock (cognitive 37) · ×2
  • Lockfile.lock (cognitive 37) lib/lockfile/lib/lockfile-1.3.0.rb:169 — Lockfile.lock has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 7 (10 pts), boolean chains 4, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Lockfile.lock (cognitive 37) lib/lockfile/lib/lockfile.rb:169 — Lockfile.lock has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 7 (10 pts), boolean chains 4, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Lockfile.initialize (cognitive 17) · ×2
  • Lockfile.initialize (cognitive 17) lib/lockfile/lib/lockfile-1.3.0.rb:137 — Lockfile.initialize has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 13, error handling 1 (2 pts), if/else 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
  • Lockfile.initialize (cognitive 17) lib/lockfile/lib/lockfile.rb:137 — Lockfile.initialize has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 13, error handling 1 (2 pts), if/else 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · TooManyMethods · ×2
  • TooManyMethods: WorkflowSQLite3DB lib/workflowmgr/workflowdb.rb:37 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: WorkflowXMLDoc lib/workflowmgr/workflowdoc.rb:13 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D30 · Dependency Vulnerabilities · Medium CVE · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×2
  • Duplicated block (19 lines × 2) lib/wfmstat/statusengine.rb:97 — lib/wfmstat/statusengine.rb:97-115 | lib/wfmstat/statusengine.rb:200-218 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) lib/workflowmgr/lsfbatchsystem.rb:224 — lib/workflowmgr/lsfbatchsystem.rb:224-242 | lib/workflowmgr/lsfcraybatchsystem.rb:82-100 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `lib/workflowmgr/lsfbatchsystem.rb:224` 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) · ×2
  • Duplicated block (11 lines × 2) lib/workflowmgr/workflowengine.rb:1747 — lib/workflowmgr/workflowengine.rb:1747-1757 | lib/workflowmgr/workflowreport.rb:749-759 — before extracting anything, compare `lib/workflowmgr/workflowengine.rb` and `lib/workflowmgr/workflowreport.rb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:361 — lib/lockfile/lib/lockfile-1.3.0.rb:361-371 | lib/lockfile/lib/lockfile.rb:361-371 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D1 · Cyclomatic Complexity · WorkflowEngine.submit_new_jobs (cyclomatic 41) · ×1
  • WorkflowEngine.submit_new_jobs (cyclomatic 41) lib/workflowmgr/workflowengine.rb:1694 — WorkflowEngine.submit_new_jobs has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · SLURMBatchSystem.submit (cyclomatic 40) · ×1
  • SLURMBatchSystem.submit (cyclomatic 40) lib/workflowmgr/slurmbatchsystem.rb:154 — SLURMBatchSystem.submit has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WorkflowEngine.boot (cyclomatic 39) · ×1
  • WorkflowEngine.boot (cyclomatic 39) lib/workflowmgr/workflowengine.rb:308 — WorkflowEngine.boot has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · WorkflowEngine.update_active_jobs (cyclomatic 33) · ×1
  • WorkflowEngine.update_active_jobs (cyclomatic 33) lib/workflowmgr/workflowengine.rb:1305 — WorkflowEngine.update_active_jobs has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · LSFCRAYBatchSystem.submit (cyclomatic 31) · ×1
  • LSFCRAYBatchSystem.submit (cyclomatic 31) lib/workflowmgr/lsfcraybatchsystem.rb:44 — LSFCRAYBatchSystem.submit 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 · LSFBatchSystem.submit (cyclomatic 30) · ×1
  • LSFBatchSystem.submit (cyclomatic 30) lib/workflowmgr/lsfbatchsystem.rb:135 — LSFBatchSystem.submit has cyclomatic complexity 30 (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 · PBSPROBatchSystem.refresh_jobacct (cyclomatic 30) · ×1
  • PBSPROBatchSystem.refresh_jobacct (cyclomatic 30) lib/workflowmgr/pbsprobatchsystem.rb:252 — PBSPROBatchSystem.refresh_jobacct has cyclomatic complexity 30 (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 · LSFBatchSystem.run_bhist_bjobs (cyclomatic 29) · ×1
  • LSFBatchSystem.run_bhist_bjobs (cyclomatic 29) lib/workflowmgr/lsfbatchsystem.rb:508 — LSFBatchSystem.run_bhist_bjobs has cyclomatic complexity 29 (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 · PBSPROBatchSystem.submit (cyclomatic 28) · ×1
  • PBSPROBatchSystem.submit (cyclomatic 28) lib/workflowmgr/pbsprobatchsystem.rb:76 — PBSPROBatchSystem.submit has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TORQUEBatchSystem.refresh_jobqueue (cyclomatic 27) · ×1
  • TORQUEBatchSystem.refresh_jobqueue (cyclomatic 27) lib/workflowmgr/torquebatchsystem.rb:200 — TORQUEBatchSystem.refresh_jobqueue has cyclomatic complexity 27 (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 · CycleCron.next (cyclomatic 24) · ×1
  • CycleCron.next (cyclomatic 24) lib/workflowmgr/cycledef.rb:92 — CycleCron.next 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 · CycleCron.previous (cyclomatic 24) · ×1
  • CycleCron.previous (cyclomatic 24) lib/workflowmgr/cycledef.rb:261 — CycleCron.previous 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 · SLURMBatchSystem.refresh_jobacct (cyclomatic 24) · ×1
  • SLURMBatchSystem.refresh_jobacct (cyclomatic 24) lib/workflowmgr/slurmbatchsystem.rb:534 — SLURMBatchSystem.refresh_jobacct has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · WorkflowEngine.rewind! (cyclomatic 24) · ×1
  • WorkflowEngine.rewind! (cyclomatic 24) lib/workflowmgr/workflowengine.rb:86 — WorkflowEngine.rewind! has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · COBALTBatchSystem.refresh_jobqueue (cyclomatic 23) · ×1
  • COBALTBatchSystem.refresh_jobqueue (cyclomatic 23) lib/workflowmgr/cobaltbatchsystem.rb:213 — COBALTBatchSystem.refresh_jobqueue 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 · WorkflowXMLDoc.tasks (cyclomatic 23) · ×1
  • WorkflowXMLDoc.tasks (cyclomatic 23) lib/workflowmgr/workflowdoc.rb:266 — WorkflowXMLDoc.tasks 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 · WorkflowSelection.handle_task_selection (cyclomatic 23) · ×1
  • WorkflowSelection.handle_task_selection (cyclomatic 23) REDACTED:146 — WorkflowSelection.handle_task_selection has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · WorkflowReport.submit_new_jobs (cyclomatic 22) · ×1
  • WorkflowReport.submit_new_jobs (cyclomatic 22) lib/workflowmgr/workflowreport.rb:729 — WorkflowReport.submit_new_jobs has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · StatusEngine.print_status (cyclomatic 21) · ×1
  • StatusEngine.print_status (cyclomatic 21) lib/wfmstat/statusengine.rb:266 — StatusEngine.print_status 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 · WorkflowEngine.deactivate_done_cycles (cyclomatic 21) · ×1
  • WorkflowEngine.deactivate_done_cycles (cyclomatic 21) lib/workflowmgr/workflowengine.rb:1489 — WorkflowEngine.deactivate_done_cycles has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · WorkflowEngine.complete! (cyclomatic 20) · ×1
  • WorkflowEngine.complete! (cyclomatic 20) lib/workflowmgr/workflowengine.rb:593 — WorkflowEngine.complete! 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. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · COBALTBatchSystem.submit (cyclomatic 19) · ×1
  • COBALTBatchSystem.submit (cyclomatic 19) lib/workflowmgr/cobaltbatchsystem.rb:102 — COBALTBatchSystem.submit has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · MOABBatchSystem.submit (cyclomatic 19) · ×1
  • MOABBatchSystem.submit (cyclomatic 19) lib/workflowmgr/moabbatchsystem.rb:108 — MOABBatchSystem.submit has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · SLURMBatchSystem.refresh_jobqueue (cyclomatic 19) · ×1
  • SLURMBatchSystem.refresh_jobqueue (cyclomatic 19) lib/workflowmgr/slurmbatchsystem.rb:409 — SLURMBatchSystem.refresh_jobqueue 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 · TORQUEBatchSystem.submit (cyclomatic 19) · ×1
  • TORQUEBatchSystem.submit (cyclomatic 19) lib/workflowmgr/torquebatchsystem.rb:96 — TORQUEBatchSystem.submit has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · WorkflowEngine.harvest_pending_jobids (cyclomatic 19) · ×1
  • WorkflowEngine.harvest_pending_jobids (cyclomatic 19) lib/workflowmgr/workflowengine.rb:1177 — WorkflowEngine.harvest_pending_jobids 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. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · COBALTBatchSystem.refresh_jobacct (cyclomatic 18) · ×1
  • COBALTBatchSystem.refresh_jobacct (cyclomatic 18) lib/workflowmgr/cobaltbatchsystem.rb:293 — COBALTBatchSystem.refresh_jobacct 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 · NoBatchSystem.find_all_jobs (cyclomatic 18) · ×1
  • NoBatchSystem.find_all_jobs (cyclomatic 18) lib/workflowmgr/nobatchsystem.rb:233 — NoBatchSystem.find_all_jobs 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 · MOABBatchSystem.refresh_jobqueue (cyclomatic 17) · ×1
  • MOABBatchSystem.refresh_jobqueue (cyclomatic 17) lib/workflowmgr/moabbatchsystem.rb:213 — MOABBatchSystem.refresh_jobqueue has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · MOABTORQUEBatchSystem.refresh_jobqueue (cyclomatic 17) · ×1
  • MOABTORQUEBatchSystem.refresh_jobqueue (cyclomatic 17) lib/workflowmgr/moabtorquebatchsystem.rb:152 — MOABTORQUEBatchSystem.refresh_jobqueue has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · WorkflowEngine.with_locked_db (cyclomatic 17) · ×1
  • WorkflowEngine.with_locked_db (cyclomatic 17) lib/workflowmgr/workflowengine.rb:800 — WorkflowEngine.with_locked_db 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. This file is where this pass's cyclomatic complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 37 methods over the threshold — including the worst — and 94 of the 323 points over it (29%), 2.5× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 38). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · WorkflowSubset.selected? (cyclomatic 17) · ×1
  • WorkflowSubset.selected? (cyclomatic 17) lib/workflowmgr/workflowsubset.rb:68 — WorkflowSubset.selected? 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 · WorkflowReport.harvest_pending_jobids (cyclomatic 16) · ×1
  • WorkflowReport.harvest_pending_jobids (cyclomatic 16) lib/workflowmgr/workflowreport.rb:353 — WorkflowReport.harvest_pending_jobids 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 · WorkflowEngine.boot (cognitive 70) · ×1
  • WorkflowEngine.boot (cognitive 70) lib/workflowmgr/workflowengine.rb:308 — WorkflowEngine.boot has cognitive complexity 70 (threshold 15). Drivers by points: if/else 41 (62 pts), boolean chains 5, error handling 1, match/switch 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. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · WorkflowEngine.update_active_jobs (cognitive 50) · ×1
  • WorkflowEngine.update_active_jobs (cognitive 50) lib/workflowmgr/workflowengine.rb:1305 — WorkflowEngine.update_active_jobs has cognitive complexity 50 (threshold 15). Drivers by points: if/else 26 (37 pts), boolean chains 10, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · WorkflowEngine.submit_new_jobs (cognitive 50) · ×1
  • WorkflowEngine.submit_new_jobs (cognitive 50) lib/workflowmgr/workflowengine.rb:1694 — WorkflowEngine.submit_new_jobs has cognitive complexity 50 (threshold 15). Drivers by points: if/else 33 (41 pts), boolean chains 7, error handling 1, match/switch 1 (nesting depth added 8). 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. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · StatusEngine.print_status (cognitive 45) · ×1
  • StatusEngine.print_status (cognitive 45) lib/wfmstat/statusengine.rb:266 — StatusEngine.print_status has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (30 pts), ternaries 4 (8 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WorkflowEngine.deactivate_done_cycles (cognitive 40) · ×1
  • WorkflowEngine.deactivate_done_cycles (cognitive 40) lib/workflowmgr/workflowengine.rb:1489 — WorkflowEngine.deactivate_done_cycles has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (40 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · SLURMBatchSystem.submit (cognitive 39) · ×1
  • SLURMBatchSystem.submit (cognitive 39) lib/workflowmgr/slurmbatchsystem.rb:154 — SLURMBatchSystem.submit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 3 (5 pts), boolean chains 3, error handling 1 (2 pts) (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 · CycleCron.next (cognitive 38) · ×1
  • CycleCron.next (cognitive 38) lib/workflowmgr/cycledef.rb:92 — CycleCron.next has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WorkflowEngine.complete! (cognitive 38) · ×1
  • WorkflowEngine.complete! (cognitive 38) lib/workflowmgr/workflowengine.rb:593 — WorkflowEngine.complete! has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CycleCron.previous (cognitive 37) · ×1
  • CycleCron.previous (cognitive 37) lib/workflowmgr/cycledef.rb:261 — CycleCron.previous has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (30 pts), loops 3 (5 pts), boolean chains 1, ternaries 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 · WorkflowSelection.handle_task_selection (cognitive 33) · ×1
  • WorkflowSelection.handle_task_selection (cognitive 33) REDACTED:146 — WorkflowSelection.handle_task_selection has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 4, match/switch 1 (2 pts) (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 · PBSPROBatchSystem.submit (cognitive 32) · ×1
  • PBSPROBatchSystem.submit (cognitive 32) lib/workflowmgr/pbsprobatchsystem.rb:76 — PBSPROBatchSystem.submit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 1, 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 · WorkflowEngine.rewind! (cognitive 32) · ×1
  • WorkflowEngine.rewind! (cognitive 32) lib/workflowmgr/workflowengine.rb:86 — WorkflowEngine.rewind! has cognitive complexity 32 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 2 (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. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · SLURMBatchSystem.refresh_jobacct (cognitive 30) · ×1
  • SLURMBatchSystem.refresh_jobacct (cognitive 30) lib/workflowmgr/slurmbatchsystem.rb:534 — SLURMBatchSystem.refresh_jobacct has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 2, error handling 1, match/switch 1 (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 · WorkflowIOProxy.initialize (cognitive 28) · ×1
  • WorkflowIOProxy.initialize (cognitive 28) lib/workflowmgr/workflowioproxy.rb:23 — WorkflowIOProxy.initialize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), error handling 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LSFCRAYBatchSystem.submit (cognitive 27) · ×1
  • LSFCRAYBatchSystem.submit (cognitive 27) lib/workflowmgr/lsfcraybatchsystem.rb:44 — LSFCRAYBatchSystem.submit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 3 (4 pts), boolean chains 2, error handling 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 · WorkflowXMLDoc.tasks (cognitive 27) · ×1
  • WorkflowXMLDoc.tasks (cognitive 27) lib/workflowmgr/workflowdoc.rb:266 — WorkflowXMLDoc.tasks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 5 (9 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WorkflowReport.submit_new_jobs (cognitive 26) · ×1
  • WorkflowReport.submit_new_jobs (cognitive 26) lib/workflowmgr/workflowreport.rb:729 — WorkflowReport.submit_new_jobs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · LSFBatchSystem.run_bhist_bjobs (cognitive 25) · ×1
  • LSFBatchSystem.run_bhist_bjobs (cognitive 25) lib/workflowmgr/lsfbatchsystem.rb:508 — LSFBatchSystem.run_bhist_bjobs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (4 pts), boolean chains 2, error handling 1 (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 · WorkflowDBSelection.db_query_cycles (cognitive 25) · ×1
  • WorkflowDBSelection.db_query_cycles (cognitive 25) lib/workflowmgr/workflowdbselection.rb:18 — WorkflowDBSelection.db_query_cycles has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LSFBatchSystem.submit (cognitive 23) · ×1
  • LSFBatchSystem.submit (cognitive 23) lib/workflowmgr/lsfbatchsystem.rb:135 — LSFBatchSystem.submit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PBSPROBatchSystem.refresh_jobacct (cognitive 23) · ×1
  • PBSPROBatchSystem.refresh_jobacct (cognitive 23) lib/workflowmgr/pbsprobatchsystem.rb:252 — PBSPROBatchSystem.refresh_jobacct has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (5 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SLURMBatchSystem.refresh_jobqueue (cognitive 23) · ×1
  • SLURMBatchSystem.refresh_jobqueue (cognitive 23) lib/workflowmgr/slurmbatchsystem.rb:409 — SLURMBatchSystem.refresh_jobqueue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 1, error handling 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · WorkflowEngine.harvest_pending_jobids (cognitive 23) · ×1
  • WorkflowEngine.harvest_pending_jobids (cognitive 23) lib/workflowmgr/workflowengine.rb:1177 — WorkflowEngine.harvest_pending_jobids has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), error handling 3, boolean chains 1, ternaries 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. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · NoBatchSystem.find_all_jobs (cognitive 22) · ×1
  • NoBatchSystem.find_all_jobs (cognitive 22) lib/workflowmgr/nobatchsystem.rb:233 — NoBatchSystem.find_all_jobs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TORQUEBatchSystem.refresh_jobqueue (cognitive 22) · ×1
  • TORQUEBatchSystem.refresh_jobqueue (cognitive 22) lib/workflowmgr/torquebatchsystem.rb:200 — TORQUEBatchSystem.refresh_jobqueue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, error handling 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · WorkflowReport.harvest_pending_jobids (cognitive 22) · ×1
  • WorkflowReport.harvest_pending_jobids (cognitive 22) lib/workflowmgr/workflowreport.rb:353 — WorkflowReport.harvest_pending_jobids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WorkflowSQLite3DB.lock_workflow (cognitive 21) · ×1
  • WorkflowSQLite3DB.lock_workflow (cognitive 21) lib/workflowmgr/workflowdb.rb:92 — WorkflowSQLite3DB.lock_workflow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 4 (9 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SLURMBatchSystem.statuses (cognitive 20) · ×1
  • SLURMBatchSystem.statuses (cognitive 20) lib/workflowmgr/slurmbatchsystem.rb:98 — SLURMBatchSystem.statuses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, error handling 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 · NoBatchSystem.find_job (cognitive 19) · ×1
  • NoBatchSystem.find_job (cognitive 19) lib/workflowmgr/nobatchsystem.rb:136 — NoBatchSystem.find_job has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · WorkflowEngine.with_locked_db (cognitive 19) · ×1
  • WorkflowEngine.with_locked_db (cognitive 19) lib/workflowmgr/workflowengine.rb:800 — WorkflowEngine.with_locked_db has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: lib/workflowmgr/workflowengine.rb holds 8 of the 42 methods over the threshold — including the worst — and 202 of the 543 points over it (37%), 3.9× the next-largest file (lib/workflowmgr/slurmbatchsystem.rb at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · WorkflowReport.update_active_jobs (cognitive 19) · ×1
  • WorkflowReport.update_active_jobs (cognitive 19) lib/workflowmgr/workflowreport.rb:472 — WorkflowReport.update_active_jobs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 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 · LSFBatchSystem.status (cognitive 18) · ×1
  • LSFBatchSystem.status (cognitive 18) lib/workflowmgr/lsfbatchsystem.rb:92 — LSFBatchSystem.status has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), 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.
D2 · Cognitive Complexity · WorkflowSQLite3DB.verify_permissions (cognitive 18) · ×1
  • WorkflowSQLite3DB.verify_permissions (cognitive 18) lib/workflowmgr/workflowdb.rb:899 — WorkflowSQLite3DB.verify_permissions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · COBALTBatchSystem.refresh_jobqueue (cognitive 17) · ×1
  • COBALTBatchSystem.refresh_jobqueue (cognitive 17) lib/workflowmgr/cobaltbatchsystem.rb:213 — COBALTBatchSystem.refresh_jobqueue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 2 (3 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · DBProxy.initialize (cognitive 16) · ×1
  • DBProxy.initialize (cognitive 16) lib/workflowmgr/dbproxy.rb:22 — DBProxy.initialize has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 4 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MOABTORQUEBatchSystem.status (cognitive 16) · ×1
  • MOABTORQUEBatchSystem.status (cognitive 16) lib/workflowmgr/moabtorquebatchsystem.rb:84 — MOABTORQUEBatchSystem.status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 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 · WorkflowMgr.log (cognitive 16) · ×1
  • WorkflowMgr.log (cognitive 16) lib/workflowmgr/utilities.rb:156 — WorkflowMgr.log has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WorkflowXMLDoc.pre_parse (cognitive 16) · ×1
  • WorkflowXMLDoc.pre_parse (cognitive 16) lib/workflowmgr/workflowdoc.rb:870 — WorkflowXMLDoc.pre_parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, ternaries 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (5 members, 27 shared lines) · ×1
  • Near-duplicate member family (5 members, 27 shared lines) lib/workflowmgr/moabbatchsystem.rb:215 — lib/workflowmgr/moabbatchsystem.rb:215-290 | lib/workflowmgr/moabbatchsystem.rb:300-365 | lib/workflowmgr/moabtorquebatchsystem.rb:154-228 | lib/workflowmgr/moabtorquebatchsystem.rb:238-302 | lib/workflowmgr/torquebatchsystem.rb:201-297 — These 5 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Edited copy of a member (158 corresponding lines) · ×1
  • Edited copy of a member (158 corresponding lines) lib/workflowmgr/cycledef.rb:94 — lib/workflowmgr/cycledef.rb:94-253 | lib/workflowmgr/cycledef.rb:263-420 — These two members are one piece of code written twice and then edited apart: 158 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (80 corresponding lines) · ×1
  • Edited copy of a member (80 corresponding lines) lib/workflowmgr/workflowengine.rb:1059 — lib/workflowmgr/workflowengine.rb:1059-1139 | lib/workflowmgr/workflowreport.rb:239-318 — These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (38 corresponding lines) · ×1
  • Edited copy of a member (38 corresponding lines) lib/wfmstat/statusengine.rb:31 — lib/wfmstat/statusengine.rb:31-68 | lib/workflowmgr/workflowengine.rb:32-78 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (57 corresponding lines) · ×1
  • Edited copy of a member (57 corresponding lines) lib/workflowmgr/bqsproxy.rb:26 — lib/workflowmgr/bqsproxy.rb:26-82 | lib/workflowmgr/dbproxy.rb:24-89 — These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 38+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 38+ corresponding lines) lib/workflowmgr/bqsproxy.rb:94 — lib/workflowmgr/bqsproxy.rb:94-133 | lib/workflowmgr/dbproxy.rb:101-138 | lib/workflowmgr/workflowioproxy.rb:196-234 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (36 corresponding lines) · ×1
  • Edited copy of a member (36 corresponding lines) lib/wfmstat/statusengine.rb:78 — lib/wfmstat/statusengine.rb:78-115 | lib/wfmstat/statusengine.rb:183-218 — These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (41 corresponding lines) · ×1
  • Edited copy of a member (41 corresponding lines) lib/workflowmgr/workflowengine.rb:1645 — lib/workflowmgr/workflowengine.rb:1645-1686 | lib/workflowmgr/workflowreport.rb:681-721 — These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (35 corresponding lines) · ×1
  • Edited copy of a member (35 corresponding lines) lib/workflowmgr/workflowengine.rb:882 — lib/workflowmgr/workflowengine.rb:882-922 | lib/workflowmgr/workflowreport.rb:127-161 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (21 corresponding lines) · ×1
  • Edited copy of a member (21 corresponding lines) lib/workflowmgr/cycledef.rb:623 — lib/workflowmgr/cycledef.rb:623-647 | lib/workflowmgr/cycledef.rb:657-677 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (31 corresponding lines) · ×1
  • Edited copy of a member (31 corresponding lines) lib/workflowmgr/nobatchsystem.rb:310 — lib/workflowmgr/nobatchsystem.rb:310-340 | lib/workflowmgr/nobatchsystem.rb:350-380 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (17 corresponding lines) · ×1
  • Edited copy of a member (17 corresponding lines) lib/wfmstat/statusengine.rb:424 — lib/wfmstat/statusengine.rb:424-448 | lib/workflowmgr/dependency.rb:740-756 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) lib/workflowmgr/workflowdb.rb:949 — lib/workflowmgr/workflowdb.rb:949-973 | lib/workflowmgr/workflowdb.rb:984-1009 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 13+ corresponding lines) lib/workflowmgr/cobaltbatchsystem.rb:76 — lib/workflowmgr/cobaltbatchsystem.rb:76-94 | lib/workflowmgr/moabbatchsystem.rb:82-100 | lib/workflowmgr/torquebatchsystem.rb:76-88 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 7+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 7+ corresponding lines) lib/workflowmgr/dependency.rb:370 — lib/workflowmgr/dependency.rb:370-379 | lib/workflowmgr/dependency.rb:416-422 | lib/workflowmgr/dependency.rb:459-465 | lib/workflowmgr/dependency.rb:502-508 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) sbin/rocotocomplete.rb:17 — sbin/rocotocomplete.rb:17-22 | sbin/rocotorun.rb:18-23 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (102 lines × 2) · ×1
  • Duplicated block (102 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:171 — lib/lockfile/lib/lockfile-1.3.0.rb:171-272 | lib/lockfile/lib/lockfile.rb:171-272 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (52–53 lines × 2) · ×1
  • Duplicated block (52–53 lines × 2) lib/workflowmgr/moabbatchsystem.rb:238 — lib/workflowmgr/moabbatchsystem.rb:238-290 | lib/workflowmgr/moabtorquebatchsystem.rb:177-228 — before extracting anything, compare `lib/workflowmgr/moabbatchsystem.rb` and `lib/workflowmgr/moabtorquebatchsystem.rb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lib/workflowmgr/moabbatchsystem.rb:238` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (46 lines × 2) · ×1
  • Duplicated block (46 lines × 2) lib/workflowmgr/moabbatchsystem.rb:141 — lib/workflowmgr/moabbatchsystem.rb:141-186 | lib/workflowmgr/torquebatchsystem.rb:128-173 — before extracting anything, compare `lib/workflowmgr/moabbatchsystem.rb` and `lib/workflowmgr/torquebatchsystem.rb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (41 lines × 2) · ×1
  • Duplicated block (41 lines × 2) lib/workflowmgr/lsfbatchsystem.rb:254 — lib/workflowmgr/lsfbatchsystem.rb:254-294 | lib/workflowmgr/lsfcraybatchsystem.rb:169-209 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (35 lines × 2) · ×1
  • Duplicated block (35 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:277 — lib/lockfile/lib/lockfile-1.3.0.rb:277-311 | lib/lockfile/lib/lockfile.rb:277-311 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (32 lines × 3) · ×1
  • Duplicated block (32 lines × 3) lib/workflowmgr/moabbatchsystem.rb:146 — lib/workflowmgr/moabbatchsystem.rb:146-177 | lib/workflowmgr/pbsprobatchsystem.rb:183-214 | lib/workflowmgr/torquebatchsystem.rb:133-164 — before extracting anything, compare `lib/workflowmgr/moabbatchsystem.rb` and `lib/workflowmgr/torquebatchsystem.rb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lib/workflowmgr/moabbatchsystem.rb:146` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (27–29 lines × 5) · ×1
  • Duplicated block (27–29 lines × 5) lib/workflowmgr/moabbatchsystem.rb:217 — lib/workflowmgr/moabbatchsystem.rb:217-243 | lib/workflowmgr/moabbatchsystem.rb:305-333 | lib/workflowmgr/moabtorquebatchsystem.rb:156-182 | lib/workflowmgr/moabtorquebatchsystem.rb:243-270 | lib/workflowmgr/torquebatchsystem.rb:201-228 — before extracting anything, compare `lib/workflowmgr/moabbatchsystem.rb` and `lib/workflowmgr/moabtorquebatchsystem.rb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/workflowmgr/moabbatchsystem.rb:215` calls `getpwuid` and `lib/workflowmgr/torquebatchsystem.rb:200` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:139 — lib/lockfile/lib/lockfile-1.3.0.rb:139-166 | lib/lockfile/lib/lockfile.rb:139-166 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) lib/workflowmgr/workflowengine.rb:1021 — lib/workflowmgr/workflowengine.rb:1021-1044 | lib/workflowmgr/workflowreport.rb:201-224 — before extracting anything, compare `lib/workflowmgr/workflowengine.rb` and `lib/workflowmgr/workflowreport.rb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (20–22 lines × 2) · ×1
  • Duplicated block (20–22 lines × 2) lib/workflowmgr/workflowengine.rb:828 — lib/workflowmgr/workflowengine.rb:828-849 | lib/workflowmgr/workflowreport.rb:96-115 — before extracting anything, compare `lib/workflowmgr/workflowengine.rb` and `lib/workflowmgr/workflowreport.rb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (18 lines × 4) · ×1
  • Duplicated block (18 lines × 4) lib/workflowmgr/lsfbatchsystem.rb:67 — lib/workflowmgr/lsfbatchsystem.rb:67-84 | lib/workflowmgr/moabbatchsystem.rb:56-73 | lib/workflowmgr/moabtorquebatchsystem.rb:59-76 | lib/workflowmgr/torquebatchsystem.rb:50-67 — before extracting anything, compare `lib/workflowmgr/moabbatchsystem.rb` and `lib/workflowmgr/moabtorquebatchsystem.rb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×1
  • Duplicated block (25 lines × 2) lib/workflowmgr/moabbatchsystem.rb:341 — lib/workflowmgr/moabbatchsystem.rb:341-365 | lib/workflowmgr/moabtorquebatchsystem.rb:278-302 — before extracting anything, compare `lib/workflowmgr/moabbatchsystem.rb` and `lib/workflowmgr/moabtorquebatchsystem.rb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (17 lines × 3) · ×1
  • Duplicated block (17 lines × 3) lib/workflowmgr/bqsproxy.rb:34 — lib/workflowmgr/bqsproxy.rb:34-50 | lib/workflowmgr/dbproxy.rb:31-47 | lib/workflowmgr/workflowioproxy.rb:39-55 — before extracting anything, compare `lib/workflowmgr/bqsproxy.rb` and `lib/workflowmgr/dbproxy.rb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (15–17 lines × 2) · ×1
  • Duplicated block (15–17 lines × 2) lib/workflowmgr/cobaltbatchsystem.rb:221 — lib/workflowmgr/cobaltbatchsystem.rb:221-235 | lib/workflowmgr/pbsprobatchsystem.rb:270-286 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:341 — lib/lockfile/lib/lockfile-1.3.0.rb:341-356 | lib/lockfile/lib/lockfile.rb:341-356 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1
  • Duplicated block (15 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:376 — lib/lockfile/lib/lockfile-1.3.0.rb:376-390 | lib/lockfile/lib/lockfile.rb:376-390 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (12–13 lines × 3) · ×1
  • Duplicated block (12–13 lines × 3) lib/workflowmgr/bqsproxy.rb:121 — lib/workflowmgr/bqsproxy.rb:121-133 | lib/workflowmgr/dbproxy.rb:127-138 | lib/workflowmgr/workflowioproxy.rb:222-234 — before extracting anything, compare `lib/workflowmgr/bqsproxy.rb` and `lib/workflowmgr/dbproxy.rb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lib/workflowmgr/bqsproxy.rb:121` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (12–13 lines × 2) · ×1
  • Duplicated block (12–13 lines × 2) lib/workflowmgr/dependency.rb:742 — lib/workflowmgr/dependency.rb:742-754 | lib/workflowmgr/dependency.rb:770-781 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×1
  • Duplicated block (12 lines × 2) lib/workflowmgr/workflowengine.rb:509 — lib/workflowmgr/workflowengine.rb:509-520 | lib/workflowmgr/workflowengine.rb:1882-1893 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (8 lines × 5) · ×1
  • Duplicated block (8 lines × 5) lib/workflowmgr/workflowengine.rb:1516 — lib/workflowmgr/workflowengine.rb:1516-1523 | lib/workflowmgr/workflowengine.rb:1558-1565 | lib/workflowmgr/workflowengine.rb:1750-1757 | lib/workflowmgr/workflowreport.rb:606-613 | lib/workflowmgr/workflowreport.rb:752-759 — before extracting anything, compare `lib/workflowmgr/workflowengine.rb` and `lib/workflowmgr/workflowreport.rb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) lib/wfmstat/statusengine.rb:61 — lib/wfmstat/statusengine.rb:61-68 | lib/wfmstat/statusengine.rb:98-105 | lib/wfmstat/statusengine.rb:201-208 | lib/workflowmgr/workflowengine.rb:821-828 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `lib/wfmstat/statusengine.rb:61` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:27 — lib/lockfile/lib/lockfile-1.3.0.rb:27-34 | lib/lockfile/lib/lockfile.rb:27-34 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×1
  • Duplicated block (7 lines × 2) lib/workflowmgr/workflowdb.rb:289 — lib/workflowmgr/workflowdb.rb:289-295 | lib/workflowmgr/workflowdb.rb:373-379 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/workflowmgr/workflowdb.rb:289` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) lib/workflowmgr/workflowdb.rb:290 — lib/workflowmgr/workflowdb.rb:290-295 | lib/workflowmgr/workflowdb.rb:319-324 | lib/workflowmgr/workflowdb.rb:374-379 — 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 `lib/workflowmgr/workflowdb.rb:290` 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 (2–6 lines × 4) · ×1
  • Duplicated block (2–6 lines × 4) lib/workflowmgr/workflowdb.rb:297 — lib/workflowmgr/workflowdb.rb:297-302 | lib/workflowmgr/workflowdb.rb:326-331 | lib/workflowmgr/workflowdb.rb:354-355 | lib/workflowmgr/workflowdb.rb:381-386 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/workflowmgr/workflowdb.rb:297` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/workflowmgr/workflowdb.rb:297` calls `at` and `lib/workflowmgr/workflowdb.rb:354` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 7) · ×1
  • Duplicated block (6 lines × 7) lib/wfmstat/statusengine.rb:62 — lib/wfmstat/statusengine.rb:62-67 | lib/wfmstat/statusengine.rb:99-104 | lib/wfmstat/statusengine.rb:202-207 | lib/workflowmgr/bqsproxy.rb:126-131 | lib/workflowmgr/dbproxy.rb:131-136 | lib/workflowmgr/workflowengine.rb:822-827 | lib/workflowmgr/workflowioproxy.rb:227-232 — there are 7 copies across 5 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) lib/wfmstat/statusengine.rb:292 — lib/wfmstat/statusengine.rb:292-299 | lib/wfmstat/statusengine.rb:354-360 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:87 — lib/lockfile/lib/lockfile-1.3.0.rb:87-103 | lib/lockfile/lib/lockfile.rb:87-103 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×1
  • Duplicated block (10 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:327 — lib/lockfile/lib/lockfile-1.3.0.rb:327-336 | lib/lockfile/lib/lockfile.rb:327-336 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×1
  • Duplicated block (13 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:395 — lib/lockfile/lib/lockfile-1.3.0.rb:395-407 | lib/lockfile/lib/lockfile.rb:395-407 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) lib/lockfile/lib/lockfile-1.3.0.rb:449 — lib/lockfile/lib/lockfile-1.3.0.rb:449-454 | lib/lockfile/lib/lockfile.rb:449-454 — before extracting anything, compare `lib/lockfile/lib/lockfile-1.3.0.rb` and `lib/lockfile/lib/lockfile.rb` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging call was found in the 68 Ruby production file(s) this check read across 1 module(s). Each was searched for its ecosystem's logging libraries (Ruby: Rails.logger, Logger.new, SemanticLogger, Lograge) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
P5 · DR & Backup · No DR/backup evidence · ×1
  • No DR/backup evidence — A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
Minor — 29 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×18
  • Duplicated predicate lib/workflowmgr/workflowengine.rb:832 — `!(@bq_server.nil? || !@config.BatchQueueServer || WorkflowMgr.dryrun_mode?) && !@bq_server.running?` appears character-identically in 2 files — lib/workflowmgr/workflowengine.rb, lib/workflowmgr/workflowreport.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/workflowengine.rb:847 — `!@workflow_io_server.nil? && @config.WorkflowIOServer && !WorkflowMgr.dryrun_mode?` appears character-identically in 2 files — lib/workflowmgr/workflowengine.rb, lib/workflowmgr/workflowreport.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/bqsproxy.rb:102 — `@config.BatchQueueServer && !WorkflowMgr.dryrun_mode?` appears character-identically in 3 files — lib/workflowmgr/bqsproxy.rb, lib/workflowmgr/workflowengine.rb, lib/workflowmgr/workflowreport.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/workflowengine.rb:545 — `@config.BatchQueueServer || WorkflowMgr.dryrun_mode?` appears character-identically in 2 files — lib/workflowmgr/workflowengine.rb, lib/workflowmgr/workflowreport.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/dbproxy.rb:108 — `@config.DatabaseServer && !WorkflowMgr.dryrun_mode?` appears character-identically in 3 files — lib/workflowmgr/dbproxy.rb, lib/workflowmgr/workflowengine.rb, lib/workflowmgr/workflowreport.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/lockfile/lib/lockfile-1.3.0.rb:477 — `@opts[key] || @opts[key.to_s] || @opts[key.to_s.intern]` appears character-identically in 2 files — lib/lockfile/lib/lockfile-1.3.0.rb, lib/lockfile/lib/lockfile.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/workflowengine.rb:1074 — `dbcycledef.group == cycledef.group && dbcycledef.cycledef == cycledef.cycledef` appears character-identically in 2 files — lib/workflowmgr/workflowengine.rb, lib/workflowmgr/workflowreport.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/wfmstat/statusengine.rb:64 — `e.is_a?(ArgumentError) || e.is_a?(NameError) || e.is_a?(TypeError)` appears character-identically in 5 files — lib/wfmstat/statusengine.rb, lib/workflowmgr/bqsproxy.rb, lib/workflowmgr/dbproxy.rb, lib/workflowmgr/workflowengine.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/lockfile/lib/lockfile-1.3.0.rb:151 — `getopt('dont_clean') || @klass.dont_clean` appears character-identically in 2 files — lib/lockfile/lib/lockfile-1.3.0.rb, lib/lockfile/lib/lockfile.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/lockfile/lib/lockfile-1.3.0.rb:154 — `getopt('dont_sweep') || @klass.dont_sweep` appears character-identically in 2 files — lib/lockfile/lib/lockfile-1.3.0.rb, lib/lockfile/lib/lockfile.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/lockfile/lib/lockfile-1.3.0.rb:153 — `getopt('poll_max_sleep') || @klass.poll_max_sleep` appears character-identically in 2 files — lib/lockfile/lib/lockfile-1.3.0.rb, lib/lockfile/lib/lockfile.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/lockfile/lib/lockfile-1.3.0.rb:152 — `getopt('poll_retries') || @klass.poll_retries` appears character-identically in 2 files — lib/lockfile/lib/lockfile-1.3.0.rb, lib/lockfile/lib/lockfile.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/moabbatchsystem.rb:350 — `job['State'] =~ /^Removed/ || job['CompletionCode'] =~ /^CNCLD/` appears character-identically in 2 files — lib/workflowmgr/moabbatchsystem.rb, lib/workflowmgr/moabtorquebatchsystem.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/cobaltbatchsystem.rb:269 — `record[:state] == "UNKNOWN" && !record[:exit_status].nil?` appears character-identically in 3 files — lib/workflowmgr/cobaltbatchsystem.rb, lib/workflowmgr/pbsprobatchsystem.rb, lib/workflowmgr/torquebatchsystem.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/cobaltbatchsystem.rb:279 — `record[:state] == "UNKNOWN" || (["SUCCEEDED", "FAILED"].include?(record[:state]) && (record[:start_time].nil? || record[:end_time].nil?))` appears character-identically in 2 files — lib/workflowmgr/cobaltbatchsystem.rb, lib/workflowmgr/torquebatchsystem.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/rocoto_actor/handle.rb:19 — `socket && RocotoActor.broker_client(socket)` appears character-identically in 2 files — lib/rocoto_actor/handle.rb, lib/rocoto_actor/timer.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/lockfile/lib/lockfile-1.3.0.rb:198 — `tmp_stat.rdev == lock_stat.rdev and tmp_stat.ino == lock_stat.ino` appears character-identically in 2 files — lib/lockfile/lib/lockfile-1.3.0.rb, lib/lockfile/lib/lockfile.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate lib/workflowmgr/workflowengine.rb:889 — `workflowdoc.cyclelifespan || WorkflowMgr.ddhhmmss_to_seconds("365:00:00:00")` appears character-identically in 2 files — lib/workflowmgr/workflowengine.rb, lib/workflowmgr/workflowreport.rb. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D34 · Knowledge Freshness · Orphaned file · ×3
  • Orphaned file lib/lockfile/lib/lockfile-1.3.0.rb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file lib/lockfile/lib/lockfile.rb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file lib/lockfile/install.rb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: lib/workflowmgr/workflowdb.rb, lib/rocoto_actor/future.rb, lib/rocoto_actor/protocol.rb, lib/rocoto_actor/transport.rb, lib/rocoto_actor/handle.rb. Pair on, review, or document these before any departure.
D30 · Dependency Vulnerabilities · Low CVE · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 3 of 42 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 42 of the 66 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: lib/lockfile/lib/lockfile-1.3.0.rb, lib/lockfile/lib/lockfile.rb, lib/lockfile/install.rb. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
IC1 · Incompleteness & stubs · Disabled test · ×1
  • Disabled test spec/workflowmgr/workflowdb_spec.rb:118 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:8 — No static application security testing detected. For this repository's stack, add brakeman for Rails apps, otherwise `semgrep --config=auto` or CodeQL's ruby pack as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
X5 · Nullable reference types · Ruby's type checker does not check nil everywhere · ×1
  • Ruby's type checker does not check nil everywhere — This repository commits no Sorbet configuration (`sorbet/config`) and no `Steepfile`, so nothing type-checks its 66 Ruby product file(s): a nilable value reaches a method call silently and raises `NoMethodError: undefined method … for nil` the first time it is nil. A `# typed:` sigil does nothing without a `sorbet/config` beside the code; a Steep run configured only on a command line is not something this check can read.
Minor — 4 finding(s)
D12 · Dependency Hygiene · Outdated · ×4
  • Outdated: nokogiri — `nokogiri` is resolved to 1.19.3-aarch64-linux-gnu in the committed REDACTED but 1.19.7 is the current release on rubygems.org, and it already satisfies the `"~> 1.19.3"` requirement declared in Gemfile — so the lockfile is behind this repository's own declared range. This build is therefore missing every fix published since, including any security fix. Run `bundle update nokogiri` and commit the updated REDACTED.
  • Outdated: rubocop — `rubocop` is resolved to 1.86.1 in the committed REDACTED but 1.92.2 is the current release on rubygems.org, and it already satisfies the `"~> 1.66"` requirement declared in Gemfile — so the lockfile is behind this repository's own declared range. This build is therefore missing every fix published since, including any security fix. Run `bundle update rubocop` and commit the updated REDACTED.
  • Outdated: rubocop-rspec — `rubocop-rspec` is resolved to 3.9.0 in the committed REDACTED but 3.10.2 is the current release on rubygems.org, and it already satisfies the `"~> 3.0"` requirement declared in Gemfile — so the lockfile is behind this repository's own declared range. This build is therefore missing every fix published since, including any security fix. Run `bundle update rubocop-rspec` and commit the updated REDACTED.
  • Outdated: sqlite3 — `sqlite3` is resolved to 2.9.6-aarch64-linux-gnu in the committed REDACTED but 2.10.2 is the current release on rubygems.org, and it already satisfies the `"~> 2.0"` requirement declared in Gemfile — so the lockfile is behind this repository's own declared range. This build is therefore missing every fix published since, including any security fix. Run `bundle update sqlite3` and commit the updated REDACTED.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-3dbef747bf3741d7addf86f32290034e/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=596" --report-format json --report-path /tmp/watchdog-gitleaks-3dbef747bf3741d7addf86f32290034e/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-3dbef747bf3741d7addf86f32290034e/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .18artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .3artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .0artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1e8a9-6918-7348-98e5-f06e9fb42ae1 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

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

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